honeymoose
/
OpenSearch
mirror of https://github.com/honeymoose/OpenSearch.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[docs] Document meaning of "FST" and "FSTs". 

Conflicts:
	docs/reference/index-modules/fielddata.asciidoc
This commit is contained in:
Alexander Pepper 2015-09-10 11:13:02 +02:00 committed by mikemccand
parent 86f1b07df0
commit df9d4eca66
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
docs/reference/search/suggesters/completion-suggest.asciidoc
View File

@ -15,11 +15,12 @@ suggestion is, why you should use it at all, if you have prefix queries
already. The answer is simple: Prefix suggestions are fast.
The data structures are internally backed by Lucenes
`AnalyzingSuggester`, which uses FSTs to execute suggestions. Usually
these data structures are costly to create, stored in-memory and need to
be rebuilt every now and then to reflect changes in your indexed
documents. The `completion` suggester circumvents this by storing the
FST as part of your index during index time. This allows for really fast
`AnalyzingSuggester`, which uses FSTs (finite state transducers) to
execute suggestions. Usually these data structures are costly to
create, stored in-memory and need to be rebuilt every now and then to
reflect changes in your indexed documents. The `completion` suggester
circumvents this by storing the FST (finite state transducer) as part
of your index during index time. This allows for really fast
loads and executions.
[[completion-suggester-mapping]]