Abstract
A simple people database will be developed and implemented employing an array and B-tree objects. A B-tree is a useful and de facto standard data structure for external searching, and sorting, and database programming. The efficiency and usefulness of the B-tree lie in its important features — balanced, ordered multiple keys in a single node, grouping of keys, and its controlled growth. In this chapter, the simple object-oriented people_ld database is used to convey the basic ideas such that it can be adapted to any modification to suit an application. This application forms a B-tree object from an array of keys, and demonstrates the message-passing technique between a people_ld database object pdb_obj and a B-tree object btree_obj.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Sengupta, S., Korobkin, C.P. (1994). An Object-Oriented Database with B-Trees. In: C++. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2636-9_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2636-9_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7618-0
Online ISBN: 978-1-4612-2636-9
eBook Packages: Springer Book Archive