INDEFINITE AND MAYBE INFORMATION IN RELATIONAL DATABASES

被引：62

作者：

LIU, KC ^{[1
]}

SUNDERRAMAN, R ^{[1
]}

机构：

[1] WICHITA STATE UNIV,DEPT COMP SCI,WICHITA,KS 67208

来源：

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

关键词：

D O I：

10.1145/77643.77644

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper extends the relational model to represent indefinite and maybe kinds of incomplete information. A data structure, called an I-table, which is capable of representing indefinite and maybe facts, is introduced. The information content of I-tables is precisely defined, and an operator to remove redundant facts is presented. The relational algebra is then extended in a semantically correct way to operate on I-tables. Queries are posed in the same way as in conventional relational algebra; however, the user may now expect indefinite as well as maybe answers. © 1990, ACM. All rights reserved.

引用

页码：1 / 39

页数：39

共 17 条

[1]

[Anonymous], 1982, PRINCIPLES DATABASE

[2] A FOUNDATION OF CODD RELATIONAL MAYBE-OPERATIONS [J].

BISKUP, J .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1983, 8 (04) :608-636

[3]

BISKUP J, 1984, FUNDAMENTA INFORMATI, V7, P129

[4]

CODD EF, 1970, COMMUN ACM, V13, P377, DOI 10.1145/357980.358007

[5]

GALLAIRE H, 1984, COMPUT SURV, V16, P151

[6] PARTIAL VALUES IN A TUBULAR DATABASE MODEL [J].

GRANT, J .

INFORMATION PROCESSING LETTERS, 1979, 9 (02) :97-99

[7]

GRANT J, 1980, FUNDAMENTA INFORMATI, V3, P363

[8]

GRANT J, 1986, ADV COMPUTING RES, V3, P247

[9]

IMIELINSKI T, 1984, ADV DATABASE THEORY, V2, P285

[10]

IMIELINSKI T, 1981, 7TH P INT C VER LARG, P389

← 1 2 →