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 (SAP; Technical University of Dresden)
- 2. Johan Lasperas (SAP)
- 3. Anisoara Nica (SAP)
- 4. Thomas Willhalm (Intel)
- 5. Wolfgang Lehner (Technical University of Dresden)
BibTeX Citation
@inproceedings{oukid_sigmod16,
title = {{FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory}},
author = {Oukid, Ismail and Lasperas, Johan and Nica, Anisoara and Willhalm, Thomas and Lehner, Wolfgang},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915251},
url = {https://dl.acm.org/doi/10.1145/2882903.2915251},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 56 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,440 | DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory | 2026 | SIGMOD | 5.093636e-05 |
| 10,545 | SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory | 2026 | VLDB | 5.093636e-05 |
| 10,568 | Operation-Aware Hybrid Locking for Modern In-Memory Indexes | 2026 | VLDB | 5.093636e-05 |
| 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 5.093636e-05 |
| 11,357 | Data Pipes: Declarative Control over Data Movement | 2023 | CIDR | 5.093636e-05 |
| 11,623 | Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing | 2021 | CIDR | 5.093636e-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 |
|---|---|---|---|---|
| 67 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00038461275 |
| 537 | FOEDUS: OLTP Engine for a Thousand Cores and NVRAM | 2015 | SIGMOD | 0.00016931517 |
| 603 | Scalable Logging through Emerging Non-Volatile Memory | 2014 | VLDB | 0.00015853456 |
| 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00015695264 |
| 658 | Rethinking Database Algorithms for Phase Change Memory | 2011 | CIDR | 0.0001523554 |
| 840 | Storage Management in the NVRAM Era | 2014 | VLDB | 0.00013683877 |
| 841 | Let’s Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems | 2015 | SIGMOD | 0.00013677356 |
| 1,996 | Write-limited sorts and joins for persistent memory | 2014 | VLDB | 9.3396464e-05 |
| 2,371 | REWIND: Recovery Write-Ahead System for In-Memory Non-Volatile Data-Structures | 2015 | VLDB | 8.6793374e-05 |
| 2,951 | Instant Recovery for Main-Memory Databases | 2015 | CIDR | 7.9260674e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,139 | Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs | 2021 | VLDB |
| 2 | 7,906 | Buffered Persistence in B+ Trees | 2024 | SIGMOD |
| 3 | 1,823 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB |
| 4 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 5 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 6 | 4,647 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems | 2017 | VLDB |
| 7 | 5,993 | NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems | 2022 | VLDB |
| 8 | 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB |
| 9 | 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 10 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |