Towards Efficient Positional Inverted Index †
AbstractWe address the problem of positional indexing in the natural language domain. The positional inverted index contains the information of the word positions. Thus, it is able to recover the original text file, which implies that it is not necessary to store the original file. Our Positional Inverted Self-Index (PISI) stores the word position gaps encoded by variable byte code. Inverted lists of single terms are combined into one inverted list that represents the backbone of the text file since it stores the sequence of the indexed words of the original file. The inverted list is synchronized with a presentation layer that stores separators, stop words, as well as variants of the indexed words. The Huffman coding is used to encode the presentation layer. The space complexity of the PISI inverted list is
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Procházka, P.; Holub, J. Towards Efficient Positional Inverted Index †. Algorithms 2017, 10, 30.
Procházka P, Holub J. Towards Efficient Positional Inverted Index †. Algorithms. 2017; 10(1):30.Chicago/Turabian Style
Procházka, Petr; Holub, Jan. 2017. "Towards Efficient Positional Inverted Index †." Algorithms 10, no. 1: 30.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.