Hashing with overflow indexing

DOI10.1007/BF02136030zbMATH Open0545.68088OpenAlexW1989315967MaRDI QIDQ797305FDOQ797305

Authors: A. Törn 

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02136030

Recommendations

• Linear-density hashing with dynamic overflow sharing
• File organizations with shared overflow blocks for variable length objects
• Analysis of hashing with chaining in the prime area
• Single access hashing with overflow separators for dynamic files
• Optimality in external memory hashing

zbMATH Keywords

hashingdatabase managementfile organizationhash-table representationsOverflow Indexing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cites Work

• Dynamic hashing
• Optimum data base reorganization points
• Title not available (Why is that?)
• Optimum Storage Allocation for Initial Loading of a File

Cited In (4)

• Linear-density hashing with dynamic overflow sharing
• Single access hashing with overflow separators for dynamic files
• Analysis of hashing with chaining in the prime area
• Algorithms for a hashed file with variable-length records

This page was built for publication: Hashing with overflow indexing

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