Optimizing B+-tree for PCM-based hybrid memory

Lu Li; Peiquan Jin; Chengcheng Yang; Zhanglin Wu; Lihua Yue

doi:10.5441/002/edbt.2016.75

Optimizing B+-tree for PCM-based hybrid memory

Lu Li
, Peiquan Jin
, Chengcheng Yang
, Zhanglin Wu
, Lihua Yue

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Phase change memory (PCM) as a newly developed storage medium has many attractive properties such as non-volatility, byte addressability, high density and low energy consumption. Thus, PCM can be used to build non-volatile main memory databases. However, PCM's long write latency and high write energy bring challenges to PCM-based memory systems. In this paper, we propose an improvement over the B+-tree for PCM. Particularly, we consider the read/write tendency of leaf nodes. For write-intensive leaf nodes, we use an overflow-node technique to reduce PCM writes, while for read-intensive ones, we adjust the tree structure to remove overflow nodes to improve read performance. Our experimental results suggest that our proposal outperforms the traditional B+-tree and the overflow B+-tree.

Original language	English
Title of host publication	Advances in Database Technology - EDBT 2016
Subtitle of host publication	19th International Conference on Extending Database Technology, Proceedings
Editors	Ioana Manolescu, Evaggelia Pitoura, Amelie Marian, Sofian Maabout, Letizia Tanca, Georgia Koutrika, Kostas Stefanidis
Publisher	OpenProceedings.org
Pages	662-663
Number of pages	2
ISBN (Electronic)	9783893180707
DOIs	https://doi.org/10.5441/002/edbt.2016.75
State	Published - 2016
Externally published	Yes
Event	19th International Conference on Extending Database Technology, EDBT 2016 - Bordeaux, France Duration: 15 Mar 2016 → 18 Mar 2016

Publication series

Name	Advances in Database Technology - EDBT
Volume	2016-March
ISSN (Electronic)	2367-2005

Conference

Conference	19th International Conference on Extending Database Technology, EDBT 2016
Country/Territory	France
City	Bordeaux
Period	15/03/16 → 18/03/16

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

B+-tree
Index
PCM

Access to Document

10.5441/002/edbt.2016.75

Cite this

Li, L., Jin, P., Yang, C., Wu, Z., & Yue, L. (2016). Optimizing B+-tree for PCM-based hybrid memory. In I. Manolescu, E. Pitoura, A. Marian, S. Maabout, L. Tanca, G. Koutrika, & K. Stefanidis (Eds.), Advances in Database Technology - EDBT 2016: 19th International Conference on Extending Database Technology, Proceedings (pp. 662-663). (Advances in Database Technology - EDBT; Vol. 2016-March). OpenProceedings.org. https://doi.org/10.5441/002/edbt.2016.75

Li, Lu ; Jin, Peiquan ; Yang, Chengcheng et al. / Optimizing B+-tree for PCM-based hybrid memory. Advances in Database Technology - EDBT 2016: 19th International Conference on Extending Database Technology, Proceedings. editor / Ioana Manolescu ; Evaggelia Pitoura ; Amelie Marian ; Sofian Maabout ; Letizia Tanca ; Georgia Koutrika ; Kostas Stefanidis. OpenProceedings.org, 2016. pp. 662-663 (Advances in Database Technology - EDBT).

@inproceedings{9a1d90ef8161462d8928afe2537ee011,

title = "Optimizing B+-tree for PCM-based hybrid memory",

abstract = "Phase change memory (PCM) as a newly developed storage medium has many attractive properties such as non-volatility, byte addressability, high density and low energy consumption. Thus, PCM can be used to build non-volatile main memory databases. However, PCM's long write latency and high write energy bring challenges to PCM-based memory systems. In this paper, we propose an improvement over the B+-tree for PCM. Particularly, we consider the read/write tendency of leaf nodes. For write-intensive leaf nodes, we use an overflow-node technique to reduce PCM writes, while for read-intensive ones, we adjust the tree structure to remove overflow nodes to improve read performance. Our experimental results suggest that our proposal outperforms the traditional B+-tree and the overflow B+-tree.",

keywords = "B+-tree, Index, PCM",

author = "Lu Li and Peiquan Jin and Chengcheng Yang and Zhanglin Wu and Lihua Yue",

note = "Publisher Copyright: {\textcopyright} 2016, Copyright is with the authors.; 19th International Conference on Extending Database Technology, EDBT 2016 ; Conference date: 15-03-2016 Through 18-03-2016",

year = "2016",

doi = "10.5441/002/edbt.2016.75",

language = "英语",

series = "Advances in Database Technology - EDBT",

publisher = "OpenProceedings.org",

pages = "662--663",

editor = "Ioana Manolescu and Evaggelia Pitoura and Amelie Marian and Sofian Maabout and Letizia Tanca and Georgia Koutrika and Kostas Stefanidis",

booktitle = "Advances in Database Technology - EDBT 2016",

address = "德国",

}

Li, L, Jin, P, Yang, C, Wu, Z & Yue, L 2016, Optimizing B+-tree for PCM-based hybrid memory. in I Manolescu, E Pitoura, A Marian, S Maabout, L Tanca, G Koutrika & K Stefanidis (eds), Advances in Database Technology - EDBT 2016: 19th International Conference on Extending Database Technology, Proceedings. Advances in Database Technology - EDBT, vol. 2016-March, OpenProceedings.org, pp. 662-663, 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, 15/03/16. https://doi.org/10.5441/002/edbt.2016.75

Optimizing B+-tree for PCM-based hybrid memory. / Li, Lu; Jin, Peiquan; Yang, Chengcheng et al.
Advances in Database Technology - EDBT 2016: 19th International Conference on Extending Database Technology, Proceedings. ed. / Ioana Manolescu; Evaggelia Pitoura; Amelie Marian; Sofian Maabout; Letizia Tanca; Georgia Koutrika; Kostas Stefanidis. OpenProceedings.org, 2016. p. 662-663 (Advances in Database Technology - EDBT; Vol. 2016-March).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimizing B+-tree for PCM-based hybrid memory

AU - Li, Lu

AU - Jin, Peiquan

AU - Yang, Chengcheng

AU - Wu, Zhanglin

AU - Yue, Lihua

PY - 2016

Y1 - 2016

N2 - Phase change memory (PCM) as a newly developed storage medium has many attractive properties such as non-volatility, byte addressability, high density and low energy consumption. Thus, PCM can be used to build non-volatile main memory databases. However, PCM's long write latency and high write energy bring challenges to PCM-based memory systems. In this paper, we propose an improvement over the B+-tree for PCM. Particularly, we consider the read/write tendency of leaf nodes. For write-intensive leaf nodes, we use an overflow-node technique to reduce PCM writes, while for read-intensive ones, we adjust the tree structure to remove overflow nodes to improve read performance. Our experimental results suggest that our proposal outperforms the traditional B+-tree and the overflow B+-tree.

AB - Phase change memory (PCM) as a newly developed storage medium has many attractive properties such as non-volatility, byte addressability, high density and low energy consumption. Thus, PCM can be used to build non-volatile main memory databases. However, PCM's long write latency and high write energy bring challenges to PCM-based memory systems. In this paper, we propose an improvement over the B+-tree for PCM. Particularly, we consider the read/write tendency of leaf nodes. For write-intensive leaf nodes, we use an overflow-node technique to reduce PCM writes, while for read-intensive ones, we adjust the tree structure to remove overflow nodes to improve read performance. Our experimental results suggest that our proposal outperforms the traditional B+-tree and the overflow B+-tree.

KW - B+-tree

KW - Index

KW - PCM

UR - https://www.scopus.com/pages/publications/84990043878

U2 - 10.5441/002/edbt.2016.75

DO - 10.5441/002/edbt.2016.75

M3 - 会议稿件

AN - SCOPUS:84990043878

T3 - Advances in Database Technology - EDBT

SP - 662

EP - 663

BT - Advances in Database Technology - EDBT 2016

A2 - Manolescu, Ioana

A2 - Pitoura, Evaggelia

A2 - Marian, Amelie

A2 - Maabout, Sofian

A2 - Tanca, Letizia

A2 - Koutrika, Georgia

A2 - Stefanidis, Kostas

PB - OpenProceedings.org

T2 - 19th International Conference on Extending Database Technology, EDBT 2016

Y2 - 15 March 2016 through 18 March 2016

ER -

Li L, Jin P, Yang C, Wu Z, Yue L. Optimizing B+-tree for PCM-based hybrid memory. In Manolescu I, Pitoura E, Marian A, Maabout S, Tanca L, Koutrika G, Stefanidis K, editors, Advances in Database Technology - EDBT 2016: 19th International Conference on Extending Database Technology, Proceedings. OpenProceedings.org. 2016. p. 662-663. (Advances in Database Technology - EDBT). doi: 10.5441/002/edbt.2016.75

Optimizing B+-tree for PCM-based hybrid memory

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this