Towards Efficient Positional Inverted Index †

Algorithms

Petr Procházka¹  Jan Holub¹ 

[1] Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Prague 16000, Czech Republic;

关键词: inverted index;    search engines;    self-indexing;    natural language processing;    data compression;   

DOI  :  10.3390/a10010030

来源: DOAJ

【 摘 要 】

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 (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 O (( N − n ) ⌈log2 b N ⌉+(⌊ N − nα⌋+ n )×(⌈log2 b n ⌉+ 1 )) where N 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 O ( −∑i = 1N ⌈log 2 p in ( i ) ⌉−∑j = 1 N ′⌈log 2 p j ′⌉+ N ) with respect to p in ( i )as a probability of a stem variant at position i, p j ′ as the probability of separator or stop word at position j and N ′ as the number of separators and stop words.

【 授权许可】

Unknown