A Multikey Hashing Scheme Using Predicate Trees

Summary: Multikey hashing for dynamic files using a predicate-tree that encodes several keys into a single logical address. This address defines a predicate-based partition of the space, turning a retrieval into a set of partitions and unifying hashing schemes, with qualitative analysis. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2301
Venue: SIGMOD
Year: 1984
Pagerank: 6.3281371e-05
Overall Rank: 5,185 | 64.43%
DOI: 10.1145/602259.602275

Incoming Non-self Citations Over Time

Authors

1. Patrick Valduriez (INRIA; SABRE Project)
2. Yann Viemont (INRIA; SABRE Project)

BibTeX Citation

@inproceedings{valduriez_sigmod84,
        title = {{A MULTIKEY HASHING SCHEME USING PREDICATE TREES}},
        author = {Valduriez, Patrick and Viemont, Yann},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602275},
        url = {https://dl.acm.org/doi/10.1145/602259.602275},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,609	A Reliable Parallel Backend Using Multiattribute Clustering and Select-Join Operator	1986	VLDB	5.8231458e-05
7,138	Towards DBMSs for Supporting New Applications	1986	VLDB	5.6933382e-05
8,123	Managing Complex Objects in an Extensible Relational DBMS	1989	VLDB	5.4830239e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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
833	Storage Mappings For Multidimensional Linear Dynamic Hashing	1983	PODS	0.0001372601
1,221	Trie Hashing	1981	SIGMOD	0.00011605619
4,505	A High Performance, Universal, Key Associative Access Method	1983	SIGMOD	6.6592412e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	13,216	Modified Dynamic Hashing	1985	SIGMOD
2	2,082	A Dynamic Clustering Technique For Physical Database Design	1980	SIGMOD
3	2,961	Distribution-Dependent Hashing Functions and Their Characteristics	1975	SIGMOD
4	13,242	A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table	1984	VLDB
5	833	Storage Mappings For Multidimensional Linear Dynamic Hashing	1983	PODS
6	13,135	Clustered Multiattribute Hash Files	1989	PODS
7	4,357	Balanced Multidimensional Extendible Hash Tree	1986	PODS
8	5,577	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB
9	4,505	A High Performance, Universal, Key Associative Access Method	1983	SIGMOD
10	5,047	A Multidimensional Digital Hashing Scheme for Files With Composite Keys	1985	SIGMOD