Uniqueness Constraints on Property Graphs

Show simple item record

dc.contributor.author Skavantzos, Philipp
dc.contributor.author Zhao, Kaiqi
dc.contributor.author Link, Sebastian
dc.contributor.editor LaRosa, M
dc.contributor.editor Sadiq, S
dc.contributor.editor Teniente, E
dc.coverage.spatial ELECTR NETWORK
dc.date.accessioned 2022-10-09T22:22:20Z
dc.date.available 2022-10-09T22:22:20Z
dc.date.issued 2021-06-24
dc.identifier.citation (2021). Lecture notes in computer science, 12751, 280-295.
dc.identifier.isbn 9783030793814
dc.identifier.issn 0302-9743
dc.identifier.uri https://hdl.handle.net/2292/61545
dc.description.abstract Graph database are increasingly popular for data management and analytics. As with every data model, managing the integrity of entities is fundamental for data governance but also important for the efficiency of update and query operations. In response to shortcomings of uniqueness and existence constraints in graph databases, we propose a new principled class of constraints that separates uniqueness from existence dimensions, and fully supports multiple labels and composite properties. We illustrate benefits of the constraints on real-world examples by use of the node integrity they enforce for better update and query performance. We establish axiomatic and algorithmic characterizations for reasoning about any set of constraints in our new class. We also give examples of small node samples that satisfy the same constraints as the original data set, and are useful for the elicitation of business rules, and the identification of data quality problems. Finally, we briefly discuss the role of our constraints in the design for data quality, and propose extensions to managing node integrity within graph database systems.
dc.publisher Springer Nature
dc.relation.ispartof 33rd International Conference on Advanced Information Systems Engineering (CAiSE)
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.
dc.rights This version of the contribution has been accepted for publication, after peer review (when applicable) but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://doi.org/10.1007/978-3-030-79382-1_17 Use of this Accepted Version is subject to the publisher’s Accepted Manuscript terms of use https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
dc.rights.uri https://www.springer.com/gp/computer-science/lncs/editor-guidelines-for-springer-proceedings
dc.subject Science & Technology
dc.subject Technology
dc.subject Computer Science, Artificial Intelligence
dc.subject Computer Science, Information Systems
dc.subject Computer Science, Interdisciplinary Applications
dc.subject Computer Science, Theory & Methods
dc.subject Computer Science
dc.subject Existence constraint
dc.subject Property graph
dc.subject Reasoning
dc.subject Uniqueness constraint
dc.title Uniqueness Constraints on Property Graphs
dc.type Conference Item
dc.identifier.doi 10.1007/978-3-030-79382-1_17
pubs.begin-page 280
pubs.volume 12751
dc.date.updated 2022-09-28T19:32:04Z
dc.rights.holder Copyright: Springer Nature Switzerland AG en
pubs.author-url http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000716947800017&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e41486220adb198d0efde5a3b153e7d
pubs.end-page 295
pubs.finish-date 2021-07-02
pubs.publication-status Published
pubs.start-date 2021-06-28
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.elements-id 863003
pubs.org-id Science
pubs.org-id School of Computer Science
dc.identifier.eissn 1611-3349
pubs.record-created-at-source-date 2022-09-29
pubs.online-publication-date 2021-06-24

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace