DBScholar

Back to papers

Order Preserving Linear Hashing Using Dynamic Key Statistics

Summary: Introduces order-preserving linear hashing that preserves sequential access by rebuilding order-preserving hash functions at each expansion. Dynamic key statistics (e.g., positional digram frequencies) guide function construction for approximate uniformity; experiments validate feasibility. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
768
Venue
PODS
Year
1986
Pagerank
5.093636e-05
Overall Rank
13,195 | 9.48%
DOI
10.1145/6012.6014

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{robinson_pods86,
        address = {New York, NY, USA},
        series = {{PODS} '86},
        title = {{Order Preserving Linear Hashing Using Dynamic Key Statistics}},
        url = {https://dl.acm.org/doi/10.1145/6012.6014},
        doi = {10.1145/6012.6014},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Robinson, John T.},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
507 Interpolation-Based Index Maintenance 1983 PODS 0.00017277375
Previous Page 1 / 1 Next

Semantically Similar Papers