Abstract
We investigate the question of how query optimization strategies devised for relational databases can be used for deductive databases. In particular, we show how the well known method of moving selections and projections down the parse trees of relational algebra expressions can be generalized to the case of deductive databases. The optimization is achieved by means of filtering data flow in the system.
| Original language | English |
|---|---|
| Title of host publication | ICDT 1986 - International Conference on Database Theory, Proceedings |
| Editors | Giorgio Ausiello, Paolo Atzeni |
| Publisher | Springer Verlag |
| Pages | 186-202 |
| Number of pages | 17 |
| ISBN (Print) | 9783540171874 |
| DOIs | |
| State | Published - 1986 |
| Event | International Conference on Database Theory, ICDT 1986 - Rome, Italy Duration: 8 Sep 1986 → 10 Sep 1986 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 243 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Database Theory, ICDT 1986 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 8/09/86 → 10/09/86 |
Bibliographical note
Publisher Copyright:© 1986, Springer-Verlag.
Fingerprint
Dive into the research topics of 'Filtering data flow in deductive databases'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver