Random Sampling from Pseudo-Ranked B+ Trees

Summary: Introduces sampling from pseudo-ranked B+ trees, augmented with rank limits. Low rejection with marginal update cost; outperforms full-root updates and high-rejection sampling, validated on production databases and prototype workload simulations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8276
Venue: VLDB
Year: 1992
Pagerank: 6.6905953e-05
Overall Rank: 4,458 | 69.42%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Gennady Antoshenkov (Digital Equipment Corporation)

BibTeX Citation

@article{antoshenkov_vldb92,
        title = {{Random Sampling from Pseudo-Ranked B+ Trees}},
        author = {Antoshenkov, Gennady},
        journal = {PVLDB},
        series = {{VLDB} '92},
        pages = {375},
        year = {1992}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
149	New Sampling-Based Summary Statistics for Improving Approximate Query Answers	1998	SIGMOD	0.00029226907
2,127	Selectivity Estimation in Spatial Databases	1999	SIGMOD	9.127762e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
36	Accurate Estimation Of The Number Of Tuples Satisfying A Condition	1984	SIGMOD	0.00048351457
55	Statistical Estimators for Relational Algebra Expressions	1988	PODS	0.00040746149
76	Practical Selectivity Estimation through Adaptive Sampling	1990	SIGMOD	0.00037054261
118	Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries	1988	SIGMOD	0.00031922279
173	Simple Random Sampling from Relational Databases	1986	VLDB	0.00027273858
178	Processing Aggregate Relational Queries with Hard Time Constraints	1989	SIGMOD	0.00026881845
283	Object and File Management in the EXODUS Extensible Database System	1986	VLDB	0.00022377907
467	Random Sampling from B+ trees	1989	VLDB	0.00018002218
992	Query Size Estimation by Adaptive Sampling (Extended Abstract)	1990	PODS	0.00012790174
1,382	Estimating the Size of Generalized Transitive Closures	1989	VLDB	0.00010965236

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,020	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB
2	14,493	Towards an Optimal Data-Structure: CB-trees	1984	VLDB
3	2,968	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD
4	173	Simple Random Sampling from Relational Databases	1986	VLDB
5	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
6	10,093	AB-tree: Index for Concurrent Random Sampling and Updates	2022	VLDB
7	54	On Random Sampling over Joins	1999	SIGMOD
8	10,824	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB
9	9,518	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD
10	467	Random Sampling from B+ trees	1989	VLDB