Thanks for the quick reply.
I've changed my code to the following. The problem now is that the
MultiReader doesn't seem to get closed. In fact, the number of open files
(returned by "lsof | grep index/ | wc -l") keeps increasing whenever the
IndexWriter adds new documents until the webapp crashes.
> The WhitespaceAnalyzer breaks up text by spaces and tabs and newlines.
> After that, you can wildcards. This will use very little space. I
> believe leading&trailing wildcards are supported now, right?
If leading wildcards take too much time (don't know, really) then one
could also try to index
The WhitespaceAnalyzer breaks up text by spaces and tabs and newlines.
After that, you can wildcards. This will use very little space. I
believe leading&trailing wildcards are supported now, right?
On Sun, Aug 26, 2012 at 11:29 AM, Ilya Zavorin wrote:
> The user uploads a set of text files, eithe
1. getRefCount()
2. No
Mossaab Bagdouri schrieb:
>Hi,
>
>I've just migrated my webapp from Lucene 3.6 to 4.0-BETA. My 2 indexes
>are
>updated every couple of minutes by a batch. The webapp searcher needs
>to
>get refreshed whenever this happens. In 3.6, I was doing it this way:
>
>private Inde
Hi,
I've just migrated my webapp from Lucene 3.6 to 4.0-BETA. My 2 indexes are
updated every couple of minutes by a batch. The webapp searcher needs to
get refreshed whenever this happens. In 3.6, I was doing it this way:
private IndexSearcher getIndexSearcher() {
try {
if (is
The user uploads a set of text files, either all of them at once or one at a
time, and then they will be searched locally on the phone against a set of
"hotlist" words. This assumes no connection to any sort of server so everything
must be done locally.
I already have Lucene integrated so I mig
> Does Lucene support this type of structure, or do I need to somehow implement
> it outside Lucene?
You'd have to implement it separately but it'd be much, much smaller
than Lucene itself (even obfuscated).
> By the way, I need this to run on an Android phone so size of memory might be
> an is
