More Web Proxy on the site http://driver.im/

Article

Free access

Performance analysis of a relational data base management system

Authors:

Paula Hawthorn,

Michael StonebrakerAuthors Info & Claims

SIGMOD '79: Proceedings of the 1979 ACM SIGMOD international conference on Management of data

Pages 1 - 12

https://doi.org/10.1145/582095.582097

Published: 30 May 1979 Publication History

Abstract

The effect on the performance of data management systems of the use of extended storage devices, multiple processors and prefetching data blocks is analyzed with respect to one system, INGRES. Benchmark query streams, derived from user queries, were run on the INGRES system and their CPU usage and data reference patterns traced. The results show that the performance characteristics of two query types: data-intensive queries and overhead-intensive queries, are so different that it may be difficult to design a single architecture to optimize the performance of both types. It is shown that the random access model of data references holds only for overhead-intensive queries, and then only if references to system catalogs are not considered data references. Significant sequentiality of reference was found in the data-intensive queries. It is shown that back-end data management machines that distribute processing toward the data may be cost effective only for data-intensive queries. It is proposed that the best method of distributing the processing of the overhead-intensive query is through the use of intelligent terminals. A third benchmark set, multi-relation queries, was devised, and proposals are made for taking advantage of the locality of reference which was found.

References

[1]

{ALLM76} Allman, E., Stonebraker, M. and Held, G., "Embedding a Relational Data Sublanguage in a General Purpose Programming Language," Proc. Conference on Data: Abstraction, Definition, and Structure, FDT, vol 8, No 2, March 1976.

Digital Library

[2]

{BLAS76} Blasgen, M.W. and Eswaren, K.P., "On the Evaluation of Queries in a Relational Data Base System," IBM Research Report RJ-1745, April, 1976.

[3]

{DENN68} Denning, P. J., "The Working Set Model for Program Behavior," CACM, May, 1968, Vol. 11, No. 5, pp. 323--333.

Digital Library

[4]

{DEWI78} Dewitt, D. J., "DIRECT --- A Multiprocessor Organization for Supporting Relational Data Base management Systems," Proc. Fifth Annual Symposium on Computer Architecture, 1978.

Digital Library

[5]

{EPST77} Epstein, R., "Creating and Maintaining a Database Using INGRES," Electronics Research Laboratory, University of California, Berkeley, Ca., Memo #M77-71, Dec. 1977.

[6]

{GRAY78} Gray, James, "Notes on Data Base Operating Systems," IBM Research Report RJ2188 (30001) 2/23/78.

[7]

{LANG77} Lang, Thomas, Wood, Christopher and Fernandez, Eduardo f., "Database Buffer paging in Virtual Storage Systems," TODS, Vol. 2, No. 4, December, 1977.

Digital Library

[8]

{OZKA77} Ozkarahan, E.A., Schuster, S.A. and Sevcik, K.C., "Performance Evaluation of a Relational Associative Processor," ACM Transactions on Database Systems, Vol. 2, No. 2, June 1977.

Digital Library

[9]

{RODR76} Rodriguez-Rosell, Juan, "Empirical Data Reference Behavior in Data Base Systems," Computer, Nov., 1976, Pages 9--13.

Digital Library

[10]

{REIT76} Reiter, Allen, "A Study of Buffer Management Policies for Data Management Systems," Mathematics Research Center, University of Wisconsin-Madison, Technical Summary Report # 1619, March 1976.

[11]

{RITC74} Ritchie, D. M., and Thompson, K., "The UNIX Time-Sharing System," Communications ACM 17, 7, July, 1974.

Digital Library

[12]

{SHER76} Sherman, Stephen W., and Brice, B. W., "Performance of a Database Manager in a Virtual Memory System", ACM Transactions on Data Base Systems, Vol. 1, No. 4, Dec. 1976, Pages 317--343.

Digital Library

[13]

{SMIT76} Smith, Alan Jay, "Sequentiality and Prefetching in Data Base Systems," IBM Research Report RJ 1743, March 19, 1976.

[14]

{STON76} Stonebraker, M. et. al., "The Design and Implementation of INGRES," TODS, Vol 1, No. 3, September 1976.

Digital Library

[15]

{TUEL76} Tuel, W. G. Jr., "An analysis of Buffer Paging in Virtual Storage Systems," IBM Journal of Research and Development, Vol. 20, No.5, September 1976.

Digital Library

[16]

{WONG76} Wong, E. and Youssefi, K., "Decomposition --- A Strategy for Query Processing," TODS, Vol. 1, No. 3, September 1976.

Digital Library

[17]

{YAO 78} Yao, S.B., DeJong, D., "Evaluation of Database Access Paths," Proceedings, SIGMOD International Conference on the Management of Data, 1978.

Digital Library

[18]

{YOUS78} Youssefi, Karel A., "Query Processing for a Relational Database System," Electronics Research Laboratory, University of California, Berkeley, Ca., Memo #M78-3.

Cited By

Youssef MRevell N(2006)A measure for measureDatabase and Expert Systems Applications10.1007/BFb0049158(614-620)Online publication date: 1-Feb-2006
https://doi.org/10.1007/BFb0049158
Cesarini FPippolini FSoda G(2005)Chapter 10 Database machine design and performance evaluation: Annotated bibliographyDatabase Machine Performance: Modeling Methodologies and Evaluation Strategies10.1007/3-540-17942-9_20(208-250)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-17942-9_20
Cesarini FSalza S(2005)Chapter 1 IntroductionDatabase Machine Performance: Modeling Methodologies and Evaluation Strategies10.1007/3-540-17942-9_11(1-17)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-17942-9_11
Show More Cited By

Recommendations

Base-victim compression: an opportunistic cache compression architecture
ISCA '16: Proceedings of the 43rd International Symposium on Computer Architecture

The memory wall has motivated many enhancements to cache management policies aimed at reducing misses. Cache compression has been proposed to increase effective cache capacity, which potentially reduces capacity and conflict misses. However, complexity ...
Efficient type-ahead search on relational data: a TASTIER approach
SIGMOD '09: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data

Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have limited knowledge about the data, and have to use a try-and-see approach for ...
Base-victim compression: an opportunistic cache compression architecture
ISCA'16

The memory wall has motivated many enhancements to cache management policies aimed at reducing misses. Cache compression has been proposed to increase effective cache capacity, which potentially reduces capacity and conflict misses. However, complexity ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '79: Proceedings of the 1979 ACM SIGMOD international conference on Management of data

May 1979

208 pages

ISBN:089791001X

DOI:10.1145/582095

General Chair:
James B. Rothnie
Computer Corporation of America
,
Program Chair:
Philip A. Bernstein
Harvard University

Copyright © 1979 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 1979

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
659
Total Downloads

Downloads (Last 12 months)80
Downloads (Last 6 weeks)12

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Youssef MRevell N(2006)A measure for measureDatabase and Expert Systems Applications10.1007/BFb0049158(614-620)Online publication date: 1-Feb-2006
https://doi.org/10.1007/BFb0049158
Cesarini FPippolini FSoda G(2005)Chapter 10 Database machine design and performance evaluation: Annotated bibliographyDatabase Machine Performance: Modeling Methodologies and Evaluation Strategies10.1007/3-540-17942-9_20(208-250)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-17942-9_20
Cesarini FSalza S(2005)Chapter 1 IntroductionDatabase Machine Performance: Modeling Methodologies and Evaluation Strategies10.1007/3-540-17942-9_11(1-17)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-17942-9_11
Hsu WSmith AYoung H(2001)Characteristics of production database workloads and the TPC benchmarksIBM Systems Journal10.1147/sj.403.078140:3(781-802)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1147/sj.403.0781
Hsu WSmith AYoung H(2001)I/O reference behavior of production database workloads and the TPC benchmarks—an analysis at the logical levelACM Transactions on Database Systems10.1145/383734.38373726:1(96-143)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1145/383734.383737
DeFazio SDaoud ASmith LSrinivasan J(1995)Integrating IR and RDBMS using cooperative indexingProceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval10.1145/215206.215335(84-92)Online publication date: 1-Jul-1995
https://dl.acm.org/doi/10.1145/215206.215335
Dan AYu PChung J(1995)Characterization of database access pattern for analytic prediction of buffer hit probabilityThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/BF012324744:1(127-154)Online publication date: 1-Jan-1995
https://dl.acm.org/doi/10.1007/BF01232474
Dan AYu PChung J(1993)Database access characterization for buffer hit predictionProceedings of IEEE 9th International Conference on Data Engineering10.1109/ICDE.1993.344069(134-143)Online publication date: 1993
https://doi.org/10.1109/ICDE.1993.344069
Kearns JDeFazio S(1989)Diversity in database reference behaviorACM SIGMETRICS Performance Evaluation Review10.1145/75372.7537417:1(11-19)Online publication date: 1-Apr-1989
https://dl.acm.org/doi/10.1145/75372.75374
Kearns JDeFazio SFerrari D(1989)Diversity in database reference behaviorProceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems10.1145/75108.75374(11-19)Online publication date: 1-Apr-1989
https://dl.acm.org/doi/10.1145/75108.75374
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents