Главная
Study mode:
on
1
Intro
2
Background: Static Hashing
3
Insertion Latency CDF
4
Disk-based Extendible Hashing
5
Extendible Hashing - Insertion
6
Extendible Hashing - Bucket Split
7
Extendible Hashing - Directory doubling
8
Persistent Memory
9
Challenge in In-Memory Extendible Hashing
10
Segment: Intemediate Level
11
Recovery: Split History Buddy Tree in CCEH
12
Segment Split: Legacy CoW
13
Segment Split: Lazy Deletion
14
Experimental Setup
15
CCEH VS Legacy Extendible Hash
16
Conclusion
17
Question?
18
Insertion Performance Breakdown
19
Load Factor
Description:
Explore a 24-minute conference talk from FAST '19 that delves into Cacheline-Conscious Extendible Hashing (CCEH), a novel approach for optimizing hash-based indexing structures on persistent memory (PM). Learn how CCEH addresses the challenges of achieving efficiency and failure-atomicity in dynamic hash expansion and shrinkage for low latency storage media. Discover the benefits of CCEH, including reduced overhead in dynamic memory block management, constant hash table lookup time, and guaranteed failure-atomicity without explicit logging. Examine experimental results demonstrating CCEH's ability to adapt its size under fine-grained failure-atomicity constraints and its significant reduction in maximum query latency compared to state-of-the-art hashing techniques. Gain insights into topics such as static hashing, disk-based extendible hashing, persistent memory challenges, recovery mechanisms, and performance comparisons through a comprehensive syllabus covering various aspects of this innovative hashing approach. Read more

Write-Optimized Dynamic Hashing for Persistent Memory

USENIX
Add to list