[
https://issues.apache.org/jira/browse/SOLR-1316?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12757774#action_12757774
]
Ishan Chattopadhyaya commented on SOLR-1316:
--------------------------------------------
For an extremely fast in-memory lookup table, I saw a TrieMap used in one of my
projects. In a Trie Map, the nodes of a Hash Map are internally arranged like a
Trie. The following implementation is very space efficient:
http://airhead-research.googlecode.com/svn/trunk/sspace/src/edu/ucla/sspace/util/
Also, I have a fast memory mapped file based on disk TST implementation. If
someone things it would be good, I can submit a patch. :-)
> Create autosuggest component
> ----------------------------
>
> Key: SOLR-1316
> URL: https://issues.apache.org/jira/browse/SOLR-1316
> Project: Solr
> Issue Type: New Feature
> Components: search
> Affects Versions: 1.4
> Reporter: Jason Rutherglen
> Priority: Minor
> Fix For: 1.5
>
> Attachments: suggest.patch, TST.zip
>
> Original Estimate: 96h
> Remaining Estimate: 96h
>
> Autosuggest is a common search function that can be integrated
> into Solr as a SearchComponent. Our first implementation will
> use the TernaryTree found in Lucene contrib.
> * Enable creation of the dictionary from the index or via Solr's
> RPC mechanism
> * What types of parameters and settings are desirable?
> * Hopefully in the future we can include user click through
> rates to boost those terms/phrases higher
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
