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.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 444-451 |
| Number of pages | 8 |
| ISBN (Print) | 0818608277 |
| State | Published - 1988 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'SEMANTIC QUERY OPTIMIZATION IN RECURSIVE DATABASES.'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS