Supporting random access in files of variable length records

DOI10.1016/0020-0190(93)90200-SzbMath0770.68046OpenAlexW2089016512MaRDI QIDQ1802061

Justin Zobel, Alistair Moffat

Publication date: 21 September 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90200-s

zbMATH Keywords

file structuresbit-string compression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99) Data structures (68P05)

Related Items (4)

Efficient optimally lazy algorithms for minimal-interval semantics ⋮ Ranked Document Retrieval in External Memory ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• On the Complexity of Searching a Set of Vectors
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Run-length encodings (Corresp.)

This page was built for publication: Supporting random access in files of variable length records