Uploaded image for project: 'Solr'
  1. Solr
  2. SOLR-2378

FST-based Lookup (suggestions) for prefix matches.

    Details

      Description

      Implement a subclass of Lookup based on finite state automata/ transducers (Lucene FST package). This issue is for implementing a relatively basic prefix matcher, we will handle infixes and other types of input matches gradually. Impl. phases:

      • write a DFA based suggester effectively identical to ternary tree based solution right now,
      • baseline benchmark against tern. tree (memory consumption, rebuilding speed, indexing speed; reuse Andrzej's benchmark code)
      • modify DFA to encode term weights directly in the automaton (optimize for onlyMostPopular case)
      • benchmark again
      • benchmark again
      • modify the tutorial on the wiki http://wiki.apache.org/solr/Suggester

        Attachments

          Issue Links

            Activity

              People

              • Assignee:
                dweiss Dawid Weiss
                Reporter:
                dweiss Dawid Weiss
              • Votes:
                0 Vote for this issue
                Watchers:
                0 Start watching this issue

                Dates

                • Created:
                  Updated:
                  Resolved: