DocumentCode
2705000
Title
On representing indefinite and maybe information in relational databases: a generalization
Author
Liu, Ken-Chih ; Sunderraman, Rajshekhar
Author_Institution
AT&T Lab., Naperville, IL, USA
fYear
1990
fDate
5-9 Feb 1990
Firstpage
495
Lastpage
502
Abstract
The authors present a generalization of the relational model to represent indefinite and maybe kinds of incomplete information. They introduce a data structure called M-table which is capable of representing disjunctive/indefinite and maybe facts. The notion of redundancy in the context of indefinite and maybe information is studied. The information content of an M-table is precisely defined. The relational algebra is then generalized in a semantically correct manner to operate on M-tables. Queries are posed in the same manner as in the conventional relational algebra; however, the user may now expect indefinite as well as maybe answers
Keywords
data structures; fuzzy logic; relational databases; M-table; data structure; fuzzy logic; incomplete information; indefinite information representation; information content; maybe information; redundancy; relational databases; relational model; Algebra; Artificial intelligence; Computer science; Data structures; Laboratories; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1990. Proceedings. Sixth International Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
0-8186-2025-0
Type
conf
DOI
10.1109/ICDE.1990.113503
Filename
113503
Link To Document