A linear lower bound on index size for text retrieval

DOI10.1016/S0196-6774(03)00043-9zbMath1079.68029OpenAlexW4244324195MaRDI QIDQ4458870

Erik D. Demaine, Alejandro López-Ortiz

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00043-9

zbMATH Keywords

information-retrieval systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (8)

Succinct indices for path minimum, with applications ⋮ The cell probe complexity of succinct data structures ⋮ The function-inversion problem: barriers and opportunities ⋮ Fast String Dictionary Lookup with One Error ⋮ Counting suffix arrays and strings ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Orthogonal Range Searching for Text Indexing ⋮ A Survey of Data Structures in the Bitprobe Model

This page was built for publication: A linear lower bound on index size for text retrieval