Details
| Original language | English |
|---|---|
| Title of host publication | Advances in Database Technology |
| Subtitle of host publication | EDBT 1992 - 3rd International Conference on Extending Database Technology, Proceedings |
| Editors | Alain Pirotte, Georg Gottlob, Claude Delobel |
| Publisher | Springer Verlag |
| Pages | 88-103 |
| Number of pages | 16 |
| ISBN (print) | 9783540552703 |
| Publication status | Published - 1992 |
| Event | 3rd International Conference on Extending Database Technology, EDBT 1992 - Vienna, Austria Duration: 23 Mar 1992 → 27 Mar 1992 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 580 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (electronic) | 1611-3349 |
Abstract
Our goal is to generalize the well known bottom-up, set-oriented query evaluation for deductive databases in two aspects: First, we consider arbitrary danses as rules in the database, not only Horn clauses or clauses with stratified negation. This allows to represent disjunctive information, in the database as well as in answers to queries. We utilize NF2 relations for modelling sets of disjunctive facts and operations of the corresponding relational algebra for computing consequences and answers. Thus our algorithm should be of practical importance for applying database techniques in generalized deductions. Second, we parameterize the implicit database completion which underlies query evaluation. The classical rule for Horn clause databases, which only assumes the negation of facts not implied by the database, is not applicable to disjunctive databases. Moreover, the choice of completion often depends on the intended application. Therefore we allow the specification of arbitrary clauses as defaults, and we extend our algorithm to consider such general defaults.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Advances in Database Technology : EDBT 1992 - 3rd International Conference on Extending Database Technology, Proceedings. ed. / Alain Pirotte; Georg Gottlob; Claude Delobel. Springer Verlag, 1992. p. 88-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 580 LNCS).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Generalized Bottom-Up Query Evaluation
AU - Brass, Stefan
AU - Lipeck, Udo W.
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1992.
PY - 1992
Y1 - 1992
N2 - Our goal is to generalize the well known bottom-up, set-oriented query evaluation for deductive databases in two aspects: First, we consider arbitrary danses as rules in the database, not only Horn clauses or clauses with stratified negation. This allows to represent disjunctive information, in the database as well as in answers to queries. We utilize NF2 relations for modelling sets of disjunctive facts and operations of the corresponding relational algebra for computing consequences and answers. Thus our algorithm should be of practical importance for applying database techniques in generalized deductions. Second, we parameterize the implicit database completion which underlies query evaluation. The classical rule for Horn clause databases, which only assumes the negation of facts not implied by the database, is not applicable to disjunctive databases. Moreover, the choice of completion often depends on the intended application. Therefore we allow the specification of arbitrary clauses as defaults, and we extend our algorithm to consider such general defaults.
AB - Our goal is to generalize the well known bottom-up, set-oriented query evaluation for deductive databases in two aspects: First, we consider arbitrary danses as rules in the database, not only Horn clauses or clauses with stratified negation. This allows to represent disjunctive information, in the database as well as in answers to queries. We utilize NF2 relations for modelling sets of disjunctive facts and operations of the corresponding relational algebra for computing consequences and answers. Thus our algorithm should be of practical importance for applying database techniques in generalized deductions. Second, we parameterize the implicit database completion which underlies query evaluation. The classical rule for Horn clause databases, which only assumes the negation of facts not implied by the database, is not applicable to disjunctive databases. Moreover, the choice of completion often depends on the intended application. Therefore we allow the specification of arbitrary clauses as defaults, and we extend our algorithm to consider such general defaults.
UR - http://www.scopus.com/inward/record.url?scp=85029808619&partnerID=8YFLogxK
U2 - 10.1007/BFb0032425
DO - 10.1007/BFb0032425
M3 - Conference contribution
AN - SCOPUS:85029808619
SN - 9783540552703
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 88
EP - 103
BT - Advances in Database Technology
A2 - Pirotte, Alain
A2 - Gottlob, Georg
A2 - Delobel, Claude
PB - Springer Verlag
T2 - 3rd International Conference on Extending Database Technology, EDBT 1992
Y2 - 23 March 1992 through 27 March 1992
ER -