Deletion without rebalancing in multiway search trees
From MaRDI portal
Publication:2943570
DOI10.1145/2540068zbMATH Open1321.68237OpenAlexW2055701211MaRDI QIDQ2943570FDOQ2943570
Authors: Siddhartha Sen, Robert E. Tarjan 
Publication date: 3 September 2015
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2540068
Recommendations
Cites Work
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Title not available (Why is that?)
- Binary Search Trees of Bounded Balance
- Organization and maintenance of large ordered indexes
- Rank-Balanced Trees
- A new data structure for representing sorted lists
- B-trees in a system with multiple users
- Amortized Computational Complexity
- Unsafe operations in B-trees
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
- Title not available (Why is that?)
- Deletion without rebalancing in multiway search trees
- Deletion without rebalancing in balanced binary trees
Cited In (11)
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
- Deletion without rebalancing in balanced binary trees
- Deletion without rebalancing in non-blocking binary search trees
- Deletion without rebalancing in binary search trees
- Insertions and deletions in B-trees
- Deletion: The curse of the red-black tree
- Deletion without rebalancing in multiway search trees
- Randomness Preserving Deletions on Special Binary Search Trees
- Optimal Key Tree Structure for Deleting Two or More Leaves
- Maintenance of the pre-large trees for record deletion
- Unbalanced multiway trees improved by partial expansions
Uses Software
This page was built for publication: Deletion without rebalancing in multiway search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943570)
