FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory
Summary: FPTree is a hybrid SCM-DRAM persistent B+-Tree with leaves in SCM and inner nodes in DRAM (rebuilt on recovery). It uses fingerprinting to cap in-leaf probes and a partial HTM-based concurrency scheme, delivering up to 8.2x speedups and 88-core scalability, with memcached/DB integration. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ismail Oukid
- 2. Johan Lasperas
- 3. Anisoara Nica
- 4. Thomas Willhalm
- 5. Wolfgang Lehner
Incoming Citations (Sorted by Pagerank)
Showing 4 of 54 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,571 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1905499e-05 |
| 11,154 | Data Pipes: Declarative Control over Data Movement | 2023 | CIDR | 4.1905499e-05 |
| 11,231 | Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases | 2023 | VLDB | 4.1905499e-05 |
| 11,428 | Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing | 2021 | CIDR | 4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 104 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00049475932 |
| 687 | Rethinking Database Algorithms for Phase Change Memory | 2011 | CIDR | 0.00018097447 |
| 756 | FOEDUS: OLTP Engine for a Thousand Cores and NVRAM | 2015 | SIGMOD | 0.00017079523 |
| 781 | Scalable Logging through Emerging Non-Volatile Memory | 2014 | VLDB | 0.00016667457 |
| 809 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00016409797 |
| 940 | Let’s Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems | 2015 | SIGMOD | 0.00015149366 |
| 954 | Storage Management in the NVRAM Era | 2014 | VLDB | 0.0001509523 |
| 2,257 | Write-limited sorts and joins for persistent memory | 2014 | VLDB | 9.1808674e-05 |
| 2,634 | REWIND: Recovery Write-Ahead System for In-Memory Non-Volatile Data-Structures | 2015 | VLDB | 8.4091408e-05 |
| 3,035 | Instant Recovery for Main-Memory Databases | 2015 | CIDR | 7.6724794e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,456 | Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs | 2021 | VLDB | 5.0505636e-05 |
| 7,480 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 4.7135369e-05 |
| 2,508 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB | 8.6251065e-05 |
| 7,990 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6086117e-05 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 5,130 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems | 2017 | VLDB | 5.6721688e-05 |
| 6,466 | NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems | 2022 | VLDB | 5.04625e-05 |
| 2,986 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB | 7.7757727e-05 |
| 10,571 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1905499e-05 |
| 809 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00016409797 |