| dc.contributor.author | Webster, Robert Edward | |
| dc.date.accessioned | 2015-11-24T15:40:39Z | |
| dc.date.available | 2015-11-24T15:40:39Z | |
| dc.date.issued | 1980-05 | |
| dc.identifier.uri | https://hdl.handle.net/11244/22391 | |
| dc.description.abstract | Scope and Method of Study: This paper describes a data structure called the B+-tree, developed by D. Comer and D. Knuth. The B+-tree is a modification of the B-tree. The storage characteristics of the structure are discussed, and empirical data is given from actual test cases generated from an implementation of the B+-tree designed for test purposes. Buffering of the B+-tree nodes is discussed, along with empirical results from two buffering methods. The design of an application of B+-trees in a relational database is presented. | |
| dc.description.abstract | Findings and Conclusions: The upper and lower bounds for storage utilization in a B+-tree were obtained analytically. An estimation of the average storage utilization was found empirically. Information was provided empirically and analytically on the effectiveness of the buffering of index nodes. Program listings and test results are included. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | B+-trees | |
| osu.filename | Thesis-1980R-W383b.pdf | |
| osu.accesstype | Open Access | |
| dc.type.genre | Master's Report | |
| dc.type.material | Text | |
| thesis.degree.discipline | Computing and Information Sciences | |
| thesis.degree.grantor | Oklahoma State University | |
