A Relational model of incomplete data without nulls

Michael Johnson, Stefano Kasangian

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

Abstract

The theoretical study of the relational model of data is ongoing and highly developed. Yet the vast majority of real databases include incomplete data, and the incomplete data is widely modelled using special flags called nulls. As noted many times by Date and others, the inclusion of nulls is not compatible with the relational model and invalidates many of the theoretical results as well as requiring a three-valued logic for query support. In category theoretic applications to computer science, partial functions are frequently modelled by using a special value approach (the partial map classifier), or by explicit reference to the domain of definition subobject. In a former edition of the CATS conference the first author and his colleague Rosebrugh proved a Morita equivalence theorem showing that for database modelling the two approaches are equivalent, provided the domain of definition subobject is complemented. In this paper we study the uncomplemented domain of definition approach (which is not equivalent to using special values). Our main results show that using uncomplemented domains of definition to model incomplete data is entirely compatible with the relational model and so leaves the well-developed theory applicable to real databases that use this approach. Furthermore, using uncomplemented domains of definition supports in-place updating, in stark contrast to special values, and, in a wide variety of circumstances, ensures the existence of cartesian and op-cartesian models which, as shown in a recent TCS article, are important for solving view update problems.
Original languageEnglish
Title of host publicationConferences in Research and Practice in Information Technology
Subtitle of host publicationproceedings of the Sixteenth Computing--the Australasian Theory Symposium (CATS 2010), Brisbane, Australia, January 18-21 2010
EditorsTaso Viglas, Alex Potanin
Place of PublicationSydney
PublisherAustralian Computer Society
Pages89-94
Number of pages6
ISBN (Print)9781920682903
Publication statusPublished - 2010
EventAustralasian Theory Symposium (16th : 2010) - Brisbane
Duration: 18 Jan 201021 Jan 2010

Publication series

NameConferences in research and practice in information technology series
PublisherAustralian Computer Society
Volume109
ISSN (Print)1445-1336

Conference

ConferenceAustralasian Theory Symposium (16th : 2010)
CityBrisbane
Period18/01/1021/01/10

Fingerprint Dive into the research topics of 'A Relational model of incomplete data without nulls'. Together they form a unique fingerprint.

Cite this