fptree · research · also Fingerprinting Persistent Tree

FPTree

FPTree is a hybrid B+ tree that persists leaves in storage-class memory and reconstructs DRAM-resident inner nodes during recovery.

Selective persistence leaves routing state volatile. Recovery first repairs interrupted leaf splits and deletions from micro-logs, then rebuilds inner nodes from the leaf chain. Fingerprints select candidate keys; full comparisons resolve collisions. [1]

Relations

related
B+ tree, Persistent memory, Persistence domain

Limitations

  • The paper's latency experiments use DRAM-based SCM emulation; they do not establish performance on current persistent-memory hardware. [1]

Citations

  1. Oukid et al. FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. SIGMOD 2016. DOI: 10.1145/2882903.2915251. (accessed 2026-11-10)

Further reading

  1. Hesela: persistent memory, recovery state and FPTree. (accessed 2026-11-10)
Sources & caveats
  • Source review of the accepted manuscript, sections 4.1-4.2, 5 (Algorithm 9) and 6.1. Publication year is not a commercial-availability claim.

JSON: /data/terms/fptree.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. FPTree. Hesela. 2026-11-10. https://hesela.dev/terms/fptree/