Supporting random access in files of variable length records
From MaRDI portal
Recommendations
Cites work
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)