Title

Achieving Minimum Height For Block Split Tree Structured Files

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Inf. Syst.

Keywords

Computer Science; Information Systems

Abstract

In this paper we describe a technique to maintain minimum height for block split tree structured files such as the B-tree and its variants. The technique is not complex and involves negligible overhead. We also model the root node insertion activity for block split tree structured files. Our model enables us to predict the effectiveness of our new technique. We present experimental data to verify our model's predictions.

Journal Title

Information Systems

Volume

12

Issue/Number

1

Publication Date

1-1-1987

Document Type

Article

Language

English

First Page

115

Last Page

124

WOS Identifier

WOS:A1987J045600010

ISSN

0306-4379

Share

COinS