Observations on optimistic concurrency control schemes
Information Systems - Special issue: Databases:8Mtheir creation, management and utilization
Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
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
Data access scheduling in firm real-time database systems
Real-Time Systems - Special issue: real-time databases
Managing memory for real-time queries
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ACM Computing Surveys (CSUR)
Advances in real-time database systems research
ACM SIGMOD Record
Real-time index concurrency control
ACM SIGMOD Record
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Value-based scheduling in real-time database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Scheduling Real-time Transactions: a Performance Evaluation
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Querying in Highly Mobile Distributed Environments
VLDB '92 Proceedings of the 18th 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
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A Comparative Study of Concurrency Control Methods in B-Trees
Proceedings of the VLSI Algorithms and Architectures, Aegean Worksho on Computing
Real-Time Database Systems in the New Millenium
Real-Time Systems
Real-Time Access Control and Reservation on B-Tree IndexedData
Real-Time Systems
Evaluation of concurrency control strategies for mixed soft real-time database systems
Information Systems - Databases: Creation, management and utilization
Parallel Real-Time OLAP on Multi-core Processors
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.00 |
Real-time database systems are expected to rely heavily on indexes to speed up data access and, thereby, help more transactions meet their deadlines. Accordingly, high-performance index concurrency control (ICC) protocols are required to prevent contention for the index from becoming a bottleneck. In this paper, we develop real-time variants of a representative set of classical B-tree ICC protocols and, using a detailed simulation model, compare their performance for real-time transactions with firm deadlines. We also present and evaluate a new real-time ICC protocol called GUARD-link that augments the classical B-link protocol with a feedback-based admission control mechanism. Both point and range queries, as well as the undos of the index actions of aborted transactions are included in the scope of our study. The performance metrics used in evaluating the ICC protocols are the percentage of transactions that miss their deadlines and the fairness with respect to transaction type and size. Our experimental results show that the performance characteristics of the real-time version of an ICC protocol could be significantly different from the performance of the same protocol in a conventional (nonreal-time) database system. In particular, B-link protocols, which are reputed to provide the best overall performance in conventional database systems, perform poorly under heavy real-time loads. The new GUARD-link protocol, however, although based on the B-link approach, delivers the best performance (with respect to all performance metrics) for a variety of real-time transaction workloads, by virtue of its admission control mechanism. In fact, GUARD-link provides close to ideal fairness in most environments. These and other results presented here represent the first work in the area of real-time index concurrency control.