Thanks Mathieu! Didn't realise this was avalaible before you mentioned it.
Did comparative tests, and it is as fast or much faster, thanks to caching, depending on the length of the prefix. Hey, it even works with wildcard within the "search string". Thanks again! Isn't Lucene wonderful! Patrick Mathieu Lecarme wrote: > If you do that, you enumerate every terms!!! > If you use a alphabeticaly sorted collection, you can stop, when match > stop, but, you have to test every terms before matching. > Lucene gives you tools to match begining of a term, just use it!! > > M. > Le 8 juin 07 à 14:57, Patrick Turcotte a écrit : > >> Hi, >> >> What we did was this: >> >> 1) When you application starts, it scans the index for terms values and >> store them in a map or something. >> >> 2) When you receive "ajax requests", you compare with the map data and >> return the relevant part. Works quite fast for us, without round trips >> to Lucene. >> >> Patrick --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
