Database Paper Browser

Back to papers

A Multidimensional Digital Hashing Scheme for Files With Composite Keys

Summary: Proposes multidimensional hashing, a scheme for composite-key data using linear hashing on each attribute to compute a d-tuple address. A mapping converts the d-tuple to a linear address in O(d), enabling inserts/deletes and partial-match/range queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2275
Venue
SIGMOD
Year
1985
Pagerank
6.1424256e-05
Overall Rank
4,490 | 68.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,008 The BANG file: a new kind of grid file 1987 SIGMOD 0.00014666726
3,676 Providing Better Support for a Class of Decision Support Queries 1996 SIGMOD 6.8547125e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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
503 Storage Mappings For Multidimensional Linear Dynamic Hashing 1983 PODS 0.00021520176
1,525 Cascade Hashing 1984 VLDB 0.00011513634
1,708 A Single-File Version Of Linear Hashing With Partial Expansions 1982 VLDB 0.00010815668
5,363 A Mapping Function for the Directory of a Multidimensional Extendible Hashing 1984 VLDB 5.5471634e-05
Previous Page 1 / 1 Next

Semantically Similar Papers