Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The Database State Machine Approach
Distributed and Parallel Databases
Partial Database Replication using Epidemic Communication
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Transactions on Partially Replicated Data based on Reliable and Atomic Multicasts
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Survey of Deadlock Detection in Distributed Concurrent Programming Environments and Its Application to Real-Time Systems
Comparison of Database Replication Techniques Based on Total Order Broadcast
IEEE Transactions on Knowledge and Data Engineering
Ivy: a read/write peer-to-peer file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Decentralized coordination of transactional processes in peer-to-peer environments
Proceedings of the 14th ACM international conference on Information and knowledge management
Preventive Replication in a Database Cluster
Distributed and Parallel Databases
Sprint: a middleware for high-performance transaction processing
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Pastis: a highly-scalable multi-user peer-to-peer file system
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely and/or compute a total order of transactions. In contrast, ours applies update values, and generate a partial order between mutually conflicting transactions only. Transactions execute faster, and distributed databases commit in small committees. Both effects contribute to preserve scalability as the number of databases and transactions increase. Our algorithm ensures serializability, and is live and safe in spite of faults.