DBScholar

Back to papers

Interpolation-Based Index Maintenance

Summary: Interpolation-based order-preserving hashing for online maintenance of dynamic external files supporting insert/update/delete and orthogonal range queries. Adapts linear hashing to eliminate index/address-directory, uses O(n) space, tunable storage, and achieves very small average search lengths (successful <<2, unsuccessful <<4). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
647
Venue
PODS
Year
1983
Pagerank
0.00017277375
Overall Rank
507 | 96.53%
DOI
10.1145/588058.588070

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{burkhard_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Interpolation-Based Index Maintenance}},
        url = {https://dl.acm.org/doi/10.1145/588058.588070},
        doi = {10.1145/588058.588070},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Burkhard, Walter A.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00082404462
253 A Class of Data Structures for Associative Searching 1984 PODS 0.00023200431
Previous Page 1 / 1 Next

Semantically Similar Papers