Validation of mappings between schemas

Proceedings of the 12th …, 2009

Schema mappings define relationships between schemas in a declarative way. We demonstrate MVT, a mapping validation tool that allows the designer to ask whether the mapping has certain desirable properties. The answers to these questions will provide information on whether the mapping adequately matches the intended needs and requirements. MVT is able to deal with a highly expressive class of mappings and database schemas, which allows the use of negations, order comparisons and null values. The tool does not only provide a Boolean answer as test result, but also a feedback for that result. Depending on the tested property and on the test result, the provided feedback can be in the form of example schema instances, or in the form of an explanation, that is, highlighting the mapping assertions and schema constraints responsible for getting such a result.

PhD Thesis, University of Barcelona, 2011

ADVERTIMENT. La consulta d'aquesta tesi queda condicionada a l'acceptació de les següents condicions d'ús: La difusió d'aquesta tesi per mitjà del servei TDX (www.tdx.cat) ha estat autoritzada pels titulars dels drets de propietat intel·lectual únicament per a usos privats emmarcats en activitats d'investigació i docència. No s'autoritza la seva reproducció amb finalitats de lucre ni la seva difusió i posada a disposició des d'un lloc aliè al servei TDX. No s'autoritza la presentació del seu contingut en una finestra o marc aliè a TDX (framing). Aquesta reserva de drets afecta tant al resum de presentació de la tesi com als seus continguts. En la utilització o cita de parts de la tesi és obligat indicar el nom de la persona autora.

2010

Since the emergence of the Web, the ability to map XML data between different data sources has become crucial. Defining a mapping is however not a fully automatic process. The designer needs to figure out whether the mapping is what was intended. Our approach to this validation consists of defining and checking certain desirable properties of mappings. We translate the XML schemas and the mapping into first-order logic formalism and apply a reasoning mechanism to check the desirable properties automatically, without assuming any particular instantiation of the schemas.

2012

With the emergence of the Web and the wide use of XML for representing data, the ability to map not only flat relational but also nested data has become crucial. The design of schema mappings is a semi-automatic process. A human designer is needed to guide the process, choose among mapping candidates, and successively refine the mapping. The designer needs a way to figure out whether the mapping is what was intended.

2020

Validating RDF data becomes necessary in order to ensure data compliance against the conceptualization model it follows, e.g., schema or ontology behind the data, and improve data consistency and completeness. There are different approaches to validate RDF data, for instance, JSON schema, particularly for data in JSONLD format, as well as Shape Expression and Shapes Constraint Language, which can be used with other serialization as well, e.g., RDF/XML or Turtle. Currently, no validation approach is prevalent regarding others, selection commonly depends on data characteristics, background knowledge and personal preferences . In some cases, the approaches are interchangeable; however, that is not always the case, making it necessary to identify a subset among them that can be seamlessly translated from one to another. During the NBDC/DBCLS 2019 BioHackathon, we worked on a variety of topics related to RDF data validation, including (i) development of ShEx shapes for a number of datase...

2009

R e s u m e n Los tesauros son herramientas conceptuales que representan un óarea de conocimiento. Los estaóndares RDF y SKOS, vinculados a la Web Semaóntica, permiten su representacióon con lenguajes y vocabula­ rios estóandares, lo cual facilita la integracioón de conceptos. A pesar de la importante ventaja que supone disponer de estos estóandares, no es suficiente para garantizar totalmente la integracioón de las herramientas conceptuales utilizadas. Demostramos esta afirmacioón en el caso de los sistemas de informacioón juródica, en los cuales analizamos el uso del te­ sauro Eurovoc y su representacióon con SKOS: propuestas, existencia de herramientas estóandares para tesauros, y dificultades para la integracioón. A partir de este anaólisis se plantean reflexiones sobre el estado de la cuestióon en el momento actual.

2008

This paper addresses the problem of changing the constraints of a mediated schema to accommodate the set of constraints of a new export schema. The relevance of this problem lies in that the constraints of a mediated schema capture the common semantics of the data sources and, as such, they must be maintained and made available to the users of the mediation environment. The paper first argues that such problem can be solved by computing the greatest lower bound of two sets of constraints. Then, for an expressive family of conceptual schemas, it shows how to efficiently decide logical implication and how to compute the greatest lower bound of two sets of constraints.

2011

Lecture Notes in Computer Science, 1990

This paper presents the interim results of a research project aimed at the prototyping of an automatic tool, Rubis, to aid in the development of, validate and correct the conceptual specification of information systems. The Rubis systems allows a designer to specify an information system using the Proquel language and to subsequently execute the specification in order to prototype the design. We present the control rules which enable the diagnosis of the final specification, called an R-Schema, and describe the help available to assist the designer in correcting mistakes and anomalies detected during the diagnosis.

2010

Detta dokument hålls tillgängligt på Internet-eller dess framtida ersättare-från publiceringsdatum under förutsättning att inga extraordinära omständigheter uppstår. Tillgång till dokumentet innebär tillstånd för var och en att läsa, ladda ner, skriva ut enstaka kopior för enskilt bruk och att använda det oförändrat för ickekommersiell forskning och för undervisning. Överföring av upphovsrätten vid en senare tidpunkt kan inte upphäva detta tillstånd. All annan användning av dokumentet kräver upphovsmannens medgivande. För att garantera äktheten, säkerheten och tillgängligheten finns lösningar av teknisk och administrativ art. Upphovsmannens ideella rätt innefattar rätt att bli nämnd som upphovsman i den omfattning som god sed kräver vid användning av dokumentet på ovan be skrivna sätt samt skydd mot att dokumentet ändras eller presenteras i sådan form eller i sådant sammanhang som är kränkande för upphovsmannens litterära eller konstnärliga anseende eller egenart. För ytterligare information om Linköping University Electronic Press se för lagets hemsida http://www.ep.liu.se/ Copyright The publishers will keep this document online on the Internet-or its possible replacement-from the date of publication barring exceptional circumstances. The online availability of the document implies permanent permission for anyone to read, to download, or to print out single copies for his/hers own use and to use it unchanged for non-commercial research and educational purpose. Subsequent transfers of copyright cannot revoke this permission. All other uses of the document are conditional upon the consent of the copyright owner. The publisher has taken technical and administrative measures to assure authenticity, security and accessibility. According to intellectual property law the author has the right to be mentioned when his/her work is accessed as described above and to be protected against infringement.