Bounded disorder file organization

Author

Ramakrishna, M.V.

Author_Institution

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA

Volume

6

Issue

1

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

79

Lastpage

85

Abstract

The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization

Keywords

file organisation; indexing; trees (mathematics); alternate file growth method; approximate analysis; bounded disorder file organization; classical sequential occupancy problem; data nodes; exact model; hashing; repeated trials; storage utilization; tree indexing; universal hashing; Computer science; Data analysis; Database systems; Design methodology; Helium; Indexing; Information retrieval; Probes; Read-write memory;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.273028

Filename

273028