Our implementation of facet search can handle this. Using bitsets for
intersection is not scalable performance wise when index is large.
We are using a compact forwarded index representation in memory for the
counting. Similar to FieldCache idea but more compact.
Check it out at: http://sourcefor
On Saturday 07 February 2009 19:57:19 Raffaella Ventaglio wrote:
> Hi,
>
> I am trying to implement a kind of faceted search using Lucene 2.4.0.
>
> I have a list of configuration rules that tell me how to generate this
> facets and the corresponding queries (that can range from simple term
> que
The first approach is rather limiting when facets number grows.
The "SortedVIntList" approach is similar to field cache. It's better to use
the fieldcache for the facet search, which is the "normal" approach and used
in tools like Solr, DBSight, Bobo Browse Engine, etc.
To avoid creating a lot of
Did you look at Solr? It provides faceted search out of the box and is
built on top of Lucene.
Sameer.
On Feb 7, 2009, at 10:57 AM, Raffaella Ventaglio
wrote:
Hi,
I am trying to implement a kind of faceted search using Lucene 2.4.0.
I have a list of configuration rules that tell me how
Hi,
I am trying to implement a kind of faceted search using Lucene 2.4.0.
I have a list of configuration rules that tell me how to generate this
facets and the corresponding queries (that can range from simple term
queries to complex boolean queries).
When my application starts, it creates the w
5 feb 2009 kl. 14.44 skrev Lebiram:
If HitCollector only returns a document once then he might be
referring to an application ID that is assigned to a field that has
been indexed twice or more with different document IDs.
I'll clarify this with him.
However is there a way to somehow do a
