AN EFFICIENT B+-TREE IMPLEMENTATION IN C++ USING THE STL STYLE

Jingxue Zhou, Bin Nie, Greg Butler

2004

Abstract

Database indexes are the search engines for database management systems. The B+-tree is one of the most widely used data structures and provides an efficient index. An efficient implementation is crucial for a B+- tree index. Our B+-tree index is designed to be a container in the style of the C++ Standard Template Library (STL) and implemented efficiently using design patterns and generic programming techniques.

Paper Citation

in Harvard Style

Zhou J., Nie B. and Butler G. (2004). AN EFFICIENT B+-TREE IMPLEMENTATION IN C++ USING THE STL STYLE . In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-00-7, pages 163-168. DOI: 10.5220/0002613901630168

in Bibtex Style

@conference{iceis04,
author={Jingxue Zhou and Bin Nie and Greg Butler},
title={AN EFFICIENT B+-TREE IMPLEMENTATION IN C++ USING THE STL STYLE},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2004},
pages={163-168},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002613901630168},
isbn={972-8865-00-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - AN EFFICIENT B+-TREE IMPLEMENTATION IN C++ USING THE STL STYLE
SN - 972-8865-00-7
AU - Zhou J.
AU - Nie B.
AU - Butler G.
PY - 2004
SP - 163
EP - 168
DO - 10.5220/0002613901630168