Are Database System Researchers Making Correct Assumptions About Transaction Workloads?
Summary: Empirical study of 111 OSS apps (30k+ transactions) tests two common workload assumptions behind high-performance OLTP designs. Finds the second assumption is stronger: 90% have ≥58% read/write sets inferable; 39% are non-interactive, and 61% could be so with minimal changes, reshaping OLTP expressivity and performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Cuong D. T. Nguyen (University of Maryland)
- 2. Kevin Niechen (University of Maryland)
- 3. Chris DeCarolis (University of Maryland)
- 4. Daniel J. Abadi (University of Maryland)
BibTeX Citation
@inproceedings{nguyen_sigmod25,
title = {{Are Database System Researchers Making Correct Assumptions About Transaction Workloads?}},
author = {Nguyen, Cuong D. T. and Niechen, Kevin and DeCarolis, Chris and Abadi, Daniel J.},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725268},
url = {https://dl.acm.org/doi/10.1145/3725268},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,448 | Modeling Concurrency Control as a Learnable Function | 2026 | SIGMOD | 5.162056e-05 |
| 10,625 | Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol | 2026 | SIGMOD | 4.9605343e-05 |
| 10,917 | Remora: Scale-out Deterministic Execution for Smart Contracts | 2026 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 33 of 33 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 797 | Low Overhead Concurrency Control for Partitioned Main Memory Databases | 2010 | SIGMOD |
| 2 | 14,881 | A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets | 1982 | VLDB |
| 3 | 3,097 | Lazy Evaluation of Transactions in Database Systems | 2014 | SIGMOD |
| 4 | 3,981 | On Being Optimistic about Real-Time Constraints | 1990 | PODS |
| 5 | 9,820 | Sharing Opportunities for OLTP Workloads in Different Isolation Levels | 2020 | VLDB |
| 6 | 1,940 | Performance and Resource Modeling in Highly-Concurrent OLTP Workloads | 2013 | SIGMOD |
| 7 | 270 | Models for Studying Concurrency Control Performance: Alternatives and Implications | 1985 | SIGMOD |
| 8 | 1,840 | On Predictive Modeling for Optimizing Transaction Execution in Parallel OLTP Systems | 2012 | VLDB |
| 9 | 6,884 | An Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems | 2002 | VLDB |
| 10 | 12,840 | Optimizing I/O-Intensive Transactions in Highly Interactive Applications | 2009 | SIGMOD |