pith. sign in

arxiv: 2605.20466 · v1 · pith:YF7LMKKXnew · submitted 2026-05-19 · 💻 cs.DB · cs.DC

Fifty Years of Transaction Processing Research (extended)

Philip A. Bernstein (Microsoft Research) This is my paper

Pith reviewed 2026-05-21 06:09 UTC · model grok-4.3

classification 💻 cs.DB cs.DC
keywords transaction processingdatabase historydistributed systemsdata managementACID propertiescloud computing
0
0 comments X

The pith

Transaction research continues today because new challenges keep arising in distributed and modern systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reviews the history of transaction processing from its early days through recent decades. It shows that while core mechanisms for reliable data operations were established long ago, fresh requirements in large-scale distributed environments keep the field active. A reader would care because transactions remain the foundation for trustworthy data management even as computing platforms change.

Core claim

The author recounts early history of transaction research including personal contributions, explains that research continues even though foundational problems appear solved, and speculates on future directions driven by evolving system needs.

What carries the argument

The adaptation of transaction guarantees to new scales and failure modes in distributed computing environments.

If this is right

  • Transaction mechanisms will need extensions for cloud-scale consistency and availability.
  • New research will address integration with modern data pipelines and hardware.
  • Foundational principles will be reused rather than replaced in future systems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same pattern of apparently solved problems spurring new work may appear in related areas such as query processing.
  • Developers could test whether current protocols already suffice for emerging hardware like persistent memory.

Load-bearing premise

Core transaction problems seem solved, yet ongoing research is still justified by changing system requirements.

What would settle it

A complete demonstration that unmodified 1970s transaction techniques fully handle all current distributed-system challenges without further adaptation would undermine the case for continued research.

read the original abstract

In this short paper, I recount some early history of transaction research (including some of my own), explain why transaction research continues to this day (even though it seems to be a solved problem), and speculate about its future. This is an extended version of the paper that appeared in the Companion of the 2025 International Conference on Management of Data (SIGMOD-Companion '25).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper is a personal retrospective on fifty years of transaction processing research, recounting early developments (including the author's contributions), arguing that core problems appear solved yet research persists due to new challenges in distributed and modern computing environments, and offering speculations on future directions. It is an extended version of a SIGMOD 2025 companion paper and takes the form of a narrative history and opinion essay rather than a technical contribution with theorems or experiments.

Significance. If the historical account holds, the paper provides useful archival perspective on the field's evolution and the reasons ongoing work remains relevant, crediting the author's firsthand involvement for authenticity in describing early milestones. As a narrative piece it does not introduce new technical results, proofs, or reproducible artifacts, but its interpretive framing of why transaction research continues can help contextualize current distributed-systems challenges for readers.

minor comments (2)
  1. The abstract mentions recounting 'some early history' and 'some of my own' contributions but does not name specific milestones or papers; adding one or two concrete examples (e.g., a cited early system or result) would improve grounding without lengthening the piece.
  2. The forward-looking speculation section would benefit from a short paragraph distinguishing between incremental extensions of existing techniques and genuinely new research questions arising from cloud-scale or hardware changes.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment and the recommendation to accept. The referee's summary correctly identifies the paper as a personal retrospective and extended version of the SIGMOD Companion piece, with no new technical results but offering historical context and speculation on ongoing relevance.

Circularity Check

0 steps flagged

No significant circularity in retrospective narrative

full rationale

The paper is an extended personal retrospective and speculative essay on the history of transaction processing research. It contains no equations, derivations, fitted parameters, predictions, or mathematical claims that could reduce to inputs by construction. The central narrative—that ongoing research is warranted by new challenges in distributed systems—is presented as interpretive history and forward-looking opinion rather than a falsifiable result or theorem. Self-references to the author's prior work serve only as historical context and are not load-bearing for any derivation. No self-citation chains, uniqueness theorems, or ansatzes are invoked to justify core claims. The paper is self-contained as narrative and does not rely on circular reductions.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a reflective historical essay with no technical derivations, free parameters, or new postulates; the central narrative rests on the author's personal experience and standard knowledge of database history.

pith-pipeline@v0.9.0 · 5572 in / 917 out tokens · 24134 ms · 2026-05-21T06:09:28.844741+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

114 extracted references · 114 canonical work pages

  1. [1]

    SIGMOD Conference 2019: 1743-1756 Philip A

    Panagiotis Antonopoulos , Alex Budovski, Cristian Diaconu, Alejandro Hernandez Saenz, Jack Hu, Hanuma Kodavalla, Donald Kossmann, Sandeep Lingam, Umar Farooq Minhas, Naveen Prakash, Vijendra Purohit, Hugh Qu, Chaitanya Sreenivas Ravella, Krystyna Reisteter, Sheetal Shrotri, Dixin Tang, Vikram Wakade: Socrates: The New SQL Server in the Cloud. SIGMOD Confe...

    work page 2019

  2. [2]

    Bernstein, Nathan Goodman: Site Initialization, Recovery, and Backup in a Distributed Database System

    Rony Attar, Philip A. Bernstein, Nathan Goodman: Site Initialization, Recovery, and Backup in a Distributed Database System. IEEE Trans. Software Eng. 10(6): 645-650 (1984)

    work page 1984

  3. [3]

    Fekete, Ali Ghodsi, Joseph M

    Peter Bailis, Aaron Davidson, Alan D. Fekete, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica: Highly Available Transactions: Virtues and Limitations. Proc. VLDB Endow. 7(3): 181-192 (2013)

    work page 2013

  4. [4]

    Peter Bailis, Ali Ghodsi: Eventual consistency today: limitations, extensions, and beyond. Commun. ACM 56(5): 55-63 (2013)

    work page 2013

  5. [5]

    Bernstein, Jim Gray, Jim Melton, Elizabeth J

    Hal Berenson, Philip A. Bernstein, Jim Gray, Jim Melton, Elizabeth J. O'Neil, Patrick E. O'Neil: A Critique of ANSI SQL Isolation Levels. SIGMOD Conference 1995: 1-10

    work page 1995

  6. [6]

    Bernstein

    Philip A. Bernstein. 2023. Eight Transaction papers by Jim Gray, https://arxiv.org/abs/2310.04601

    work page arXiv 2023

  7. [7]

    Bernstein, Fifty Years of Transaction Processing Research , SIGMOD Conference 2025: 1-2

    Philip A. Bernstein, Fifty Years of Transaction Processing Research , SIGMOD Conference 2025: 1-2

    work page 2025

  8. [8]

    Bernstein: Transaction Processing Monitors

    Philip A. Bernstein: Transaction Processing Monitors. Commun. ACM 33(11): 75-86 (1990)

    work page 1990

  9. [9]

    Bernstein: Middleware: A Model for Distributed System Services

    Philip A. Bernstein: Middleware: A Model for Distributed System Services. Commun. ACM 39(2): 86-98 (1996)

    work page 1996

  10. [10]

    Bernstein, Dah-Ming W

    Philip A. Bernstein, Dah-Ming W. Chiu: Using Semi-Joins to Solve Relational Queries. J. ACM 28(1): 25-40 (1981)

    work page 1981

  11. [11]

    Bernstein, Istvan Cseri, Nishant Dani, Nigel Ellis, Ajay Kalhan, Gopal Kakivaya, David B

    Philip A. Bernstein, Istvan Cseri, Nishant Dani, Nigel Ellis, Ajay Kalhan, Gopal Kakivaya, David B. Lomet, Ramesh Manne, Lev Novik, Tomas Talius: Adapting Microsoft SQL Server for Cloud Computing. ICDE 2011: 1255 - 1263

    work page 2011

  12. [12]

    Bernstein, Sudipto Das: Rethinking eventual consistency

    Philip A. Bernstein, Sudipto Das: Rethinking eventual consistency. SIGMOD Conference 2013: 923-928

    work page 2013

  13. [13]

    Bernstein, Nathan Goodman: Timestamp -Based Algorithms for Concurrency Control in Dist’d Database Systems

    Philip A. Bernstein, Nathan Goodman: Timestamp -Based Algorithms for Concurrency Control in Dist’d Database Systems. VLDB 1980: 285-300

    work page 1980

  14. [14]

    Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems

    Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185 -221 (1981)

    work page 1981

  15. [15]

    Bernstein, Nathan Goodman: Multiversion Concurrency Control - Theory and Algorithms

    Philip A. Bernstein, Nathan Goodman: Multiversion Concurrency Control - Theory and Algorithms. ACM Trans. Database Syst. 8(4): 465 -483 (1983)

    work page 1983

  16. [16]

    Bernstein, Nathan Goodman: An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases

    Philip A. Bernstein, Nathan Goodman: An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases. ACM Trans. Database Syst. 9(4): 596-615 (1984)

    work page 1984

  17. [17]

    Bernstein, Nathan Goodman, Eugene Wong, Christopher L

    Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie Jr.: Query Processing in a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 6(4): 602-625 (1981)

    work page 1981

  18. [18]

    Bernstein, Per O

    Philip A. Bernstein, Per O. Gyllstrom, Tom Wimberg: STDL - A Portable Language for Transaction Processing. VLDB 1993: 218 -229

    work page 1993

  19. [19]

    Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Con- trol and Recovery in Distributed Database Systems, Addison-Wesley, 1987

    Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Con- trol and Recovery in Distributed Database Systems, Addison-Wesley, 1987

    work page 1987

  20. [20]

    Bernstein, Meichun Hsu, Bruce Mann: Implementing Recoverable Requests Using Queues

    Philip A. Bernstein, Meichun Hsu, Bruce Mann: Implementing Recoverable Requests Using Queues. SIGMOD Conference 1990: 112 -122

    work page 1990

  21. [21]

    Bernstein, Eric Newcomer: Principles of Transaction Processing for Systems Professionals

    Philip A. Bernstein, Eric Newcomer: Principles of Transaction Processing for Systems Professionals. Morgan Kaufmann (2nd edition), 2009, ISBN 978- 1558606234

    work page 2009

  22. [22]

    Bernstein, Colin W

    Philip A. Bernstein, Colin W. Reid, Sudipto Das: Hyder - A Transactional Record Manager for Shared Flash. CIDR 2011: 9-20

    work page 2011

  23. [23]

    Bernstein, David W

    Philip A. Bernstein, David W. Shipman, James B. Rothnie Jr.: Concurrency Control in a System for Distributed Databases (SDD -1). ACM Trans. Database Syst. 5(1): 18-51 (1980)

    work page 1980

  24. [24]

    Bernstein, David W

    Philip A. Bernstein, David W. Shipman, Wing Shing Wong: Formal Aspects of Serializability in Database Concurrency Control. IEEE Trans. Software Eng. 5(3): 203-216 (1979)

    work page 1979

  25. [25]

    Bober, Michael J

    Paul M. Bober, Michael J. Carey: On Mixing Queries and Transactions via Multiversion Locking. ICDE 1992: 535-545

    work page 1992

  26. [26]

    https://research.google/pubs/spanner-truetime-and-the-cap-theorem

    Eric Brewer: Spanner, TrueTime and the CAP Theorem . https://research.google/pubs/spanner-truetime-and-the-cap-theorem. 2017

    work page 2017

  27. [27]

    Matthew Burke, Sowmya Dharanipragada, Shannon Joyner, Adriana Szekeres, Jacob Nelson, Irene Zhang, Dan R. K. Ports: PRISM: Rethinking the RDMA Interface for Distributed Systems. SOSP 2021: 228 -242

    work page 2021

  28. [28]

    ESOP 2012: 67-86

    Sebastian Burckhardt, Daan Leijen, Manuel Fähndrich, Mooly Sagiv: Eventually Consistent Transactions. ESOP 2012: 67-86

    work page 2012

  29. [29]

    Hsieh, Deborah A

    Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Michael Burrows, Tushar Chandra, Andrew Fikes, Robert Gruber: Bigtable: A Distributed Storage System for Structured Data. OSDI 2006: 205-218

    work page 2006

  30. [30]

    Brian F. Cooper, Raghu Ramakrishnan, Utkarsh Srivastava, Adam Silberstein, Philip Bohannon, Hans -Arno Jacobsen, Nick Puz, Daniel Weaver, Ramana Yerneni: PNUTS: Yahoo!'s hosted data serving platform. Proc. VLDB Endow. 1(2): 1277-1288 (2008)

    work page 2008

  31. [31]

    Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J

    James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymani...

    work page 2013

  32. [32]

    C. J. Date: Locking and Recovery in a Shared Database System: An Application Programming Tutorial. VLDB 1979: 1 -15

    work page 1979

  33. [33]

    SOSP 2007: 205-220

    Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels: Dynamo: Amazon's Highly Available Key-value Store. SOSP 2007: 205-220

    work page 2007

  34. [34]

    Wing: Inheritance of Synchronization and Recovery Properties in Avalon/C++

    David Detlefs, Maurice Herlihy, Jeannette M. Wing: Inheritance of Synchronization and Recovery Properties in Avalon/C++. Computer 21(12): 57-69 (1988)

    work page 1988

  35. [35]

    DeWitt, Randy H

    David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood: Implementation Techniques for Main Memory Database Systems. SIGMOD Conference 1984: 1 -8

    work page 1984

  36. [36]

    SIGMOD Conference 2013: 1243- 1254

    Cristian Diaconu, Craig Freedman, Erik Ismert, Per -Åke Larson, Pravin Mittal, Ryan Stonecipher, Nitin Verma, Mike Zwilling: Hekaton: SQL server's memory-optimized OLTP engine. SIGMOD Conference 2013: 1243- 1254

    work page 2013

  37. [37]

    NSDI 2014: 401 -414

    Aleksandar Dragojevic, Dushyanth Narayanan, Miguel Castro, Orion Hodson: FaRM: Fast Remote Memory. NSDI 2014: 401 -414

    work page 2014

  38. [38]

    Bernstein, Asaf Cidon, Junfeng Yang: Chablis: Fast and General Transactions in Geo -Distributed Systems

    Tamer Eldeeb, Philip A. Bernstein, Asaf Cidon, Junfeng Yang: Chablis: Fast and General Transactions in Geo -Distributed Systems. CIDR 2024 , https://www.cidrdb.org/cidr2024/

    work page 2024

  39. [39]

    Bernstein: Cloud Actor -Oriented Database Transactions in Orleans

    Tamer Eldeeb, Sebastian Burckhardt, Reuben Bond, Asaf Cidon, Junfeng Yang, Philip A. Bernstein: Cloud Actor -Oriented Database Transactions in Orleans. Proc. VLDB Endow. 17(12): 3720-3730 (2024)

    work page 2024

  40. [40]

    Bernstein, Asaf Cidon, Junfeng Yang: Chardonnay: Fast and General Datacenter Transactions for On -Disk Databases

    Tamer Eldeeb, Xincheng Xie, Philip A. Bernstein, Asaf Cidon, Junfeng Yang: Chardonnay: Fast and General Datacenter Transactions for On -Disk Databases. OSDI 2023: 343-360

    work page 2023

  41. [41]

    Eswaran, Jim Gray, Raymond A

    Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633 (1976)

    work page 1976

  42. [42]

    Fidge.: Timestamps in message -passing systems that preserve the partial ordering

    Colin J. Fidge.: Timestamps in message -passing systems that preserve the partial ordering. In K. Raymond (ed.). Proceedings of the 11th Australian Computer Science Conference (ACSC'88). Vol. 10. pp. 56–66

    work page

  43. [43]

    Fischer, Alan Michael: Sacrificing Serializability to Attain High Availability of Data

    Michael J. Fischer, Alan Michael: Sacrificing Serializability to Attain High Availability of Data. PODS 1982: 70-75

    work page 1982

  44. [44]

    Brewer: Harvest, Yield and Scalable Tolerant Systems

    Armando Fox, Eric A. Brewer: Harvest, Yield and Scalable Tolerant Systems. Workshop on Hot Topics in Operating Systems 1999: 174 -178

    work page 1999

  45. [45]

    SIGMOD Conference 1987: 249-259

    Hector Garcia -Molina, Kenneth Salem: Sagas. SIGMOD Conference 1987: 249-259

    work page 1987

  46. [46]

    IEEE Database Eng

    Dieter Gawlick, David Kinkade: Varieties of Concurrency Control in IMS/VS Fast Path. IEEE Database Eng. Bull. 8(2): 3 -10 (1985)

    work page 1985

  47. [47]

    Lynch: Brewer's conjecture and the feasibility of consistent, available, partition -tolerant web services

    Seth Gilbert, Nancy A. Lynch: Brewer's conjecture and the feasibility of consistent, available, partition -tolerant web services. SIGACT News 33(2): 51-59 (2002)

    work page 2002

  48. [48]

    Advanced Course: Operating Systems 1978

    Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978. Springer, LNCS 60: 393-481

    work page 1978

  49. [49]

    ACM Trans

    Jim Gray, Leslie Lamport: Consensus on transaction commit. ACM Trans. Database Syst. 31(1): 133-160 (2006)

    work page 2006

  50. [50]

    Lorie, Gianfranco R

    Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger: Granularity of Locks in a Large Shared Data Base. VLDB 1975: 428 -451

    work page 1975

  51. [51]

    Morgan Kaufmann 1993, ISBN 1-55860-190-2

    Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2

    work page 1993

  52. [52]

    Bernstein: Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation

    Zhihan Guo, Xinyu Zeng, Kan Wu, Wuh-Chwen Hwang, Ziwei Ren, Xiangyao Yu, Mahesh Balakrishnan, Philip A. Bernstein: Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation. Proc. VLDB Endow. 16(2): 379 - 392 (2022)

    work page 2022

  53. [53]

    CIDR 2013

    Pat Helland, Don Haderle: Engagements: Building Eventually ACiD Business Transactions. CIDR 2013

    work page 2013

  54. [54]

    Pat Helland: Scalable OLTP in the Cloud: What's the BIG DEAL? CIDR 2024

    work page 2024

  55. [55]

    Hellerstein, Peter Alvaro: Keeping CALM: when distributed consistency is easy

    Joseph M. Hellerstein, Peter Alvaro: Keeping CALM: when distributed consistency is easy. Commun. ACM 63(9): 72-81 (2020)

    work page 2020

  56. [56]

    Avalon: Language support for reliable distributed systems

    Herlihy, M., and Wing, J. Avalon: Language support for reliable distributed systems. 17th International Symposium on Fault -Tolerant Computing. IEEE, New York, 1987

    work page 1987

  57. [57]

    Wing: Linearizability: A Correctness Condition for Concurrent Objects

    Maurice Herlihy, Jeannette M. Wing: Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. Program. Lang. Syst. 12(3): 463-492 (1990)

    work page 1990

  58. [58]

    Kluwer 1997, ISBN 0-7923-9880-7

    Sushil Jajodia, Larry Kerschberg (editors): Advanced Transaction Models and Architectures. Kluwer 1997, ISBN 0-7923-9880-7

    work page 1997

  59. [59]

    Zdonik, Evan P

    Robert Kallman, Hideaki Kimura, Jonathan Natkins, Andrew Pavlo, Alex Rasin, Stanley B. Zdonik, Evan P. C. Jones, Samuel Madden, Michael Philip A. Bernstein Fifty Years of Transaction Processing Research (extended) 5 Stonebraker, Yang Zhang, John Hugg, Daniel J. Abadi: H -store: a high - performance, distributed main memory transaction processing system. P...

    work page 2008

  60. [60]

    of the 2nd ACM Conference on Computer-Supported Cooperative Work, 1988

    Leonard Kawell Jr., Steven Beckhardt, Timothy Halvorsen, Raymond Ozzie, Irene Greif: Replicated Document Management in a Group Communication System, Proc. of the 2nd ACM Conference on Computer-Supported Cooperative Work, 1988

    work page 1988

  61. [61]

    Franklin, Samuel Madden, Alan D

    Tim Kraska, Gene Pang, Michael J. Franklin, Samuel Madden, Alan D. Fekete: MDCC: multi-data center consistency. EuroSys 2013: 113 -126

    work page 2013

  62. [62]

    Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, Marcelo Leone: Logical Physical Clocks

    Sandeep S. Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, Marcelo Leone: Logical Physical Clocks. OPODIS 2014: 17 -32

    work page 2014

  63. [63]

    H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226 (1981)

    work page 1981

  64. [64]

    ACM Trans

    Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat: Providing High Availability Using Lazy Replication. ACM Trans. Comput. Syst. 10(4): 360-391 (1992)

    work page 1992

  65. [65]

    Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565 (1978)

    work page 1978

  66. [66]

    ACM Trans

    Leslie Lamport: The Part-Time Parliament. ACM Trans. Comput. Syst. 16(2): 133-169 (1998)

    work page 1998

  67. [67]

    Lampson: Atomic Transactions

    Butler W. Lampson: Atomic Transactions. Advanced Course: Distributed Systems 1980, Springer LNCS 105: 246-265, 1980

    work page 1980

  68. [68]

    Lampson, Howard E

    Butler W. Lampson, Howard E. Sturgis: Crash recovery in Distributed Data Storage Systems. Tech. Report, Xerox Palo Alto Research Center, 1975

    work page 1975

  69. [69]

    Lampson, David B

    Butler W. Lampson, David B. Lomet: A New Presumed Commit Optimization for Two Phase Commit. VLDB 1993: 630 -640

    work page 1993

  70. [70]

    Levandoski, David B

    Justin J. Levandoski, David B. Lomet, Mohamed F. Mokbel, Kevin Zhao: Deuteronomy: Transaction Support for Cloud Data. CIDR 2011: 123 -133

    work page 2011

  71. [71]

    Levandoski, David B

    Justin J. Levandoski, David B. Lomet, Sudipta Sengupta, Ryan Stutsman, Rui Wang: High Performance Transactions in Deuteronomy. CIDR 2015

    work page 2015

  72. [72]

    Levandoski, David B

    Justin J. Levandoski, David B. Lomet, Sudipta Sengupta, Ryan Stutsman, Rui Wang: Multi -Version Range Concurrency Control in Deuteronomy. Proc. VLDB Endow. 8(13): 2146-2157 (2015)

    work page 2015

  73. [73]

    Guoliang Li, Wengang Tian, Jinyu Zhang, Ronen Grosman, Zongchao Liu, Sihao Li: GaussDB: A Cloud -Native Multi-Primary Database with Compute - Memory-Storage Disaggregation. Proc. VLDB Endow. 17(12): 3786 -3798 (2024)

    work page 2024

  74. [74]

    Barbara Liskov: Distributed Programming in Argus. Commun. ACM 31(3): 300-312 (1988)

    work page 1988

  75. [75]

    Freedman, Michael Kaminsky, David G

    Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, David G. Andersen: Stronger Semantics for Low -Latency Geo -Replicated Storage. NSDI 2013: 313-328

    work page 2013

  76. [76]

    Lomet: Recovery for Shared Disk Systems Using Multiple Redo Logs

    David B. Lomet: Recovery for Shared Disk Systems Using Multiple Redo Logs. Digital Equipment Corp Technical Report CRL 90/4

    work page

  77. [77]

    Lomet: Cost/performance in modern data stores: how data caching systems succeed

    David B. Lomet: Cost/performance in modern data stores: how data caching systems succeed. DaMoN 2018: 9:1-9:10

    work page 2018

  78. [78]

    Lomet: Deuteronomy 2.0: Record Caching and Latch Freedom

    David B. Lomet: Deuteronomy 2.0: Record Caching and Latch Freedom. CoRR abs/2504.14435 (2025)

    work page arXiv 2025

  79. [79]

    Mohan, Don Haderle, Bruce G

    C. Mohan, Don Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz: ARIES: A Transaction Recovery Method Supporting Fine - Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst. 17(1): 94-162 (1992)

    work page 1992

  80. [80]

    Mohan, Bruce G

    C. Mohan, Bruce G. Lindsay, Ron Obermarck: Transaction Management in the R* Distributed Database Management System. ACM Trans. Database Syst. 11(4): 378-396 (1986)

    work page 1986

Showing first 80 references.