Addressing for Random-Access Storage with Multiple Bucket Capacities

DOI10.1145/321172.321178MaRDI QIDQ5720478zbMATH OpenOpenAlexFDO

Authors Melvin Tainiter

Publication date 1963

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321172.321178

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Capacity-Independent Address Mapping for Flash Storage Devices with Explosively Growing Capacity
• On-Demand Block-Level Address Mapping in Large-Scale NAND Flash Storage Systems
• Random access machines with multi-dimensional memories
• scientific article; zbMATH DE number 6399332
• scientific article; zbMATH DE number 1421009
• Supporting random access in files of variable length records
• scientific article; zbMATH DE number 1928591

Cited in

(3)

• An ordered minimal perfect hashing scheme based upon Euler's theorem
• A scheme for constructing ordered minimal perfect hashing functions
• Frequency loading and linear probing

This page was built for publication: Addressing for Random-Access Storage with Multiple Bucket Capacities

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