Loading [a11y]/accessibility-menu.js
Minimum Search Tree Structures for Data Partitioned into Pages | IEEE Journals & Magazine | IEEE Xplore

Minimum Search Tree Structures for Data Partitioned into Pages


Abstract:

The doubly chained tree structure is an efficient device for organizing a file that must be searched and updated frequently. This paper considers a variation to the doubl...Show More

Abstract:

The doubly chained tree structure is an efficient device for organizing a file that must be searched and updated frequently. This paper considers a variation to the doubly chained tree which is more representative of a file in which the data is partitioned into blocks or pages. In this model the cost of searching the next node is 1 if the node is reachable from the same root (i.e., on the same page), and is k if the next node is the next root (i. e., on a different page). An algorithm for constructing doubly chained trees having any number of terminal nodes N, with minimal average search length, is developed. A simple closed expression is derived for the minimum average search time as a function of the number of terminal nodes N and the parameter k. A proof of optimality is also included.
Published in: IEEE Transactions on Computers ( Volume: C-21, Issue: 9, September 1972)
Page(s): 961 - 967
Date of Publication: 29 May 2009

ISSN Information:


References

References is not available for this document.