DBScholar

Back to papers

A Dynamic Hash File for Random and Sequential Accessing

Summary: Introduces order-preserving variants of linear hashing that support both efficient random and sequential access, unlike traditional suffix/prefix schemes. Controls sparse buckets to sustain near one-I/O random lookups on uniform data and B-tree-like performance under clustering. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h015907eebbf6c7f0
Venue
VLDB
Year
1983
Pagerank
5.3183356e-05
Overall Rank
8,546 | 42.55%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{orenstein_vldb83,
        title = {{A Dynamic Hash File for Random and Sequential Accessing}},
        author = {Orenstein, Jack A.},
        journal = {PVLDB},
        series = {{VLDB} '83},
        pages = {132--143},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
264 A Class of Data Structures for Associative Searching 1984 PODS 0.00022757762
5,505 The Interpolation-Based Grid File 1985 PODS 6.1017692e-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
523 Interpolation-Based Index Maintenance 1983 PODS 0.00016912345
855 Storage Mappings For Multidimensional Linear Dynamic Hashing 1983 PODS 0.00013437655
1,248 Trie Hashing 1981 SIGMOD 0.00011345869
Previous Page 1 / 1 Next

Semantically Similar Papers