Abstract
Query processing strategies are frequently considered as sequential processes of successive decompositions and evaluations. This paper describes an approach that exploits opportunities to bypass steps in this sequential process. Initially, descriptions of the database are used in responding to queries since no other knowledge about the database exists (no queries have been previously encountered by the query processor). As queries are processed, descriptions of the individual queries and query fragments are retained along with the resulting access strategy, a description of the response, and costs to retrieve the desired information. This knowledge is then used to develop future access strategies.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
U.S. Chakravarthy, J. Grant, and J. Minker; “Logic-Based Approach to Semantic Query Optimization”, ACM Transactions on Database Systems, vol 15, no. 2, (June 1990).
J.M. Chang; “A Heuristic Approach to Distributed Query Processing,” Proc. of Eighth International Conference on Very Large Data Bases, (1982).
S. Christodoulakis; “Implications of Certain Assumptions in Database Performance Evaluation,” ACM Transactions on Database Systems, vol. 9, no. 2, (1984).
S.B. Navathe, S. Ceri, and G. Wiederhold; “Distribution Design of Logical Database Schemas,” IEEE Transactions on Software Engineering, vol. 9, no. 4, (1983).
S. Ceri and G. Pelagatti; Distributed Databases; Principles and Systems. McGraw-Hill, New York, NY (1984).
L.W. Dowdy and D.V. Foster; “Comparative Models of the File Assignment Problem,” ACM Computing Surveys, vol. 14, no. 2, (1982).
R. Epstein, M. Stonebraker, and E. Wong; “Query Processing in a Distributed Relational Database System,” Proc. of the ACM SIGMOD International Conference on Management of Data, Austin, TX (1978).
T. Ibaraki and T. Kameda “On the Optimal Nesting Order for Computing N-Relation Joins,” ACM Transactions on Database Systems, vol. 9, no. 3, (1984).
L. Kerschberg, P.D. Ting, and S.B. Yao, “Query Optimization in Star Computer Networks,” ACM Transactions on Database Systems, vol. 7, no. 4, (1982).
B. Muthuswamy and L. Kerschberg; “A DDSM for Relational Query Optimization,” Procs. of ACM Annual Conference, (1985).
A. Motro; “An Access Authorization Model for Relational Databases Based on Algebraic Manipulation of View Definitions,” Proc. IEEE Computer Society 5th International Conference on Data Engineering, Los Angeles, CA (1989).
A. Motro; “Using Integrity Constraints to Provide Intensional Answers to Relational Queries,” Proc. 15th International Conference on Very Large Databases, Amsterdam (1989).
S. Mahmoud and J.S. Riordon, “Optimal Allocation of Resources in Distributed Information Networks,” ACM Transactions on Database Systems, vol. 1, no. 1, (1976)
M.T. Özsu and P. Valduriez; Principles of Distributed Database Systems. Prentice Hall, Englewood Cliffs, NJ (1991).
A. Pirotte, D. Roelants, E. Zimanyi; “Controlled Generation of Intensional Answers,” to appear in IEEE Transactions on Knowledge and Data Engineering, (1991).
C.K. Riesbeck and R.C. Schank; Inside Case-based Reasoning, Lawrence Erlbaum Associates, Hillsdale, NJ (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kerschberg, L., Waisanen, A. (1993). A cooperative approach to query processing: Integrating historical, structural, and behavioral knowledge sources. In: Calmet, J., Campbell, J.A. (eds) Artificial Intelligence and Symbolic Mathematical Computing. AISMC 1992. Lecture Notes in Computer Science, vol 737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57322-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-57322-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57322-7
Online ISBN: 978-3-540-48063-1
eBook Packages: Springer Book Archive