A unified analysis of batched searching of sequential and tree-structured files

A direct and unified approach is used to analyze the efficiency of batched searching of sequential and tree-structured files. The analysis is applicable to arbitrary search distributions, and closed-form expressions are obtained for the expected batched searching cost and savings. In particular, we consider a search distribution satisfying Zipf's law for sequential files and four types of uniform (random) search distribution for sequential and tree-structured files. These results unify and extend earlier research on batched searching and estimating block accesses for database systems.

[1]  Gio Wiederhold,et al.  Database Design , 1977 .

[2]  Gio Wiederhold,et al.  Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.

[3]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  John Zahorjan,et al.  Estimating Block Transfers When Record Access Probabilities are Non-Uniform , 1983, Inf. Process. Lett..

[6]  Ben Shneiderman,et al.  Batched searching of sequential and tree structured files , 1976, TODS.

[7]  Calvin C. Gotlieb,et al.  A unifying model of physical databases , 1982, TODS.

[8]  Marek Piwowarski.  Comments on batched searching of sequential and tree-structured files , 1985, TODS.

[9]  Prashant Palvia.  Expressions for batched searching of sequential and hierarchical files , 1985, TODS.

[10]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[11]  J. H. Jou,et al.  Improving the differential file technique via batch operations for tree structured file organizations , 1986, 1986 IEEE Second International Conference on Data Engineering.

[12]  Sheau-Dong Lang,et al.  Improving the Differential File Technique via Batch Operations for Tree Structured File Organizations , 1986, ICDE.

[13]  Alfonso F. Cardenas.  Analysis and performance of inverted data base structures , 1975, CACM.

[14]  Dina Bitton,et al.  A general framework for computing block accesses , 1987, Inf. Syst..

[15]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[16]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[17]  Jane Fedorowicz.  A Zipfian Model of an Automatic Bibliographic System: An Application to MEDLINE , 1982, J. Am. Soc. Inf. Sci..

[18]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[19]  Sheau-Dong Lang,et al.  Batch Insertion for Tree Structured File Organizations - Improving Differential Database Reprensentation , 1986, Inf. Syst..

[20]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[21]  Sheau-Dong Lang,et al.  Modeling B-Tree Insertion Activity , 1987, Inf. Process. Lett..

[22]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[23]  Thomas C. Lowe.  The Influence of Data Base Characteristics and Usage on Direct Access File Organization , 1968, J. ACM.

[24]  Jane Fedorowicz,et al.  Database performance evaluation in an indexed file environment , 1987, TODS.

[25]  Ketil Bo,et al.  Data Base Design , 1980, CAD Advanced Course.

[26]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[27]  To-Yat Cheung.  Estimating block accesses and number of records in file management , 1982, CACM.