SUBSUMPTION BETWEEN QUERIES TO OBJECT-ORIENTED DATABASES

被引：22

作者：

BUCHHEIT, M ^{[1
]}

JEUSFELD, MA ^{[1
]}

NUTT, W ^{[1
]}

STAUDT, M ^{[1
]}

机构：

[1] RHEIN WESTFAL TH AACHEN,D-52056 AACHEN,GERMANY

来源：

INFORMATION SYSTEMS | 1994年 / 19卷 / 01期

关键词：

D O I：

10.1016/0306-4379(94)90025-6

中图分类号：

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

学科分类号：

0812 ;

摘要：

Most work on query optimization in relational and object-oriented databases has concentrated on tuning algebraic expressions and the physical access to the database contents. The attention to semantic query optimization, however, has been restricted due to its inherent complexity. We take a second look at semantic query optimization in object-oriented databases and find that reasoning techniques for concept languages developed in Artificial Intelligence apply to this problem because concept languages have been tailored for efficiency and their semantics is compatible with class and query definitions in object-oriented databases. We propose a query optimizer that recognizes subset relationships between a query and a view (a simpler query whose answer is stored) in polynomial time. The selected schema and query language is maximal in the sense that any added feature ruins tractability.

引用

页码：33 / 54

页数：22

共 37 条

[1]

ABITEBOUL S, 1989, P ACM SIGMOD INT C M, P159

[2]

ABITEBOUL S, 1991, 1991 P ACM SIGMOD IN, P238

[3]

Aho A. V., 1979, ACM Transactions on Database Systems, V4, P435, DOI 10.1145/320107.320112

[4]

BANCILHON F, 1992, BUILDING OBJECT ORIE, P234

[5]

CHAKRAVARTH US, 1990, ACM T DATABASE SYST, V5, P162

[6]

CHAKRAVARTHY US, 1988, F DEDUCTIVE DATABASE, P243

[7]

CHAN EPF, 1992, 11TH P ACM S PRINC D, P202

[8]

CHANDRA AK, 1993, 9TH ANN ACM S THEOR, P77

[9] THE COMPLEXITY OF EXISTENTIAL QUANTIFICATION IN CONCEPT LANGUAGES [J].

DONINI, FM ;

LENZERINI, M ;

NARDI, D ;

HOLLUNDER, B ;

NUTT, W ;

SPACCAMELA, AM .

ARTIFICIAL INTELLIGENCE, 1992, 53 (2-3) :309-327

[10]

DONINI FM, 1991, 2ND P INT C PRINC KN, P151

← 1 2 3 4 →