A theoretical foundation of multi-level concurrency control
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Process synchronization in database systems
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Locking Protocols: From Exclusive to Shared Locks
Journal of the ACM (JACM)
Concurrency and linear hashing
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Semantically-based concurrancy control for search structures
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A semantic approach to correctness of concurrent transaction executions
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Concurrency Control Problem for Database Systems
Concurrency Control Problem for Database Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Guardians and actions: linguistic support for robust, distributed programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrency control mechanisms and the serializability of concurrent tree algorithms
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrency control in a dynamic search structure
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Synchronization and recovery of actions
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A concurrency control theory for nested transactions (Preliminary Report)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Data-dependent concurrency control and recovery (Extended Abstract)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Concurrent algorithms for search structures (parallel, database)
Concurrent algorithms for search structures (parallel, database)
ACM Transactions on Database Systems (TODS)
Concurrency control of nested transactions accessing B-trees
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Locking without blocking: making lock based concurrent data structure algorithms nonblocking
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Algorithms for Search Trees on Message-Passing Architectures
IEEE Transactions on Parallel and Distributed Systems
Highly concurrent cache consistency for indices in client-server database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Transaction synchronization in structures for point data
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
Real-time index concurrency control
ACM SIGMOD Record
A Taxonomy of Indexing Schemes for Parallel Database Systems
Distributed and Parallel Databases
Multi-level transaction management for complex objects: implementation, performance, parallelism
The VLDB Journal — The International Journal on Very Large Data Bases
A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap
IEEE Transactions on Computers
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Real-Time Index Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Restructuring the concurrent B+-tree with non-blocked search operations
Information Sciences—Informatics and Computer Science: An International Journal
A Theory of Transactions on Recoverable Search Trees
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Deleting Keys of B-trees in Parallel
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Logical and Physical Versioning in Main Memory Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Performance Evaluation of Multi-Level Transaction Management
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Index Concurrency Control in Firm Real-Time Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
View Serializable Updates of Concurrent Index Structures
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Global parallel index for multi-processors database systems
Information Sciences: an International Journal
Investigations in tree locking for compiled database applications
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
Online reorganization of databases
ACM Computing Surveys (CSUR)
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
Brief announcement: tree decomposition for faster concurrent data structures
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.01 |
A dictionary is an abstract data type supporting the actions member, insert, and delete. A search structure is a data structure used to implement a dictionary. Examples include B trees, hash structures, and unordered lists. Concurrent algorithms on search structures can achieve more parallelism than standard concurrency control methods would suggest, by exploiting the fact that many different search structure states represent one dictionary state. We present a framework for verifying such algorithms and for inventing new ones. We give several examples, one of which exploits the structure of Banyan family interconnection networks. We also discuss the interaction between concurrency control and recovery as applied to search structures.