The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The structure of the relational database model
The structure of the relational database model
Hybrid concurrency control for abstract data types
Journal of Computer and System Sciences
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Locking Expressions for Increased Database Concurrency
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Transaction Management in Databases Supporting Collaborative Applications
ADBIS '98 Proceedings of the Second East European Symposium on Advances in Databases and Information Systems
Cooperative Transactions: A Data-Driven Approach
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
An Order-Based Theory of Updates for Closed Database Views
Annals of Mathematics and Artificial Intelligence
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Fundamentals of Database Systems (5th Edition)
Fundamentals of Database Systems (5th Edition)
Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
Semantics in Data and Knowledge Bases
A Model of Database Components and their Interconnection Based upon Communicating Views
Proceedings of the 2008 conference on Information Modelling and Knowledge Bases XIX
Update support for database views via cooperation
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
A Simple Model of Negotiation for Cooperative Updates on Database Schema Components
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
A Simple Model of Negotiation for Cooperative Updates on Database Schema Components
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Characterization of optimal complements of database views defined by projection
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Independent update reflections on interdependent database views
Conceptual Modelling and Its Theoretical Foundations
Hi-index | 0.00 |
Traditional models of support for concurrent transactions invariably rely upon a notion of serializability, which involves not only complex scheduling, but also primitives (such as locks) for requiring transactions to wait, as well for aborting a transaction and forcing it to re-run. For batch transactions, this approach is often the most reasonable. On the other hand, for interactive transactions, only a very limited amount of waiting and aborting is tolerable, and so minimizing their occurrence, even at the cost of increased analysis of the transactions themselves, is warranted. In this work, a systematic study of independence for transactions, without any explicit serialization, is initiated. Each transaction operates on a view of the main schema, and each such view is partitioned into a write region and a read-only region. For a set of transactions to run concurrently, their views may overlap only on their read-only regions. These regions need not be specified explicitly; rather, they are defined naturally using a component-based model of the main schema. Furthermore, when two transactions do conflict, because their views overlap on write regions, the precise point of conflict is immediately identified. To illustrate the utility of the framework, the case of relational schemata governed by the most common types of constraints in practice -- functional and foreign-key dependencies -- is developed in detail.