Indefinite and maybe information in deductive relational databases

Simple item page
dc.contributor.advisor Ken-Chih Liu
dc.contributor.author Sunderraman, Rajshekhar
dc.contributor.department Computer Science
dc.date 2018-08-15T16:56:56.000
dc.date.accessioned 2020-07-02T06:09:20Z
dc.date.available 2020-07-02T06:09:20Z
dc.date.copyright Fri Jan 01 00:00:00 UTC 1988
dc.date.issued 1988
dc.description.abstract <p>In this dissertation, we present an extended relational model to represent indefinite and maybe kinds of incomplete information. A data structure, called an I-table, is defined which is capable of representing indefinite and maybe information. The information content of an I-table is precisely defined and some properties of I-tables are characterized. Redundancy in I-tables is discussed and an operator to remove it is presented. The relational algebra is then suitably extended to operate on I-tables. A correctness criterion is presented and the extended relational algebraic operations are shown to satisfy the correctness criterion. Queries are answered in the same way as with the regular relational algebra, however we may now expect indefinite and maybe answers to queries. The extended relational algebra is then used to implement a subclass of indefinite deductive databases. A special class of non-Horn rules, called I-rules, is defined. An additional operator, called project-union, which is a further extension to the extended projection operator is presented. The project-union operator is used to evaluate I-rules. The correctness of the algebraic approach to indefinite e deductive databases is established. Finally, we present generalized I-tables, called M-tables, which are capable of representing more general forms of indefinite information. The relational algebra is further generalized to operate on M-tables. Additional operators, R-projection and merge, are defined to answer queries about M-tables.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/rtd/8806/
dc.identifier.articleid 9805
dc.identifier.contextkey 6344078
dc.identifier.doi https://doi.org/10.31274/rtd-180813-8846
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath rtd/8806
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/81835
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/rtd/8806/r_8825957.pdf|||Sat Jan 15 02:17:28 UTC 2022
dc.subject.disciplines Computer Sciences
dc.subject.keywords Computer science
dc.title Indefinite and maybe information in deductive relational databases
dc.type article
dc.type.genre dissertation
dspace.entity.type Publication
relation.isOrgUnitOfPublication f7be4eb9-d1d0-4081-859b-b15cee251456
thesis.degree.level dissertation
thesis.degree.name Doctor of Philosophy
File
Original bundle
Now showing 1 - 1 of 1
Name:
r_8825957.pdf
Size:
2.27 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations