Supporting random access in files of variable length records

DOI10.1016/0020-0190(93)90200-SMaRDI QIDQ1802061zbMATH OpenOpenAlexFDO

Authors Alistair Moffat, Justin Zobel

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) Data structures (68P05) Theory of data (68P99)

Recommendations

• Algorithms for a hashed file with variable-length records
• scientific article; zbMATH DE number 1304039
• Lower bounds on the size of selection and rank indexes
• Optimal organization of multilevel indexed sequential files
• Simple Random Access Compression

Cites work

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

Cited in

(7)

• I/O-efficient data structures for colored range and prefix reporting
• Ranked Document Retrieval in External Memory
• Efficient optimally lazy algorithms for minimal-interval semantics
• Top-\(k\) document retrieval in optimal time and linear space
• Addressing for Random-Access Storage with Multiple Bucket Capacities
• Algorithms for a hashed file with variable-length records
• scientific article; zbMATH DE number 7765406 (Why is no real title available?)

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

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