Sciweavers

VLDB
1992
ACM
137views Database» more  VLDB 1992»
13 years 7 months ago
Random Sampling from Pseudo-Ranked B+ Trees
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...
Gennady Antoshenkov
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
13 years 10 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan