Skip to main navigation Skip to search Skip to main content

Filtering data flow in deductive databases

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

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 languageEnglish
Title of host publicationICDT 1986 - International Conference on Database Theory, Proceedings
EditorsGiorgio Ausiello, Paolo Atzeni
PublisherSpringer Verlag
Pages186-202
Number of pages17
ISBN (Print)9783540171874
DOIs
StatePublished - 1986
EventInternational Conference on Database Theory, ICDT 1986 - Rome, Italy
Duration: 8 Sep 198610 Sep 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume243 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Database Theory, ICDT 1986
Country/TerritoryItaly
CityRome
Period8/09/8610/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