Wear-Aware Algorithms for PCM-Based Database Buffer Pools

Ou, Yun; Chen, Lei; Xu, Jianliang; Härder, Theo

doi:10.1007/978-3-319-11538-2_16

Cited by 5 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, a partitioned hash index is kept in PMem for efficient single key-value operations while an additional volatile B + -Tree enables faster scans. What is further proposed are multi-tier general-purpose buffer pools, which are supposed to exploit the respective properties of the diverse memory and storage technologies [2,19,26,30,31].…”

Section: Multi-level Data Structuresmentioning

confidence: 99%

Designing an Event Store for a Modern Three-layer Storage Hierarchy

et al. 2020

View full text Add to dashboard Cite

Event stores face the difficult challenge of continuously ingesting massive temporal data streams while satisfying demanding query and recovery requirements. Many of today’s systems deal with multiple hardware-based trade-offs. For instance, long-term storage solutions balance keeping data in cheap secondary media (SSDs, HDDs) and performance-oriented main-memory caches. As an alternative, in-memory systems focus on performance, while sacrificing monetary costs, and, to some degree, recovery guarantees. The advent of persistent memory (PMem) led to a multitude of novel research proposals aiming to alleviate those trade-offs in various fields. So far, however, there is no proposal for a PMem-powered specialized event store. Based on ChronicleDB, we will present several complementary approaches for a three-layer architecture featuring main memory, PMem, and secondary storage. We enhance some of ChronicleDB’s components with PMem for better insertion and query performance as well as better recovery guarantees. At the same time, the three-layer architecture aims to keep the overall dollar cost of a system low. The limitations and opportunities of a PMem-enhanced event store serve as important groundwork for comprehensive system design exploiting a modern storage hierarchy.

show abstract

Section: Multi-level Data Structuresmentioning

confidence: 99%

Designing an Event Store for a Modern Three-layer Storage Hierarchy

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Yi Ou et al [55] proposed several wear-aware page replacement algorithms including LPW, LFM and LRM for PCM-based database buffer pools. The algorithms are designed for PCM wear leveling.…”

Section: Pure Pcm Main Memory Managementmentioning

confidence: 99%

A Survey on Phase Change Memory-Aware Cache Management

Chen

Jin

Yue

2016

IJMUE

View full text Add to dashboard Cite

“…Nowadays, the research of PCM is concentrated on many aspects. To prolong the memory lifetime, we need a mechanism that distributes write operations to PCM cells uniformly (see [9], [10] and [11]). Consequently, many data management techniques must be changed in order to reduce the write traffic (see [12], [13] and [14]).…”

Section: Introductionmentioning

confidence: 99%

Adaptive Merging on Phase Change Memory

Macyna¹,

Kukowski²

2022

Preprint

View full text Add to dashboard Cite

Indexing is a well-known database technique used to facilitate data access and speed up query processing. Nevertheless, the construction and modification of indexes are very expensive. In traditional approaches, all records in the database table are equally covered by the index. It is not effective, since some records may be queried very often and some never. To avoid this problem, adaptive merging has been introduced. The key idea is to create index adaptively and incrementally as a side-product of query processing. As a result, the database table is indexed partially depending on the query workload.This paper faces a problem of adaptive merging for phase change memory (PCM). The most important features of this memory type are: limited write endurance and high write latency. As a consequence, adaptive merging should be investigated from the scratch. We solve this problem in two steps. First, we apply several PCM optimization techniques to the traditional adaptive merging approach. We prove that the proposed method (eAM) outperforms a traditional approach by 60%. After that, we invent the framework for adaptive merging (PAM) and a new PCMoptimized index. It further improves the system performance by 20% for databases where search queries interleave with data modifications.

show abstract

Wear-Aware Algorithms for PCM-Based Database Buffer Pools

Cited by 5 publications

References 13 publications

Designing an Event Store for a Modern Three-layer Storage Hierarchy

Designing an Event Store for a Modern Three-layer Storage Hierarchy

A Survey on Phase Change Memory-Aware Cache Management

Adaptive Merging on Phase Change Memory

Contact Info

Product

Resources

About