Skip to main content
Article thumbnail
Location of Repository

Storage Overhead of O-trees, B-trees, and Prefix B-trees: A Comparative Analysis

By Ratko Orlandic and Hosam M. Mahmoud

Abstract

The O-tree is an indexing mechanism closely related to B-trees and Prefix B-trees. In this paper we derive the expected storage overhead of O-Trees under the standard Bernoulli model of randomness, compare the results with the expected overhead of B-trees and Prefix B-trees under the same conditions, and assess the expected relative improvements

Topics: Access methods, databases, performance analysis, trees
Year: 1996
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9412
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.iit.edu/~ratko/r... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.