Relaxed multi-way trees with group updates

Data structures with relaxed balance differ from standard structures in that rebalancing can be delayed and interspersed with updates. This gives extra flexibility in both sequential and parallel applications. We study the version of multi-way trees called (a,b)-trees (which includes B-trees) with the operations insertion, deletion, and group insertion. The latter has applications in for instance document databases and WWW search engines. We prove that we obtain the optimal asymptotic rebalancing complexities of amortized constant time for insertion and deletion and amortized logarithmic time in the size of the group for group insertion. These results hold even for the relaxed version. Our results also demonstrate that a binary tree scheme with the same complexities can be designed. This is an improvement over the existing results in the most interesting cases.

[1]  Sabine Hanke,et al.  The Performance of Concurrent Red-Black Tree Algorithms , 1998, WAE.

[2]  Eljas Soisalon-Soininen,et al.  Uncoupling updating and rebalancing in chromatic binary search trees , 1991, PODS '91.

[3]  Kim S. Larsen,et al.  Efficient Rebalancing of B-Trees with Relaxed Balance , 1996, Int. J. Found. Comput. Sci..

[4]  Sheau-Dong Lang,et al.  Batch Insertion for Tree Structured File Organizations - Improving Differential Database Reprensentation , 1986, Inf. Syst..

[5]  Eljas Soisalon-Soininen,et al.  Relaxed Balancing in Search Trees , 1997, Advances in Algorithms, Languages, and Complexity.

[6]  R. Tarjan.  Amortized Computational Complexity , 1985 .

[7]  Christos Faloutsos,et al.  Hybrid Index Organizations for Text Databases , 1992, EDBT.

[8]  Eljas Soisalon-Soininen,et al.  Group Updates for Red-Black Trees , 2000, CIAC.

[9]  Kim S. Larsen,et al.  Relaxed balance for search trees with local rebalancing , 1997, Acta Informatica.

[10]  Lauri Malmi,et al.  Group updates for relaxed height-balanced trees , 1999, PODS '99.

[11]  Derick Wood,et al.  Concurrency control in database structures with relaxed balance , 1987, PODS '87.

[12]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[13]  Kim S. Larsen,et al.  B-trees with relaxed balance , 1995, Proceedings of 9th International Parallel Processing Symposium.

[14]  Alfonso F. Cardenas.  Analysis and performance of inverted data base structures , 1975, CACM.

[15]  Kurt Mehlhorn,et al.  Sorting and Searching , 1984 .

[16]  Joan Boyar,et al.  Amortization Results for Chromatic Search Trees, with an Application to Priority Queues , 1997, J. Comput. Syst. Sci..

[17]  Kim S. Larsen,et al.  On the existence and construction of non-extreme (a, b)-trees , 2002, Inf. Process. Lett..

[18]  Joaquim Gabarró,et al.  Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract) , 1997, Euro-Par.

[19]  Kim S. Larsen.  AVL Trees with Relaxed Balance , 2000, J. Comput. Syst. Sci..

[20]  Kim S. Larsen,et al.  Relaxed Balance through Standard Rotations , 1997, WADS.

[21]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[22]  Derick Wood,et al.  Relaxed avl trees, main-memory databases and concurrency , 1996, Int. J. Comput. Math..

[23]  Eljas Soisalon-Soininen,et al.  Concurrency Control in B-Trees with Batch Updates , 1996, IEEE Trans. Knowl. Data Eng..

[24]  Joan Boyar,et al.  Efficient Rebalancing of Chromatic Search Trees , 1992, J. Comput. Syst. Sci..

[25]  Eljas Soisalon-Soininen,et al.  Relaxed Balanced Red-Black Trees , 1997, CIAC.

[26]  Kurt Mehlhorn,et al.  An Amortized Analysis of Insertions into AVL-Trees , 1986, SIAM J. Comput..

[27]  Kim S. Larsen.  Amortized constant relaxed rebalancing using standard rotations , 1997, Acta Informatica.

[28]  Kim S. Larsen,et al.  Variants of (A, B)-Trees with Relaxed Balance , 2001, Int. J. Found. Comput. Sci..