Concurrency control in database structures with relaxed balance

Authors:
O. Nurmi;E. Soisalon-Soininen;D. Wood
Affiliations:
Institut fur Angewandte Informatik, und Formale Beschreibungsverfahren, Universitat Karlsruhe, Postfach 6380, D-7500 Karlsruhe 1, West Germany;Institut fur Angewandte Informatik, und Formale Beschreibungsverfahren, Universitat Karlsruhe, Postfach 6380, D-7500 Karlsruhe 1, West Germany;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1987

Citing 9
Cited 17

Concurrent operations on B*-trees with overtaking

Journal of Computer and System Sciences
Query processing in main memory database management systems

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Concurrency control in a dynamic search structure

ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees

ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees

ACM Transactions on Database Systems (TODS)
Semantically-based concurrancy control for search structures

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
On-the-fly optimization of data structures

Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM

Uncoupling updating and rebalancing in chromatic binary search trees

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Regular Article: Efficient rebalancing of chromatic search trees

Proceedings of the 30th IEEE symposium on Foundations of computer science
Group updates for relaxed height-balanced trees

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Real-Time Access Control and Reservation on B-Tree IndexedData

Real-Time Systems
Relaxed multi-way trees with group updates

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Concurrency Control in B-Trees with Batch Updates

IEEE Transactions on Knowledge and Data Engineering
A new method for updating and rebalancing tree-type main memory dictionaries

Nordic Journal of Computing
Complexity of Layered Binary Search Trees with Relaxed Balance

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Exponentially Decreasing Number of Operations in Balanced Trees

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
View Serializable Updates of Concurrent Index Structures

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Relaxed multi-way trees with group updates

Journal of Computer and System Sciences - Special issu on PODS 2001
Single and bulk updates in stratified trees: an amortized and worst-case analysis

Computer Science in Perspective
Concurrency control and recovery for balanced B-link trees

The VLDB Journal — The International Journal on Very Large Data Bases
Online reorganization of databases

ACM Computing Surveys (CSUR)
A practical concurrent binary search tree

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
A speculation-friendly binary search tree

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Concurrent operations of O2-tree on shared memory multicore architectures

ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the separation of rebalancing from updates in several database structures, such as B-trees for external and AVL-trees for internal structures. We show how this separation can be implemented such that rebalancing is performed by local background processes. Our solution implies that even simple locking schemes (without additional links and copies of certain nodes) for concurrency control are efficient in the sense that at any time only a small constant number of nodes must be locked.