Possibilistic cardinality constraints and functional dependencies

ResearchSpace Repository

Show simple item record

dc.contributor.author Roblot, Tania en
dc.contributor.author Link, Sebastian en
dc.coverage.spatial Gifu, Japan en
dc.date.accessioned 2017-05-31T01:35:15Z en
dc.date.issued 2016 en
dc.identifier.citation International Conference on Conceptual Modeling: ER 2016, Gifu, Japan, 14 Nov 2016 - 16 Nov 2016. Lecture Notes in Computer Science: Conceptual Modeling. Springer Verlag. 9974: 133-148. 2016 en
dc.identifier.isbn 9783319463964 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/2292/33186 en
dc.description.abstract Cardinality constraints and functional dependencies together can express many semantic properties for applications in which data is certain. However, modern applications need to process large volumes of uncertain data. So far, cardinality constraints and functional dependencies have only been studied in isolation over uncertain data. We investigate the more challenging real-world case in which both types of constraints co-occur. While more expressive constraints could easily be defined, they would not enjoy the computational properties we show to hold for our combined class. Indeed, we characterize the associated implication problem axiomatically and algorithmically in linear input time. We also show how to summarize any given set of our constraints as an Armstrong instance. These instances help data analysts consolidate meaningful degrees of certainty by which our constraints hold in the underlying application domain. en
dc.publisher Springer Verlag en
dc.relation.ispartof International Conference on Conceptual Modeling: ER 2016 en
dc.relation.ispartofseries Lecture Notes in Computer Science: Conceptual Modeling 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 Possibilistic cardinality constraints and functional dependencies en
dc.type Conference Item en
dc.identifier.doi 10.1007/978-3-319-46397-1_11 en
pubs.begin-page 133 en
pubs.volume 9974 en
dc.description.version AM - Accepted Manuscript en
dc.rights.holder Copyright: Springer Verlag en
pubs.end-page 148 en
pubs.finish-date 2016-11-16 en
pubs.publication-status Published en
pubs.start-date 2016-11-14 en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.subtype Proceedings en
pubs.elements-id 552118 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 2017-05-31 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