lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From heritrix.lucene <>
Subject Re: searching for the part of a term.
Date Wed, 27 Sep 2006 07:45:22 GMT
Thanks for yor reply..

> : Since the overhead in first is the speed of the system, i think adopting
> : second method will be better.

Since iMy index size is around 10GB the second method is also taking a lot
of time for queries like

One more things that i found in;#13345

was to index rotated token of a word, and then search by the prefix query.
But i think here also i'll face the speed issue because of the prefix
query..(If i am right...)

One more thing that we can do is to prepare the n-grams of a word and then
index each of them.
This way the index size will increase by several magnitude on the cost of

Is this the way by which i can implement the fastest substring search ????


> : Is there any other solution for this problem?? Am i going in right
> : direction??
> you're definitely on teh right path -- those are the two bigsolutions i
> can think of, which appraoch you should take really depends on the nature
> of your data, what your performance concerns are, and how much development
> time you have.
> Here's another good thread you may want to check out...
> -Hoss
> ---------------------------------------------------------------------
> To unsubscribe, e-mail:
> For additional commands, e-mail:

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message