Towards efficient positional inverted index

DOI10.3390/A10010030MaRDI QIDQ1662625zbMATH OpenOpenAlexFDO

Authors Jan Holub, P. P. Procházka

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a10010030

zbMATH Keywords

data compressionnatural language processingsearch enginesself-indexinginverted index

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Recommendations

• A linear lower bound on index size for text retrieval
• Complete inverted files for efficient text retrieval and analysis
• Elias-Fano meets single-term top-\(k\) document retrieval
• A linear lower bound on index size for text retrieval
• Algorithms and Computation

Cites work

• Compressed representations of sequences and full-text indexes
• Run-length encodings (Corresp.)
• Self-indexing based on LZ77
• Universal codeword sets and representations of the integers
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.

Cited in

(2)

• Inverted Index Support for Numeric Search
• Everywhere-Tight Information Cost Tradeoffs for Augmented Index

This page was built for publication: Towards efficient positional inverted index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662625)