Towards a General Concurrency Control Algorithm for Database Systems
IEEE Transactions on Software Engineering
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Some Deadlock Properties of Computer Systems
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
Simple rational guidance for chopping up transactions
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Quantifying the benefits of semantics
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Tolerating bounded inconsistency for increasing concurrency in database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On correctness of non-serializable executions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Reducing recovery constraints on locking based protocols
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relative serializability (extended abstract): an approach for relaxing the atomicity of transactions
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model
ACM Transactions on Database Systems (TODS)
A lock method for KBMSs using abstraction relationships' semantics
CIKM '94 Proceedings of the third international conference on Information and knowledge management
On computing serial dependency relations
Journal of Computer and System Sciences
Transaction chopping: algorithms and performance studies
ACM Transactions on Database Systems (TODS)
CSCW '96 Proceedings of the 1996 ACM conference on Computer supported cooperative work
A concurrency control framework for collaborative systems
CSCW '96 Proceedings of the 1996 ACM conference on Computer supported cooperative work
Applying formal methods to semantic-based decomposition of transactions
ACM Transactions on Database Systems (TODS)
Bounded Inconsistency for Type-Specific Concurrency Control
Distributed and Parallel Databases
Specification and Management of Interdependent Data in OperationalSystems and Data Warehouses
Distributed and Parallel Databases
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Ensuring consistency in multidatabases by preserving two-level serializability
ACM Transactions on Database Systems (TODS)
Using metalevel techniques in a flexible toolkit for CSCW applications
ACM Transactions on Computer-Human Interaction (TOCHI)
Formalization of Workflows and Correctness Issues in the Presence of Concurrency
Distributed and Parallel Databases - Special issue on electronic commerce
Distributed and Parallel Databases
Integrated version and transaction group model for shared engineering databases
Data & Knowledge Engineering
Overview of multidatabase transaction management
The VLDB Journal — The International Journal on Very Large Data Bases
Chronological scheduling of transactions with temporal dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Object-Based Semantic Real-Time Concurrency Control with Bounded Imprecision
IEEE Transactions on Knowledge and Data Engineering
Transaction Processing in Mobile, Heterogeneous Database Systems
IEEE Transactions on Knowledge and Data Engineering
A Formal Approach to Recovery by Compensating Transactions
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Overview of multidatabase transaction management
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Real-time update of access control policies
Data & Knowledge Engineering
Applying Semantic Knowledge to Real-Time Update of Access Control Policies
IEEE Transactions on Knowledge and Data Engineering
Performance analysis of long-lived cooperative transactions in active DBMS
Data & Knowledge Engineering
KALA: Kernel aspect language for advanced transactions
Science of Computer Programming
Generating CAM aspect-oriented architectures using Model-Driven Development
Information and Software Technology
Semantic Transaction Processing in Mobile Computing
Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Overview of multidatabase transaction management
CASCON First Decade High Impact Papers
Ensuring atomicity of multilevel transactions
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Compensation in the world of web services composition
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Transactional Workflows in Distributed Systems
Fundamenta Informaticae
Logic and lattices for distributed programming
Proceedings of the Third ACM Symposium on Cloud Computing
Proceedings of the 4th annual Symposium on Cloud Computing
Hi-index | 0.00 |
When the only information available about transactions is syntactic information, serializability is the main correctness criterion for concurrency control. Serializability requires that the execution of each transaction must appear to every other transaction as a single atomic step (i.e., the execution of the transaction cannot be interrupted by other transactions). Many researchers, however, have realized that this requirement is unnecessarily strong for many applications and can significantly increase transaction response time. To overcome this problem, a new approach for controlling concurrency that exploits the semantic information available about transactions to allow controlled nonserializable interleavings has recently been proposed. This approach is useful when the cost of producing only serializable interleavings is unacceptably high. The main drawback of the approach is the extra overhead incurred by utilizing the semantic information. We examine this new approach in this paper and discuss its strengths and weaknesses. We introduce a new formalization for the concurrency control problem when semantic information is available about the transactions. This semantic information takes the form of transaction types, transaction steps, and transaction break-points. We define a new class of “safe” schedules called relatively consistent (RC) schedules. This class contains serializable as well as nonserializable schedules. We prove that the execution of an RC schedule cannot violate consistency and propose a new concurrency control mechanism that produces only RC schedules. Our mechanism assumes fewer restrictions on the interleavings among transactions than previously introduced semantic-based mechanisms.