DBScholar

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
2563
Venue
SIGMOD
Year
1990
Pagerank
0.00011663837
Overall Rank
1,206 | 91.73%
DOI
10.1145/93597.98746

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{olken_sigmod90,
        title = {{Random Sampling from Hash Files}},
        author = {Olken, Frank and Rotem, Doron and Xu, Ping},
        series = {{SIGMOD} '90},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/93597.98746},
        url = {https://dl.acm.org/doi/10.1145/93597.98746},
        year = {1990}
}

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