e
>> From: Walter Underwood <[EMAIL PROTECTED]>
>> To: solr-user@lucene.apache.org
>> Sent: Tuesday, May 6, 2008 11:21:31 AM
>> Subject: Re: Your valuable suggestion on autocomplete
>>
>> I wrote a prefix map (ternary search tree) in Java and load it
Hi Wunder,
- Original Message
> From: Walter Underwood <[EMAIL PROTECTED]>
> To: solr-user@lucene.apache.org
> Sent: Tuesday, May 6, 2008 11:21:31 AM
> Subject: Re: Your valuable suggestion on autocomplete
>
> I wrote a prefix map (ternary search tree) in Java an
n the home
> page.
>
> - nishant
>
> www.reviewgist.com
>
>
>
>
>
> - Original Message
> From: Vaijanath N. Rao <[EMAIL PROTECTED]>
> To: solr-user@lucene.apache.org
> Sent: Tuesday, May 6, 2008 12:43:25 PM
> Subject: Re: Your valuable suggestion on au
: Vaijanath N. Rao <[EMAIL PROTECTED]>
To: solr-user@lucene.apache.org
Sent: Tuesday, May 6, 2008 12:43:25 PM
Subject: Re: Your valuable suggestion on autocomplete
Hi Rantjil Bould,
I would suggest you to give a thought on Trie data structure which is
used for auto-complete. Hitting Solr for
Hi Rantjil Bould,
I would suggest you to give a thought on Trie data structure which is
used for auto-complete. Hitting Solr for every prefix looks time
consuming job, but I might be wrong. I have Trie implementation and it
works very fast (of course it is in memory data structure unlike solr
