Corpus ID: 1209478

Random Sampling from Pseudo-Ranked B+ Trees

@inproceedings{Antoshenkov1992RandomSF,
  title={Random Sampling from Pseudo-Ranked B+ Trees},
  author={G. Antoshenkov},
  booktitle={VLDB},
  year={1992}
}
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The first approach requires the entire root-to-leaf path to be updated with each insertion and deletion. The second has no update overhead, but incurs a high rejection rate for the compressed-key B+ trees commonly used in practice. In this paper we introduce a new sampling method based on pseudo-ranked B+ trees, which are B… Expand
44 Citations
Random sampling from databases: a survey
Materialized Sample Views for Database Approximation
Materialized Sample Views for Database Approximation
Categorical Range Queries in Large Databases
Categorical Range Queires in Large Databases
SUPRA: a sampling-query optimization method for large-scale OLAP
Online Random Shuffling of Large Database Tables
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
Random Sampling from B+ Trees
Statistical estimators for relational algebra expressions
Simple Random Sampling from Relational Databases
A tree based access method (TBSAM) for fast processing of aggregate queries
  • J. Srivastava, V. Lum
  • Computer Science
  • Proceedings. Fourth International Conference on Data Engineering
  • 1988
LRU Stack Processing
...
1
2
3
...