Codd table representations under weak possible world semantics

ResearchSpace Repository

Show simple item record

dc.contributor.author Ferrarotti, F en
dc.contributor.author Hartmann, S en
dc.contributor.author Le, VBT en
dc.contributor.author Link, Sebastian en
dc.contributor.editor Hameurlain, A en
dc.contributor.editor Liddle, SW en
dc.contributor.editor Schewe, KD en
dc.contributor.editor Zhou, X en
dc.coverage.spatial Toulouse, France en
dc.date.accessioned 2011-12-08T00:26:20Z en
dc.date.issued 2011-08-24 en
dc.identifier.citation DEXA, Toulouse, France, 29 Aug 2011 - 02 Sep 2011. Editors: Hameurlain A, Liddle SW, Schewe KD, Zhou X. Database and Expert Systems Applications - 22nd International Conference. Springer Lecture Notes in Computer Science, Berlin/Heidelberg. 6860: 125-139. 24 Aug 2011 en
dc.identifier.isbn 978-3-642-23087-5 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/2292/9876 en
dc.description.abstract Codd tables are databases that can carry Codd’s null “value unknown at present” in columns that are specified as NULL. Under Levene and Loizou’s possible world semantics we investigate the combined class of uniqueness constraints and functional dependencies over Codd tables. We characterize the implication problem of this class axiomatically, logically and algorithmically. Since the interaction of members in this class is intricate data engineers can benefit from concise sample tables. Therefore, we investigate structural and computational properties of Armstrong tables. These are Codd tables that satisfy the consequences of a given set of elements in our class and violate all those elements that are not consequences. We characterize when a given Codd table is an Armstrong table for any given set of our class. From this result we establish an algorithm that computes an Armstrong table in time that is at most quadratic in the number of rows in a minimum-sized Armstrong table. Data engineers can use our Armstrong tables to judge, justify, convey and test their understanding of the application domain. en
dc.publisher Springer Lecture Notes in Computer Science en
dc.relation.ispartof DEXA en
dc.relation.ispartofseries Database and Expert Systems Applications - 22nd International Conference en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/0302-9743/ en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title Codd table representations under weak possible world semantics en
dc.type Conference Item en
dc.identifier.doi 10.1007/978-3-642-23088-2_9 en
pubs.begin-page 125 en
pubs.volume 6860 en
dc.rights.holder Copyright: Springer Lecture Notes in Computer Science en
pubs.author-url http://dx.doi.org/10.1007/978-3-642-23088-2_9 en
pubs.end-page 139 en
pubs.finish-date 2011-09-02 en
pubs.place-of-publication Berlin/Heidelberg en
pubs.start-date 2011-08-29 en
dc.rights.accessrights http://purl.org/eprint/accessRights/RestrictedAccess en
pubs.subtype Conference Paper en
pubs.elements-id 257374 en
pubs.org-id Science en
pubs.org-id School of Computer Science en
dc.identifier.eissn 1611-3349 en
pubs.record-created-at-source-date 2011-12-08 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse

Statistics