ON COMPILE-TIME QUERY OPTIMIZATION IN DEDUCTIVE DATABASES BY MEANS OF STATIC FILTERING

被引：17

作者：

KIFER, M ^{[1
]}

LOZINSKII, EL ^{[1
]}

机构：

[1] HEBREW UNIV JERUSALEM,DEPT COMP SCI,IL-91904 JERUSALEM,ISRAEL

来源：

ACM TRANSACTIONS ON DATABASE SYSTEMS | 1990年 / 15卷 / 03期

关键词：

dataflow; deductive databases; filtering; fixpoint; graph representation; inference; projection; recursive rules; selection;

D O I：

10.1145/88636.87121

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We extend the query optimization techniques known as algebric manipulations with relational expressions [48] to work with deductive databases. In particular, we propose a method for moving data-independent selections and projections into recursive axioms, which extends all other known techniques for performing that task [2, 3, 9, 18, 20]. We also show that, in a well-defined sense, our algorithm is optimal among the algorithms that propagate data-independent selections through recursion. © 1990, ACM. All rights reserved.

引用

页码：385 / 426

页数：42

共 52 条

[1] AFRATI F, 1986, 5TH P ACM S PRINC DA, P24
[2] AGRAWAL R, 1988, 4TH INT C DAT ENG LO
[3] Aho Alfred V., 1979, 6TH P ACM S PRINC PR, P110
[4] ALY H, 1987, P ACM SIGMOD INT C M
[5] [Anonymous], SYMBOLIC LOGIC MECHA
[6] [Anonymous], 1982, PRINCIPLES DATABASE
[7] BANCILHON F, 1986, 1986 P ACM SIGACT SI
[8] BEERI C, 1987, 6TH P ACM S PRINC DA, P214
[9] Ceri S., 1987, Proceedings of the Thirteenth International Conference on Very Large Data Bases: 1987 13th VLDB, P31
[10] CHANDRA AK, 1982, P PODS 82, P158

← 1 2 3 4 5 6 →