Algorithms for a hashed file with variable-length records
From MaRDI portal
Publication:1193836
DOI10.1016/0020-0255(92)90071-FzbMath0767.68038MaRDI QIDQ1193836
Publication date: 27 September 1992
Published in: Information Sciences (Search for Journal in Brave)
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