Algorithms for a hashed file with variable-length records

DOI10.1016/0020-0255(92)90071-FzbMath0767.68038OpenAlexW2152995933MaRDI QIDQ1193836

S. Singh

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90071-f

zbMATH Keywords

overflow chainingprimary key file organizationstatic hashed files

Mathematics Subject Classification ID

Database theory (68P15) Theory of data (68P99)

Related Items (1)

Analysis for the end of block wasted space

Cites Work

• Unnamed Item
• Hashing with overflow indexing
• Analysis for the end of block wasted space
• Optimal multiway search trees for variable size keys
• Implications of certain assumptions in database performance evauation
• Optimal pagination of B-trees with variable-length items
• On the distribution of wasted space at the end of file blocks
• Ordered hash tables

This page was built for publication: Algorithms for a hashed file with variable-length records