Single-Site and Distributed Optimistic Protocols for Concurrency Control
IEEE Transactions on Software Engineering
High level specification of concurrency control in distributed database systems
ICSE '88 Proceedings of the 10th international conference on Software engineering
An Optimistic Locking Technique for Concurrency Control in Distributed Databases
IEEE Transactions on Software Engineering
On the analytical modeling of database concurrency control
Journal of the ACM (JACM)
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Concurrency control for distributed multiversion databases through time intervals
CSC '91 Proceedings of the 19th annual conference on Computer Science
Advances in real-time database systems research
ACM SIGMOD Record
IEEE Transactions on Computers
Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Mixed concurrency control: Dealing with heterogeneity in distributed database systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Value-cognizant Speculative Concurrency Control
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Hybrid Concurrency Control for Mobile Computing
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Impact of mobility on concurrent transactions mixture
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
| Hi-index | 0.01 |
This paper introduces, as an optimistic concurrency control method, a new certification method by means of intervals of timestamps, usable in a distributed database system. The main advantage of this method is that it allows a chronological commit order which differs from the serialization one (thus avoiding rejections or delays of transactions which occur in usual certification methods or in classical locking or timestamping ones). The use of the dependency graph permits both classifying this method among existing ones and proving it. The certification protocol is first presented under the hypothesis that transactions' certifications are processed in the same order on all the concerned sites; it is then extended to allow concurrent certifications of transactions.