Database Paper Browser

Back to papers

Random Sampling from Hash Files

Summary: Evaluates random sampling from hash files on storage across static (open addressing, overflow chains) and dynamic hash schemes (Linear/Extendible). Iterative and batch sampling; analyzes cost by successful search; dynamic hashing boosts sampling efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2501
Venue
SIGMOD
Year
1990
Pagerank
0.00016704834
Overall Rank
783 | 94.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
948 Distribution-Dependent Hashing Functions and Their Characteristics 1975 SIGMOD 0.00015112484
4,086 External Perfect Hashing 1985 SIGMOD 6.4608969e-05
357 Random Sampling from B+ trees 1989 VLDB 0.00026020098
1,523 Concurrency and Linear Hashing 1985 PODS 0.00011518774
5,363 A Mapping Function for the Directory of a Multidimensional Extendible Hashing 1984 VLDB 5.5471634e-05
1,723 Unified Dynamic Hashing 1984 VLDB 0.00010753629
13,043 A Dynamic Perfect Hash Function Defined By An Extended Hash Indicator Table 1984 VLDB 4.1945683e-05
8,820 Hashing in Practice, Analysis of Hashing and Universal Hashing 1988 SIGMOD 4.4419702e-05
8,060 A Dynamic Hash File for Random and Sequential Accessing 1983 VLDB 4.5943696e-05
1,708 A Single-File Version Of Linear Hashing With Partial Expansions 1982 VLDB 0.00010815668