Performance analysis of three related assignment problems

The relative placement of records in a database has a significant impact on the overall system performance. In this paper we study three related assignment problems. They are (1) the assignment of records to devices so as to minimize the expected completion time and to maximize the expected utilization of the devices, (2) the assignment of records to pages or blocks in secondary memory so as to minimize the number of blocks to be accessed, and (3) the analysis of the performance of a hashing scheme under the assumption that the record-to-bucket probability varies from one bucket to another. The solutions to these problems are obtained by studying an occupancy problem. In each case, an optimal solution is obtained.

[1]  Ronald Fagin,et al.  The independence of miss ratio on page size , 1976, JACM.

[2]  G SeveranceDennis.  Identifier Search Mechanisms: A Survey and Generalized Model , 1974 .

[3]  Stewart A. Schuster,et al.  Exploiting parallelism in a Relational Associative Processor , 1978, CAW '78.

[4]  L. R. Johnson,et al.  An indirect chaining method for addressing on secondary keys , 1961, CACM.

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

[6]  S. Bing Yao.  An attribute based model for database access cost analysis , 1977, TODS.

[7]  A. Y. Chan.  INDEX SELECTION IN A SELF-ADAPTIVE RELATIONAL DATA BASE MANAGEMENT SYSTEM , 1976 .

[8]  James B. Rothnie,et al.  Attribute based file organization in a paged memory environment , 1974, CACM.

[9]  Michael Stonebraker,et al.  Distributed query processing in a relational data base system , 1978, SIGMOD Conference.

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

[11]  Ronald Fagin,et al.  Asymptotic Miss Ratios over Independent References , 1977, J. Comput. Syst. Sci..

[12]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

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

[14]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[15]  James Martin,et al.  Computer Data-Base Organization , 1975 .

[16]  Chak-Kuen Wong,et al.  On the Optimality of the Probability Ranking Scheme in Storage Applications , 1973, JACM.

[17]  Bernard Harris,et al.  Theory of Probability , 1967 .

[18]  G. P. Steck,et al.  Moments of Order Statistics from the Equicorrelated Multivariate Normal Distribution , 1962 .

[19]  Kenneth F. Siler.  A stochastic evaluation model for database organizations in data retrieval systems , 1976, CACM.

[20]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[21]  Vincent Y. Lum,et al.  Key-to-address transform techniques: a fundamental performance study on large existing formatted files , 1971, CACM.

[22]  Jeffrey D. Ullman.  A Note on the Efficiency of Hashing Functions , 1972, JACM.

[23]  Dennis Gordon Severance.  Some generalized modeling structures for use in design of file organizations. , 1972 .