Home // DBKDA 2017, The Ninth International Conference on Advances in Databases, Knowledge, and Data Applications // View article

The Absolute Consistency Problem of Graph Schema Mappings with Uniqueness Constraints

Authors:
Takashi Hayata
Yasunori Ishihara
Toru Fujiwara

Keywords: graph database; property; uniqueness constraint; schema mapping; absolute consistency.

Abstract:
A schema mapping is a formal representation of the correspondence between source and target data in a data exchange setting. Schema mappings have been extensively studied so far in relational and XML databases. However, in graph databases, they have not received much attention yet. A given schema mapping is said to be absolutely consistent if every source data instance has a corresponding target data instance. Absolute consistency is an important property because it guarantees that data exchange never fails for any source data instance. In this paper, we define schema mappings for graph databases with uniqueness constraints. Our graph databases consist of nodes, edges, and properties, where a property is a key-value pair and gives detailed information to nodes. A uniqueness constraint guarantees the uniqueness of specified properties in the whole graph database, and therefore, is useful for realizing the functionality of primary keys in graph databases. Then, in this paper, we propose five classes of graph schema mappings for which absolute consistency is decidable in polynomial time.

Pages: 103 to 110

Copyright: Copyright (c) IARIA, 2017

Publication date: May 21, 2017

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-558-6

Location: Barcelona, Spain

Dates: from May 21, 2017 to May 25, 2017