article

Free access

Optimization of query evaluation algorithms

Editor: David K. Hsiao Author:

S. Bing YaoAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 4, Issue 2

Pages 133 - 155

https://doi.org/10.1145/320071.320072

Published: 01 June 1979 Publication History

Abstract

A model of database storage and access is presented. The model represents many evaluation algorithms as special cases, and helps to break a complex algorithm into simple access operations. Generalized access cost equations associated with the model are developed and analyzed. Optimization of these cost equations yields an optimal access algorithm which can be synthesized by a query subsystem whose design is based on the modular access operations.

References

[1]

ASTRAHAN, M.M., AND CHAMBERLIN, D.D. Implementation of a structured English query language. Comm. ACM 18, 10 (Oct. 1975), 580-588.

Digital Library

[2]

ASTRAHAN, M.M., ET AL. System R: A relational approach to database management. ACM Trans. Database Syst. I, 2 (June 1976), 97-137.

Digital Library

[3]

BLASGEN, M.W., AND ESWARAN, K.P. Storage access in relational data bases. IBM Syst. J. 4 (1977), 363-377.

Digital Library

[4]

CODD, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387.

Digital Library

[5]

CODD, E.F. A data base sublanguage founded on the relational calculus. Proc. ACM SIGFIDET Workshop on Data Descripion, Access and Control, San Diego, Calif., 1971, pp. 35-68.

Digital Library

[6]

GOTLEIB, L. Computing joins of relations. Proc. ACM-SIGMOD Conf. Manage. of Data, San Jose, Calif., May 1975, pp. 55-63.

Digital Library

[7]

HEVNER, A.R., AND YAO, S.B. Query processing on distributed database systems. To appear in IEEE Trans. Software Eng.

Digital Library

[8]

HEVNER, A.R., AND YAO, S.B. Optimization of data access in distributed systems. Tech. Rep. TR281, Comptr. Sci. Dept., Purdue U., W. Lafayette, Ind., July 1978.

[9]

IBM. Information Management System. General Information Manual, Form GH20-0765, IBM Corp., Data Processing Div., White Plains, N.Y.

[10]

KNUTH, D. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison- Wesley, Reading, Mass., 1973.

Digital Library

[11]

LIu, J.W.S. Algorithms for parsing search queries in systems with inverted f'de organizations. ACM Trans. Database Syst. 1, 4 (Dec~ 1976), 299-316.

Digital Library

[12]

PECHERER, R.M. Efficient evaluation of expressions in a relational algebra. Proc. ACM Pacific 75 Conf., April 1975, pp. 44-49.

[13]

ROTHNIE, J.B. Evaluating inter-entry retrieval expressions in a relational database management system. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 417-423.

[14]

SCHKOLNICK, M. A clustering algorithm for hierarchical structures. ACM Trans. Database Syst., 2, 1 (March 1977), 27-44.

Digital Library

[15]

SHU, N.C., HOUSEL, B.C., TAYLOR, R.W., GHOSH, S.P., AND LUM, V.Y. EXPRESS: A data EXtraction, Processing and REStructuring System. A CM Trans. Database Syst. 2, 2 (June 1977), 134-174.

Digital Library

[16]

SMITH, J.M., AND CHANG, P.Y.T. Optimizing the performance of a relational algebra database interface. Comm. ACM 18, 10 (Oct. 1975), 568-579.

Digital Library

[17]

TSICHRITZIS, D. A network framework for relation implementation. IFIPS TC-2 Working Conf. Data Definition Languages, Jan. 1975.

[18]

Wo~G, E., AND YOUSSEFI, K. Decomposition--a strategy for query processing. ACM Tra~zs. Database Syst. 1, 3 (Sept. 1976), 223-241.

Digital Library

[19]

YAO, S.B. An attribute based model for database access cost analysis. ACM Trans. Database Syst. 2, 1 (March 1977), 45-67.

Digital Library

[20]

YAO, S.B., AND DEJoNc, D. Evaluation of database access paths. Proc. ACM SIGMOD Int. Conf. Manage. of Data, Austin, Tex., May 1978, pp. 66-77.

Digital Library

[21]

YAo, S.B. Optimization of query evaluation algorithms. Tech. Rep. TR283, Comptr. Sci. Dept., Purdue U., W. Lafayette, Ind., Aug. 1978.

[22]

WONG, E. Retrieving dispersed data from SDD-I: A system for distributed databases. 1977 Berkeley Workshop on Distributed Data Manage. and Comptr. Networks, May 1977, pp. 217-235.

Cited By

Shichkina YKupriyanov MShevsky V(2018)The Application of Graph Theory and Adjacency Lists to Create Parallel Queries to Relational DatabasesInternet of Things, Smart Spaces, and Next Generation Networks and Systems10.1007/978-3-030-01168-0_13(138-149)Online publication date: 29-Sep-2018
https://doi.org/10.1007/978-3-030-01168-0_13
Järvelin K(2016)A methodology for user charge estimation in numeric online databanks. Part IIJournal of Information Science10.1177/01655515880140020314:2(77-92)Online publication date: Jul-2016
https://doi.org/10.1177/016555158801400203
Järvelin K(2016)A methodology for user charge estimation in numeric online databanks. Part I: A review of numeric databanks and charging principlesJournal of Information Science10.1177/01655515880140010214:1(3-16)Online publication date: Jul-2016
https://doi.org/10.1177/016555158801400102
Show More Cited By

Index Terms

Optimization of query evaluation algorithms
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)

Recommendations

Optimizing the performance of a relational algebra database interface

An approach for implementing a “smart” interface to support a relational view of data is proposed. The basic idea is to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification ...
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems

The problem of optimal query processing in distributed database systems was shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. In this paper, we describe algorithms to improve the solutions ...
Multidatabase Query Optimization

A multidatabase system (MDBS) allows the users to simultaneously access heterogeneous, and autonomous databases using an integrated schema and a single global query language. The query optimization problem in MDBSs is quite different from the query ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 4, Issue 2

June 1979

128 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/320071

Editor:
David K. Hsiao
Ohio State Univ., Columbus

Issue’s Table of Contents

Copyright © 1979 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1979

Published in TODS Volume 4, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

138
Total Citations
View Citations
1,192
Total Downloads

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

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Shichkina YKupriyanov MShevsky V(2018)The Application of Graph Theory and Adjacency Lists to Create Parallel Queries to Relational DatabasesInternet of Things, Smart Spaces, and Next Generation Networks and Systems10.1007/978-3-030-01168-0_13(138-149)Online publication date: 29-Sep-2018
https://doi.org/10.1007/978-3-030-01168-0_13
Järvelin K(2016)A methodology for user charge estimation in numeric online databanks. Part IIJournal of Information Science10.1177/01655515880140020314:2(77-92)Online publication date: Jul-2016
https://doi.org/10.1177/016555158801400203
Järvelin K(2016)A methodology for user charge estimation in numeric online databanks. Part I: A review of numeric databanks and charging principlesJournal of Information Science10.1177/01655515880140010214:1(3-16)Online publication date: Jul-2016
https://doi.org/10.1177/016555158801400102
Verborgh RVander Sande MHartig OVan Herwegen JDe Vocht LDe Meester BHaesendonck GColpaert P(2016)Triple Pattern FragmentsWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2016.03.00337:C(184-206)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.websem.2016.03.003
Vossen G(2009)Datenmodelle, Datenbanksprachen und Datenbank-managementsysteme10.1524/9783486594959.767(767-807)Online publication date: Dec-2009
https://doi.org/10.1524/9783486594959.767
SOOD AABDELGUERFI M(2007)Parallel and pipelined processing of some relational algebra operationsInternational Journal of Electronics10.1080/0020721850892071959:4(477-482)Online publication date: 24-Feb-2007
https://doi.org/10.1080/00207218508920719
Cho WHong KLoh W(2007)Estimating nested selectivity in object-oriented and object-relational databasesInformation and Software Technology10.1016/j.infsof.2006.09.00449:7(806-816)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.infsof.2006.09.004
Biskup JMenzel R(2006)Optimising abstract object-oriented database schemasProceedings of the 25th international conference on Conceptual Modeling10.1007/11901181_39(528-543)Online publication date: 6-Nov-2006
https://dl.acm.org/doi/10.1007/11901181_39
Húsek DSnášel VNeruda ROwais SKrömer P(2005)Evolutionary algorithms for Boolean queries optimizationProceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics10.5555/1984569.1984574(18-23)Online publication date: 17-Nov-2005
https://dl.acm.org/doi/10.5555/1984569.1984574
Wong SLingras PYao Y(2005)Towards implementing valuation based systems with relational databasesMethodologies for Intelligent Systems10.1007/3-540-54563-8_81(172-182)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-54563-8_81
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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 Article

Media

Figures

Other

Tables

View Issue’s Table of Contents