On representing indefinite and maybe information in relational databases: a generalization

K.-C Liu ,Rajshekhar Sunderraman

doi:10.1109/icde.1990.113503

On representing indefinite and maybe information in relational databases: a generalization

K.-C Liu , Rajshekhar Sunderraman

https://doi.org/10.1109/icde.1990.113503

Copy DOI

Publication Date: Feb 5, 1990

Citations: 16

Affiliation: AT&T (United States), Illinois Institute of Technology, Wichita State University

#Information In Relational Databases #Notion Of Redundancy + Show 7 more

Abstract
Full-Text PDF
Similar Papers

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. >

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.