SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Concepts and applications of multilevel transactions and open nested transactions
Database transaction models for advanced applications
Ensuring relaxed atomicity for flexible transactions in multidatabase systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Semantic ACID properties in multidatabases using remote procedure calls and update propagations
Software—Practice & Experience
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Overview of multidatabase transaction management
The VLDB Journal — The International Journal on Very Large Data Bases
Harvest, Yield, and Scalable Tolerant Systems
HOTOS '99 Proceedings of the The Seventh Workshop on Hot Topics in Operating Systems
Communications of the ACM - Rural engineering development
Design of Distributed Integrated Heterogeneous or Mobile Databases: System Integration by using relaxed ACID properties
Eventual consistency today: limitations, extensions, and beyond
Communications of the ACM
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
The CAP theorem combines the three desirable properties C (data consistency), A (data availability), and P (partition-tolerance: tolerance of inconsistencies between data stored in a distributed database where partitions are allowed). The CAP theorem asserts that any distributed system that uses data from different locations can have at most two of the three desirable CAP properties [5]. The NoSQL movement has applied the CAP theorem as an argument against traditional ACID (atomicity, consistency, isolation, and durability) databases, which prioritize consistency and partition-tolerance at the cost of a potentially low availability. Recently, Brewer [4] has modified the CAP theorem, pointing out that all the CAP properties are more or less continuous, and possible to optimize, weighing them against each other., in practice it is possible for an application area to have both relative high availability and sufficient data consistency, despite the presence of network partitions. The overall objective of this paper is to improve the CAP optimization methods by using optimization techniques outside of those preferred in CAP optimization literature. The main contribution is to use relaxed ACID properties in the CAP optimization process. This may be viewed as a bridge between the CAP theorem and the traditional ACID theory. Traditional ACID properties are weakened, but not completely dropped, in order to optimize CAP properties. From a user point of view, systems should thus function as if both the traditional ACID properties and all the CAP properties were implemented. This optimizing is especially important in mobile integrated databases, where disconnections are normal and frequent. It is also important in distributed databases like EHR (electronic Health Records) where many different hospital locations are involved, since the risk for disconnections increases with the number of participating locations. We use distributed integrated EHR databases as an example where our optimizing method may contribute.