Abstract / Excerpt:

ABSTRACT: As users demand higher disk capacities and larger single files, the need to address issues concerning speed is imperative. The fastest file systems today use B+ tree algorithms to arrange files on disk and this study aims to introduce B* tree structures into that type of file system. A comparison between two B+ tree-based file systems is made, one for standard B+ and one for B*. Random reads and writes were done and their speed measured. The measurements are in bytes per second. This interval data is then analyzed by using paired t-test.

Info

Source Institution	Ateneo de Davao University
Unit	Computer Studies
Authors	Badoy, Wildfredo B., Jr.
Page Count	1
Place of Publication	Davao City
Original Publication Date	March 2, 2009
Tags	Database design, Dissertations, Research, academic

Preview