Database Paper Browser

Back to papers

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
2239
Venue
SIGMOD
Year
1984
Pagerank
5.8091931e-05
Overall Rank
4,952 | 65.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
5,913 A Reliable Parallel Backend Using Multi-Attribute Clustering and Select-Join Operator 1986 VLDB 5.2760277e-05
6,555 TOWARDS DBMSs FOR SUPPORTING NEW APPLICATIONS 1986 VLDB 5.0155947e-05
7,466 Managing Complex Objects in an Extensible Relational DBMS 1989 VLDB 4.7219717e-05
Previous Page 1 / 1 Next

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
255 Interpolation-Based Index Maintenance 1983 PODS 0.00030498284
503 Storage Mappings For Multidimensional Linear Dynamic Hashing 1983 PODS 0.00021520176
730 Trie Hashing 1981 SIGMOD 0.00017483181
4,226 A High Performance, Universal, Key Associative Access Method 1983 SIGMOD 6.3465691e-05
Previous Page 1 / 1 Next

Semantically Similar Papers