ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Performance Analysis of three Related Assignment Problems.

Clement T. Yu, K. Lam, M. K. Siu, Z. Meral Özsoyoglu: Performance Analysis of three Related Assignment Problems. SIGMOD Conference 1979: 82-92
@inproceedings{DBLP:conf/sigmod/YuLSO79,
  author    = {Clement T. Yu and
               K. Lam and
               M. K. Siu and
               Z. Meral {\"O}zsoyoglu},
  editor    = {Philip A. Bernstein},
  title     = {Performance Analysis of three Related Assignment Problems},
  booktitle = {Proceedings of the 1979 ACM SIGMOD International Conference on
               Management of Data, Boston, Massachusetts, May 30 - June 1},
  publisher = {ACM},
  year      = {1979},
  isbn      = {0-89791-001-X},
  pages     = {82-92},
  ee        = {http://doi.acm.org/10.1145/582095.582109, db/conf/sigmod/YuLSO79.html},
  crossref  = {DBLP:conf/sigmod/79},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

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 theperformance of a hashing scheme under the assumption that the record-to-bucket probability varies from one bucket to another. The solutions to these problemsare obtained by studying an occupancy problem. In each case, an optimal solution is obtained.

Copyright © 1979 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Philip A. Bernstein (Ed.): Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, May 30 - June 1. ACM 1979, ISBN 0-89791-001-X BibTeX
Contents

Online Edition: ACM Digital Library

References

[1]
...
[2]
...
[3]
...
[4]
...
[5]
...
[6]
Robert S. Epstein, Michael Stonebraker, Eugene Wong: Distributed Query Processing in a Relational Data Base System. SIGMOD Conference 1978: 169-180 BibTeX
[7]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
[8]
...
[9]
James B. Rothnie Jr., Tomas Lozano: Attribute Based File Organization in a Paged Memory Environment. Commun. ACM 17(2): 63-69(1974) BibTeX
[10]
...
[11]
Alfonso F. Cardenas: Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263(1975) BibTeX
[12]
...
[13]
Kenneth F. Siler: A Stochastic Evaluation Model for Database Organization in Data Retrieval Systems. Commun. ACM 19(2): 84-95(1976) BibTeX
[14]
S. Bing Yao: Approximating the Number of Accesses in Database Organizations. Commun. ACM 20(4): 260-261(1977) BibTeX
[15]
...
[16]
S. Bing Yao: An Attribute Based Model for Database Access Cost Analysis. ACM Trans. Database Syst. 2(1): 45-67(1977) BibTeX
[17]
...
[18]
...
[19]
Ronald L. Rivest: On Self-Organizing Sequential Search Heuristics. Commun. ACM 19(2): 63-67(1976) BibTeX
[20]
...
[21]
Robert Morris: Scatter Storage Techniques. Commun. ACM 11(1): 38-44(1968) BibTeX
[22]
Jeffrey D. Ullman: A Note on the Efficiency of Hashing Functions. J. ACM 19(3): 569-575(1972) BibTeX
[23]
Dennis G. Severance: Identifier Search Mechanisms: A Survey and Generalized Model. ACM Comput. Surv. 6(3): 175-194(1974) BibTeX
[24]
...
[25]
...
[26]
...
[27]
...
[28]
Esen A. Ozkarahan, Stewart A. Schuster, Kenneth C. Sevcik: Performance Evaluation of a Relational Associative Processor. ACM Trans. Database Syst. 2(2): 175-195(1977) BibTeX
[29]
P. C. Yue, C. K. Wong: On the Optimality of the Probability Ranking Scheme in Storage Applications. J. ACM 20(4): 624-633(1973) BibTeX
[30]
...
[31]
Ronald Fagin, Malcolm C. Easton: The independence of miss ratio on page size. J. ACM 23(1): 128-146(1976) BibTeX

Referenced by

  1. Kyu-Young Whang, Brad T. Vander Zanden, Howard M. Taylor: A Linear-Time Probabilistic Counting Algorithm for Database Applications. ACM Trans. Database Syst. 15(2): 208-229(1990)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:39:20 2009