Database Paper Browser

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
769
Venue
PODS
Year
1986
Pagerank
4.1945683e-05
Overall Rank
12,997 | 9.59%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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
255 Interpolation-Based Index Maintenance 1983 PODS 0.00030498284
Previous Page 1 / 1 Next

Semantically Similar Papers