|Maintainer||Uwe Schmidt (firstname.lastname@example.org)|
A variant of the Inverted.Memory index with an optimized prefix tree instead of a trie as central data structure. This version should be more space efficient as the trie and more runtime efficient when combining whole indexes.
For switching from Memory to this module, only the import has to be modified
Inverted index types
The index consists of a table which maps documents to ids and a number of index parts.
The index parts are identified by a name, which should denote the context of the words.
The index part is the real inverted index. Words are mapped to their occurrences.
Create an index with just one word in one context.