A Blink Tree latch method and protocol to support synchronous node deletion
Databases
2014-08-12 v2
Authors:
Karl Malbrain
Abstract
A Blink Tree latch method and protocol supports synchronous node deletion in a high concurrency environment. Full source code is available.
Cite
@article{arxiv.1009.2764,
title = {A Blink Tree latch method and protocol to support synchronous node deletion},
author = {Karl Malbrain},
journal= {arXiv preprint arXiv:1009.2764},
year = {2014}
}
Related papers
View all related →
Distributed, Parallel, and Cluster Computing · Computer Science
Blink: Fast and Generic Collectives for Distributed ML
Guanhua Wang, Shivaram Venkataraman, Amar Phanishayee, Jorgen Thelin +2
2019-10-14
Information Theory · Computer Science
Coded Splitting Tree Protocols
Jesper H. Sørensen, Cedomir Stefanović, Petar Popovski
2013-01-31
Networking and Internet Architecture · Computer Science
On Detecting Termination in Cognitive Radio Networks
Shantanu Sharma, Awadhesh Kumar Singh
2015-07-17
Cryptography and Security · Computer Science
Tree-Chain: A Fast Lightweight Consensus Algorithm for IoT Applications
Ali Dorri, Raja Jurdak
2020-05-20
Cryptography and Security · Computer Science
Enabling Deletion in Append-Only Blockchains (Short Summary / Work in Progress)
Michael Kuperberg
2020-05-14
Software Engineering · Computer Science
An Efficient Binary Technique for Trace Simplifications of Concurrent Programs
Mohamed A. El-Zawawy, Mohammad N. Alanazi
2014-05-20
Data Structures and Algorithms · Computer Science
Tree dynamics for peer-to-peer streaming
Ji Zhu, Bruce Hajek
2013-08-12
Distributed, Parallel, and Cluster Computing · Computer Science
Fast tree numeration in networks with synchronized time
Khuziev Ilnur
2018-04-03
Distributed, Parallel, and Cluster Computing · Computer Science
The Shutdown Problem: How Does a Blockchain System End?
Mark Stuart Day
2019-02-21
Machine Learning · Statistics
Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation
Ashlin Richardson, Donald Leckie
2022-12-02
Distributed, Parallel, and Cluster Computing · Computer Science
Techniques for Constructing Efficient Lock-free Data Structures
Trevor Brown
2017-12-18
Networking and Internet Architecture · Computer Science
LINC: An In-Network Coding Approach to Tame Packet Loss in Hybrid Wireless-Fiber Backbones
Benoit Pit-Claudel, Muriel Médard, Manya Ghobadi
2025-09-18
Computation and Language · Computer Science
Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
Sora Miyamoto, Daisuke Oba, Naoaki Okazaki
2026-02-11
Information Theory · Computer Science
Improved Interactive Protocol for Synchronizing From Deletions
Haolun, Ni, Lev Tauz, Ryan Gabrys +1
2025-12-09
Data Structures and Algorithms · Computer Science
A Scalable Concurrent Algorithm for Dynamic Connectivity
Alexander Fedorov, Nikita Koval, Dan Alistarh
2021-05-19
Networking and Internet Architecture · Computer Science
Multiple-Tree Push-based Overlay Streaming
Eduardo Lidanski, Supervisor- Giang Nguyen
2014-04-09
Databases · Computer Science
A Comparison of Blocking Methods for Record Linkage
Rebecca C. Steorts, Samuel L. Ventura, Mauricio Sadinle, Stephen E. Fienberg
2014-07-14
Social and Information Networks · Computer Science
A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
Fangchen You
2025-11-13
Emerging Technologies · Computer Science
A Tree-Based Repository Blockchain Framework for Shared Governance in Collaborative Fork Ecosystems
Razwan Ahmed Tanvir, Greg Speegle
2026-04-29
Distributed, Parallel, and Cluster Computing · Computer Science
SoK: Scalability Techniques for BFT Consensus
Christian Berger, Signe Schwarz-Rüsch, Arne Vogel, Kai Bleeke +3
2023-03-21
Distributed, Parallel, and Cluster Computing · Computer Science
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries
Panagiota Fatourou, Eric Ruppert
2018-05-15
Data Structures and Algorithms · Computer Science
Fast Parallel Operations on Search Trees
Yaroslav Akhremtsev, Peter Sanders
2016-05-12
Computational Geometry · Computer Science
BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing
K. S. Easwarakumar, T. Hema
2015-01-15
Databases · Computer Science
Low-Latency Sliding Window Connectivity
Chao Zhang, Angela Bonifati, Tamer Özsu
2025-01-07
Distributed, Parallel, and Cluster Computing · Computer Science
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
2014-09-05