Database Paper Browser

Back to papers

A Dynamic Perfect Hash Function Defined By An Extended Hash Indicator Table

Summary: Dynamic file organization using perfect hash functions defined by Extended Hash Indicator Tables (EHITs); resizing without data reorganization. Simulations show ~70% utilization (s=7, r=10, n≤1000); retrieval requires one disk access due to perfect hashing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7650
Venue
VLDB
Year
1984
Pagerank
4.1945683e-05
Overall Rank
13,043 | 9.27%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,573 Concurrent Operations in Extendible Hashing 1986 VLDB 4.4937074e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
730 Trie Hashing 1981 SIGMOD 0.00017483181
Previous Page 1 / 1 Next

Semantically Similar Papers