Database Paper Browser

Back to papers

A Dynamic Hash File for Random and Sequential Accessing

Summary: A dynamic hash file built from order-preserving linear hashing variants supports both random and sequential access. A sparse-bucket constraint with prefixing yields competitive performance with B-trees: random lookups are ~one disk access on uniform data; clustered data are B-tree-like, with rare costly inserts. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7590
Venue
VLDB
Year
1983
Pagerank
4.5943696e-05
Overall Rank
8,060 | 43.93%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
216 A Class of Data Structures for Associative Searching 1984 PODS 0.00033542705
5,146 The Interpolation-Based Grid File 1985 PODS 5.6644798e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
255 Interpolation-Based Index Maintenance 1983 PODS 0.00030498284
503 Storage Mappings For Multidimensional Linear Dynamic Hashing 1983 PODS 0.00021520176
730 Trie Hashing 1981 SIGMOD 0.00017483181
Previous Page 1 / 1 Next

Semantically Similar Papers