WaterfallTree — External indexing data structure

  • Iliya Tronkov
  • Published 2014 in
    2014 IEEE International Conference on Automation…


W-tree is a natural generalization of B<sup>+</sup>-tree. Operations in B<sup>+</sup>-tree are executed synchronously (one by one), while in W-tree, operations are executed asynchronously (in groups). When an operation enters B<sup>+</sup>-tree it &#x201D;sinks&#x201D; up to its respective leaf. When an operation enters W-tree, it &#x201D;stops&#x201D; in the first node which is not overloaded. Operations in W-tree accumulate in its internal nodes. When a certain internal node overloads with operations, the branch with the greatest number of operations adjacent to it is selected and they are &#x201D;poured down&#x201D; the tree. The W-tree data structure solves the problem of speed degradation when indexing records with random keys.

9 Figures and Tables

Cite this paper

@article{Tronkov2014WaterfallTreeE, title={WaterfallTree — External indexing data structure}, author={Iliya Tronkov}, journal={2014 IEEE International Conference on Automation, Quality and Testing, Robotics}, year={2014}, pages={1-6} }