Re: simple question about decRef

2013-06-02 Thread Shai Erera
The best practice is: - The component which calls DirectoryReader.open should call close() - Any code which calls incRef() should match that call with decRef(), preferably in a try-finally clause Shai On Sun, Jun 2, 2013 at 6:18 AM, Yonghui Zhao wrote: > Thanks, Michael. > > My under

Re: Message via your Google Profile: Lucene limits

2013-06-02 Thread Oded Sofer
I am trying to implement Lucene on high volume. We implemented Lucene 4.1, The search with Facets is very slow and consume high amount of RAM and cause Swapping. We have 7gb of index, it includes 70 millions of Documents (pretty short doc). The Search (inc. Facets) takes 30-60 seconds which is way

Zero-position query?

2013-06-02 Thread Lance Norskog
What is a Lucene query that will find two words at the same term position? Is there a class that will do this? Is the feature available from the Lucene query syntax or any other syntax parsers? For example, if I'm using synonyms at index time I should get the base word and all synonyms at the

Re: Zero-position query?

2013-06-02 Thread Israel Tsadok
You can do this with a PhraseQuery[1]. Just add more terms with position 0. [1] http://lucene.apache.org/core/4_3_0/core/org/apache/lucene/search/PhraseQuery.html#add(org.apache.lucene.index.Term, int) On Mon, Jun 3, 2013 at 6:46 AM, Lance Norskog wrote: > What is a Lucene query that will fin

Re: Message via your Google Profile: Lucene limits

2013-06-02 Thread Shai Erera
Hi Oded, These times sound way too high, even for really hard queries. Can you share a bit about how you index the documents and what do they contain? Specifically: - How many facet dimensions per-document do you have? - Are the dimensions unique, i.e. a document has one category from a