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)
Incoming Non-self Citations Over Time
Authors
- 1. Frank Olken
- 2. Doron Rotem
- 3. Ping Xu
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 151 | An Evaluation of Non-Equijoin Algorithms | 1991 | VLDB | 0.00041010211 |
| 548 | Practical Skew Handling in Parallel Joins | 1992 | VLDB | 0.00020369531 |
| 803 | On the Relative Cost of Sampling for Join Selectivity Estimation | 1994 | PODS | 0.00016438972 |
| 1,425 | Scalable Approximate Query Processing With The DBO Engine | 2007 | SIGMOD | 0.00012044433 |
| 1,472 | Online Maintenance of Very Large Random Samples on Flash Storage | 2008 | VLDB | 0.00011798842 |
| 2,377 | Online Maintenance of Very Large Random Samples | 2004 | SIGMOD | 8.9359321e-05 |
| 4,177 | Density Biased Sampling: An Improved Method for Data Mining and Clustering | 2000 | SIGMOD | 6.3768049e-05 |
| 4,244 | A Disk-Based Join With Probabilistic Guarantees* | 2005 | SIGMOD | 6.3228453e-05 |
| 7,358 | Algebraic Optimization of Computations over Scientific Databases | 1993 | VLDB | 4.7478752e-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 |
|---|---|---|---|---|
| 37 | Statistical Estimators for Relational Algebra Expressions | 1988 | PODS | 0.00075597514 |
| 133 | Processing Aggregate Relational Queries with Hard Time Constraints | 1989 | SIGMOD | 0.00043220055 |
| 352 | Random Sampling from B+ trees | 1989 | VLDB | 0.00026276293 |
| 792 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016580866 |
| 897 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00015484372 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 952 | Distribution-Dependent Hashing Functions and Their Characteristics | 1975 | SIGMOD | 0.00015097764 |
| 4,090 | External Perfect Hashing | 1985 | SIGMOD | 6.454673e-05 |
| 352 | Random Sampling from B+ trees | 1989 | VLDB | 0.00026276293 |
| 1,525 | Concurrency and Linear Hashing | 1985 | PODS | 0.00011508932 |
| 5,372 | A Mapping Function for the Directory of a Multidimensional Extendible Hashing | 1984 | VLDB | 5.5424242e-05 |
| 1,723 | Unified Dynamic Hashing | 1984 | VLDB | 0.00010740426 |
| 13,054 | A Dynamic Perfect Hash Function Defined By An Extended Hash Indicator Table | 1984 | VLDB | 4.1905499e-05 |
| 8,820 | Hashing in Practice, Analysis of Hashing and Universal Hashing | 1988 | SIGMOD | 4.4377121e-05 |
| 8,064 | A Dynamic Hash File for Random and Sequential Accessing | 1983 | VLDB | 4.5900019e-05 |
| 1,708 | A Single-File Version Of Linear Hashing With Partial Expansions | 1982 | VLDB | 0.00010802316 |