Pat Helland
- Bernstein, P.A., Hadzilacos, V. and Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Boston, MA, 1987.Google Scholar
Digital Library
- Corbett, J.C. et al. Spanner: Google's globally distributed database. In Proceedings of the 10th Usenix Symposium on Operating Systems Design and Implementation, 2012.Google Scholar
- Dean, J. and Ghemawat, S. MapReduce: Simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation, 2004.Google ScholarDigital Library
- Gray, J. A census of Tandem Systems availability between 1985 and 1990. IEEE Transactions on Reliability 39, 4 (1990), 409--418. Google ScholarCross Ref
- Lamport, L. The part-time parliament. ACM Trans. Computer Systems 16, 2 (1998), 133--169. Google ScholarDigital Library
- Ongaro, D. and Ousterhout, J. In search of an understandable consensus algorithm (extended version), 2014; https://raft.github.io/raft.pdf.Google Scholar
- Wachter, H. and Reuter, A. The ConTract Model. Database Transaction Models for Advanced Applications. 0 219--263. Morgan Kaufmann, San Francisco, CA, 1992, 219--263.Google Scholar
Index Terms
- Life beyond distributed transactions
Recommendations
Extracting more concurrency from distributed transactions
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationDistributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon ...
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Comments