Semantic query optimization in recursive databases
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 444-451
- https://doi.org/10.1109/icde.1988.105490
Abstract
Semantic query optimization is the process of using semantic knowledge expressed in the form of integrity constraints to transform a query into a semantically equivalent one; one that is thought to be less expensive to process. The authors analyze the possibilities of semantic optimization in a deductive database that includes recursive relations and, consequently, integrity constraints that include recursive literals. They propose a compiled approach to utilizing semantic knowledge in recursive query processing, assuming recursive queries are processed using compiled iterative methods. Also, a method of residue propagation for obtaining implied constraints that are often useful in optimization is presented.<>Keywords
This publication has 6 references indexed in Scilit:
- A system for semantic query optimizationPublished by Association for Computing Machinery (ACM) ,1987
- Handling redundancy in the processing of recursive database queriesPublished by Association for Computing Machinery (ACM) ,1987
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Query Optimization in Database SystemsACM Computing Surveys, 1984
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984