2018/04/30 by Iovka Boneva, Jose Martin Lozano Aparicio, Boneva, Iovka +4
Computer Science · #Advanced Database Systems and Queries #Databases (cs.DB) #FOS: Computer and information sciences #Semantic Web and Ontologies #Service-Oriented Architecture and Web Services #cs.DB
paper · pdf · doi:10.48550/arxiv.1804.11052
arxiv created 2018/04/30 · openalex publication_date 2018/04/30 · arxiv updated 2018/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the relational to RDF data exchange problem, where the tar- get constraints are specified using Shape Expression schema (ShEx). We investi- gate two fundamental problems: 1) consistency which is checking for a given data exchange setting whether there always exists a solution for any source instance, and 2) constructing a universal solution which is a solution that represents the space of all solutions. We propose to use typed IRI constructors in source-to- target tuple generating dependencies to create the IRIs of the RDF graph from the values in the relational instance, and we translate ShEx into a set of target dependencies. We also identify data exchange settings that are key covered, a property that is decidable and guarantees consistency. Furthermore, we show that this property is a sufficient and necessary condition for the existence of universal solutions for a practical subclass of weakly-recursive ShEx.