97 search results - page 1 / 20 » Random Sampling from Pseudo-Ranked B Trees |
VLDB
1992
ACM
13 years 9 months ago
1992
ACM
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 firs...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
SIAMCOMP
1998
13 years 4 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
SSDBM
1990
IEEE
13 years 9 months ago
1990
IEEE
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...