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

Jingxue Zhou, Bin Nie, Greg Butler

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.

References

  1. Alexandrescu, A. (2001). Modern C++ Design: Generic Programming and Design Patterns Applied. Addison Wesley Professional, London, 2nd edition.
  2. Bayer, R. and McCreight, E. (1972). Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173-189.
  3. Butler, G., Chen, L., Chen, X., Gaffar, A., Li, J., and Xu, L. (2002). The Know-It-All project: A case study in framework development and evolution. In Domain Oriented Systems Development: Perspectives and Practices, pages 101-117. Taylor and Francis Publishers.
  4. Comer, D. (1979). The ubiquitous B-tree. Computing Surveys, 11(2):121-137.
  5. Folk, M. J. and Zoellick, B. (1992). File Structures. Addison Wesley.
  6. Gaede, V. and G√ľnther, O. (1998). Multidimensional access methods. ACM Computing Surveys, 30(2):170-231.
  7. Gamma, E., Helm, R., Johnson, R., and Vlissides, J. (1994). Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley.
  8. Garcia-Molina, H., Ullman, J. D., and Widom, J. (2000). Database System Implementation. Prentice-Hall.
  9. Hellerstein, J. M., Naughton, J. F., and Pfeffer, A. (1995). Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Data Bases, pages 562-573.
  10. Huang, J. and Stankovic, J. A. (1990). Buffer management in real-time databases. COINS Technical Report 90- 65, University of Massachusetts.
  11. Meyers, S. (1992). Effective C++. Addison-Wesley.
  12. Nie, B. (2003). A tree index framework for databases. Master's thesis, Concordia University.
  13. Olson, M. A., Bostic, K., and Seltze, M. (1999). Berkeley DB. Software.
  14. Stepanov, A. and Lee, M. (1995). The Standard Template Library. Hewlett-Packard.
  15. Zhou, J. (2003). A B+-tree index for the Know-It-All database framework. Master's thesis, Concordia University.
Download


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