Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
The advent of non-volatile memory (NVM) will fundamentally change the dichotomy between memory and durable storage in database management systems (DBMSs). These new NVM devices are almost as fast as DRAM, but all writes to it are potentially persistent even after power loss. Existing DBMSs are unable to take full advantage of this technology because their internal architectures are predicated on the assumption that memory is volatile. With NVM, many of the components of legacy DBMSs are unnecessary and will degrade the performance of data intensive applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Strukov, D. B., Snider, G. S., Stewart, D. R., & Williams, R. S. (2008) · Nature · doi:10.1038/nature06932 · Cited by 11,828 · cited 4×
“NVM technologies, like phase-change memory [55] and memristors [60], remove these tuple transformation and propagation costs through byte-addressable loads and stores with low latency.”
BackgroundInfluentialSpace/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492 · cited 2×
“The Log engine also constructs a Bloom filter [12] for each SSTable to quickly determine at runtime whether it contains entries associated with a tuple to avoid unnecessary index look-ups.”
MethodBenchmarking cloud serving systems with YCSB
Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., & Sears, R. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807152 · Cited by 3,716 · cited 2×
“YCSB: This is a widely-used key-value store workload from Yahoo! [20].”
MethodThe log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317 · cited 3×
“The LSM tree reduces write amplification by batching the updates in MemTable and periodically cascading the changes to durable storage [50].”
BackgroundMethodThe design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
System R: relational approach to database management
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J. N., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., et al. (1976) · ACM Transactions on Database Systems · doi:10.1145/320455.320457 · Cited by 1,044 · cited 1×
“The former is exemplified by the first DBMSs, such as IBM’s System R [7], where the system is predicated on the management of blocks of tuples on disk using an in-memory cache; the latter by IBM’s IMS/VS Fast Path [32], where the system performs updates on in-memory data and relies on the disk to ensure durability.”
MethodMohan, C., Haderle, D., Lindsay, B., Pirahesh, H., & Schwarz, P. (1992) · ACM Transactions on Database Systems · doi:10.1145/128765.128770 · Cited by 1,043 · cited 3×
“With ARIES, the engine periodically takes checkpoints that are stored on the filesystem to bound recovery latency and reduce the storage space consumed by the log.”
BackgroundPhase-change random access memory: A scalable technology
Raoux, S., Burr, G. W., Breitwisch, M. J., Rettner, C. T., Chen, Y.-C., Shelby, R. M., Salinga, M., Krebs, D., Chen, S.-H., Lung, H.-L., et al. (2008) · IBM Journal of Research and Development · doi:10.1147/rd.524.0465 · Cited by 1,010 · cited 5×
“NVM technologies, like phase-change memory [55] and memristors [60], remove these tuple transformation and propagation costs through byte-addressable loads and stores with low latency.”
BackgroundInfluentialThe design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121137 · Cited by 970 · cited 1×
“This approach originated from log-structured filesystems [57], and then it was adapted to DBMSs as log-structured merge (LSM) trees [50] for write-intensive workloads.”
MethodImplementation techniques for main memory database systems
DeWitt, D. J., Katz, R. H., Olken, F., Shapiro, L. D., Stonebraker, M. R., & Wood, D. (1984) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/602259.602261 · Cited by 879 · cited 1×
“This means that they can be used for efficient architectures that are used in memory-oriented DBMSs [25].”
Method
Metadata
- Authors
- Arulraj, J., Pavlo, A., & Dulloor, S. R.
- Venue
- Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2015-05-27
- Pages
- 707-722
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W1988852271
- Cited by
- 199
- References
- 32
- FWCI
- 21.47
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems. https://app.cochat.ai/papers/10.1145/2723372.2749441
- The paper
- Arulraj, J., Pavlo, A., & Dulloor, S. R. (2015). Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. https://doi.org/10.1145/2723372.2749441
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.