.png){kind=icon}
.png){kind=icon}
Return
PMLiteDB: Streamlining Access Paths for High-Performance Persistent Memory Document Database Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2022.3224372.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The advent of byte-addressable persistent memory opens an important opportunity for document databases to read and write durable data fetching them into DRAM. Reaping the benefit of persistent memory is not straightforward, as existing document databases are tailored for disk storage. They assume that the disk and DRAM data movement dominates the performance. However, this paper points out that data indexing becomes the performance bottleneck when porting document databases to persistent memory. The paper proposes PMLiteDB, the first persistent memory document database with streamlined access paths. PMLiteDB introduces two techniques, direct reading and selective caching. Direct reading streamlines the translation from document IDs to the address of documents whenever possible by swizzling the IDs into persistent memory references. It guarantees to use only up-to-date persistent memory references when document movements invalidate associated references. Selective caching reduces data movements between DRAM and persistent memory by selectively caching only frequently accessed persistent memory data pages with a DRAM buffer. For other pages, the database loads data on them directly without caching. Compared to the design that adopts persistent memory as a fast disk without exploiting the byte-addressability, PMLiteDB achieves 2.33x on average and up to 6.18x speedup.
Keywords:
Databases
Indexing
Random access memory
Data structures
Benchmark testing
Programming
Optimization
Persistent memory
document database
database reference
access path
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available