DBScholar

Back to papers

Storage Mappings For Multidimensional Linear Dynamic Hashing

Summary: Presents MLDH, a multidimensional extension of linear dynamic hashing that supports efficient multi-attribute direct access using multidimensional hashing and bucket-splitting rules. Retains linear hashing's dynamic, incremental growth and high storage utilization for controllable expansion and low-cost inserts/updates without expensive reorganizations, improving over single-attribute and tree-structured schemes. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
648
Venue
PODS
Year
1983
Pagerank
0.0001372601
Overall Rank
833 | 94.29%
DOI
10.1145/588058.588071

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ouksel_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{STORAGE MAPPINGS FOR MULTIDIMENSIONAL LINEAR DYNAMIC HASHING}},
        url = {https://dl.acm.org/doi/10.1145/588058.588071},
        doi = {10.1145/588058.588071},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ouksel, Mohamed and Scheuermann, Peter},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 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
507 Interpolation-Based Index Maintenance 1983 PODS 0.00017277375
Previous Page 1 / 1 Next

Semantically Similar Papers