(13/11/27 9:19), Scott Smith wrote:
I'm doing some highlighting with the following code fragment:
formatter = new SimpleHTMLFormatter(,
);
Scorer score = new QueryScorer(myQuery);
ht = new Highlighter(formatter, score);
ht.
I'm doing some highlighting with the following code fragment:
formatter = new SimpleHTMLFormatter(,
);
Scorer score = new QueryScorer(myQuery);
ht = new Highlighter(formatter, score);
ht.setTextFragmenter(new NullFragmenter());
Hi,
> For now I use such a large RAM buffer to make the segments equally sized
> without merging (it must be good for multithreaded search).
> Can one get such segments with the help of merging (thus having as little
> indexWriter RAM buffer as he wants) using some existing Lucene
> MergePolicy?
Hi all,
Is this possible to extract Query Terms for particular Document. The
existing method extractTerms(Set term) expand the query search over
all the documents (IndexReader) which sometime takes long time to execute,
even I am Interested only in one Document. This case is much critical wh
Hi Mike,
Thanks a lot for sharing. I posted my impressions on the conference as
well, right after it has finished. So I'll share them here, if you don't
mind:
Day 1:
http://dmitrykan.blogspot.fi/2013/11/lucene-revolution-eu-2013-in-dublin-day.html
Day 2:
http://dmitrykan.blogspot.fi/2013/11/lucen
Thanks all!
It's strange that with limited indexWriter's maxThreadStates to 1 (and all the
other variables left intact) the indexer finally worked without OOM's.
Am I right that indexWriter, no matter how many threads it uses, can store in
memory the maximum of maxRAMBufferSizeMB of data (which
Uwe,
> Lucene Filters are always executed before on the full index. This is
> done inside getDocIdSet(), which is similar to scorer() in Querys.
> Most filters return a bitset in this method, so they calculate the
> whole bitset on the full index - this is what your filter is doing.
> The strategy
>>> What are you intending to do?
[VIDHYA] a field with following values should be sorted in "Natural Order"
Name field has Bay 1, Bay10, Bay 11, bay 2, Bay 3
should be sorted asBay 1, bay 2, Bay 3, Bay10, Bay 11
-Original Message-
From: Umashanker, Srividhya
Sent: Tue
We do have a duplicate field for every indexed field.
1> field stores text with exact case (used for case sensitive search)
2>lowercased text (used for case insensitive search)
Let me find some example for the collator analyzer.
Here is the .java lost attachment
package index.search.util
