Independence in Database Relations

ResearchSpace/Manakin Repository

Show simple item record Kontinen, J en Link, S en Väänänen, J en 2014-01-05T22:48:17Z en 2014-01-05T22:48:17Z en 2013 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-450 (2013) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract We investigate the implication problem for independence atoms X?Y of dis- joint attribute sets X and Y on database schemata. A relation satisfi es X?Y if for every X-value and every Y -value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y -value. We establish an axiomatization by a finite set of Horn rules, and derive an algorithm for deciding the implication problem in low-degree polynomial time in the input. We show how to construct Armstrong relations which satisfy an arbitrarily given set of independence atoms and violate every independence atom not implied by the given set. Our results establish independence atoms as an e fficient subclass of embedded multivalued data dependencies which are not axiomatizable by a finite set of Horn rules, and whose implication problem is undecidable. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series 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. en
dc.rights.uri en
dc.source.uri en
dc.title Independence in Database Relations en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Full text options

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace

Advanced Search