Relaxed multi-way trees with group updates.

DOI10.1016/S0022-0000(03)00027-8zbMath1054.68045OpenAlexW2654913633MaRDI QIDQ1401964

Kim S. Larsen

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00027-8

zbMATH Keywords

ComplexitySearch treesAmortized analysisB-treesGroup insertionGroup updateMulti-way treesRelaxed balance

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (1)

Exponentially decreasing number of operations in balanced trees

Cites Work

• Unnamed Item
• Unnamed Item
• Batch insertion for tree structured file organizations - improving differential database representation
• Amortized constant relaxed rebalancing using standard rotations
• A new data structure for representing sorted lists
• Efficient rebalancing of chromatic search trees
• Amortization results for chromatic search trees, with an application to priority queues
• On the existence and construction of non-extreme \((a,b)\)-trees.
• Chromatic binary search trees: A structure for concurrent rebalancing
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Relaxed avl trees, main-memory databases and concurrency
• An Amortized Analysis of Insertions into AVL-Trees
• Amortized Computational Complexity
• Analysis and performance of inverted data base structures
• EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
• VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
• AVL trees with relaxed balance
• relaxed balance for search trees with local rebalancing
• Relaxed balance using standard rotations

This page was built for publication: Relaxed multi-way trees with group updates.