Towards Efficient Positional Inverted Index †
Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Prague 16000, Czech Republic
Current address: Thákurova 2700/9, 16000 Praha 6, Czech Republic.
Author to whom correspondence should be addressed.
Academic Editor: Bruno Carpentieri
Received: 23 December 2016 / Revised: 7 February 2017 / Accepted: 17 February 2017 / Published: 22 February 2017
We 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
) 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
is a number of stems, n
is a number of unique stems, α
is a step/period of the back pointers
in the inverted list and b
is the size of the word of computer memory given in bits. The space complexity of the presentation layer is
with respect to
as a probability of a stem variant at position i
as the probability of separator or stop word at position j
as the number of separators and stop words.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
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.
Procházka, Petr; Holub, Jan. 2017. "Towards Efficient Positional Inverted Index †." Algorithms 10, no. 1: 30.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.