- AutorIn
- Ismail Oukid Technische Universität Dresden, Fakultät Informatik, Institut für Systemarchitektur, Professur für Datenbanken
- Johan Lasperas
- Anisoara Nica
- Thomas Willhalm
- Prof. Dr.-Ing. Wolfgang Lehner
- Titel
- FPTree
- Untertitel
- A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-804432
- Konferenz
- SIGMOD/PODS'16: International Conference on Management of Data. New York, 26. Juni - 1. Juli 2016
- Quellenangabe
- SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data
Herausgeber: Fatma Özcan, Georgia Koutrika, Sam Madden
Erscheinungsort: New York
Verlag: ACM
Erscheinungsjahr: 2016
Seiten: 371-386
ISBN: 978-1-4503-3531-7 - Erstveröffentlichung
- 2016
- Abstract (EN)
- The advent of Storage Class Memory (SCM) is driving a rethink of storage systems towards a single-level architecture where memory and storage are merged. In this context, several works have investigated how to design persistent trees in SCM as a fundamental building block for these novel systems. However, these trees are significantly slower than DRAM-based counterparts since trees are latency-sensitive and SCM exhibits higher latencies than DRAM. In this paper we propose a novel hybrid SCM-DRAM persistent and concurrent B-Tree, named Fingerprinting Persistent Tree (FPTree) that achieves similar performance to DRAM-based counterparts. In this novel design, leaf nodes are persisted in SCM while inner nodes are placed in DRAM and rebuilt upon recovery. The FPTree uses Fingerprinting, a technique that limits the expected number of in-leaf probed keys to one. In addition, we propose a hybrid concurrency scheme for the FPTree that is partially based on Hardware Transactional Memory. We conduct a thorough performance evaluation and show that the FPTree outperforms state-of-the-art persistent trees with different SCM latencies by up to a factor of 8.2. Moreover, we show that the FPTree scales very well on a machine with 88 logical cores. Finally, we integrate the evaluated trees in memcached and a prototype database. We show that the FPTree incurs an almost negligible performance overhead over using fully transient data structures, while significantly outperforming other persistent trees.
- Andere Ausgabe
- Link zum Artikel, der zuerst in der ACM Digital Library erschienen ist.
DOI: 10.1145/2882903.2915251 - Freie Schlagwörter (DE)
- Speicherklassen-Speicher (SCM), Fingerprinting Persistent Tree (FPTree), persistenter Baum, SCM-Latenz
- Freie Schlagwörter (EN)
- Storage Class Memory (SCM), Fingerprinting Persistent Tree (FPTree), persistent tree, SCM latencie
- Klassifikation (DDC)
- 004
- Verlag
- ACM, New York
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-804432
- Veröffentlichungsdatum Qucosa
- 17.08.2022
- Dokumenttyp
- Konferenzbeitrag
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis