Relaxed multi-way trees with group updates.

DOI10.1016/S0022-0000(03)00027-8MaRDI QIDQ1401964zbMATH OpenOpenAlexFDO

Authors 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

Amortized analysisB-treesComplexityGroup insertionGroup updateMulti-way treesRelaxed balanceSearch trees

Mathematics Subject Classification ID

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

Recommendations

• Relaxed red-black trees with group updates
• Updating relaxed K-d trees
• scientific article; zbMATH DE number 1629860
• Fast updating of well-balanced trees
• Optimal Tree Structures for Group Key Management with Batch Updates
• scientific article; zbMATH DE number 1008516
• A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES
• Improved bounds for relaxed graceful trees
• Self-adjusting multi-way search trees
• Multi-way space partitioning trees.

Cites work

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

Cited in

(7)

• Unbalanced multiway trees improved by partial expansions
• Relaxed red-black trees with group updates
• Exponentially decreasing number of operations in balanced trees
• scientific article; zbMATH DE number 1629860 (Why is no real title available?)
• B-slack trees: space efficient B-trees
• scientific article; zbMATH DE number 1218261 (Why is no real title available?)
• Variants of (a,b)-trees with relaxed balance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401964)