×

Heuristics for syntactical optimization of relational queries. (English) Zbl 0676.68070

Summary: We present a decidable method that uses certain well defined transformation rules in order to achieve query optimizations.

MSC:

68P20 Information storage and retrieval of data
68T99 Artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bernstein, P. A.; Goodman, N.; Wong, E., Query processing in a system for distributed databases (SDD-1), ACM Trans. Database Systems, 6, 4, 602-625 (1981) · Zbl 0465.68060
[2] R. Demolombe, Semantic checking of questions expressed in predicate calculus language, in: Proc. VLDB 1979; R. Demolombe, Semantic checking of questions expressed in predicate calculus language, in: Proc. VLDB 1979
[3] Demolombe, R.; Illarramendi, A., Heuristiques pour l’optimisation syntaxique de requetes relationnelles, (Journées d’Etude “Des Bases de Données aux Bases de Connaissances (1987), Sophia-Antipolis: Sophia-Antipolis France)
[4] Jarke, M.; Schmidt, J. W., Query processing strategies in the PASCAL /R relational database management system, (Proc. ACM SIGMOD Conference (1982)), 256-264, Orlando
[5] Kim, W.; Reiner, S.; Batory, S., Query Processing in Database Systems (1985), Springer: Springer Berlin · Zbl 0581.68070
[6] Smith, J. M.; Chang, P. Y.T., Optimizing the performance of a relational algebra database interface, Comm. ACM, 18, 10, 568-579 (1975) · Zbl 0311.68022
[7] Ullman, J. D., Principles of Database Systems (1982), Computer Science Press: Computer Science Press Rockville, MD · Zbl 0558.68078
[8] Wong, E.; Youssefi, K., Decomposition — a strategy for query processing, ACM Trans. Database Systems, 1, 3, 223-241 (1976)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.