How to tackle schema validation by view updating

Decker, Hendrik; Teniente, Ernest; Urpí, Toni

doi:10.1007/bfb0014177

Cited by 15 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main difference is that a schema embedding maps each source instance into a unique target instance, while a query equality in its general form maps a single source instance into a set of target instances. That is because although the extension for Q source determines the extension of Q target , there may be more than one target instance in which Q target has this extension, which is the well-known view updating problem [DTU96].…”

Section: Instance-based Approachesmentioning

confidence: 99%

Validation of mappings between data schemas

Rull Fort

View full text Add to dashboard Cite

En esta tesis, presentamos un nuevo enfoque para validar mappings entre esquemas de datos que permite al diseñador comprobar si el mapping satisface o no ciertas propiedades deseables. La respuesta que obtiene el diseñador no se limita a un simple valor booleano, sino que dependiendo del resultado de la comprobación obtendrá un ejemplo/contraejemplo que ilustre ese resultado, o bien se le indicará el conjunto de restricciones de integridad de los esquemas y formulas del mapping responsables de ese resultado. Una de las características principales de nuestro enfoque es que es capaz de tratar una clase muy expresiva de mappings y esquemas relacionales. En particular, nuestro enfoque es capaz de tratar con formulas de mapping consistentes en inclusiones y igualdades de consultas, además de permitir el uso de negaciones y comparaciones aritméticas tanto en las propias formulas del mapping como en las vistas definidas en los esquemas. Nuestro enfoque también permite tratar restricciones de integridad, las cuales pueden estar definidas no solo sobre las tablas sino también sobre las vistas de los esquemas. Dado que razonar sobre este tipo de mappings y esquemas es, desafortunadamente, indecidible, proponemos realizar un test de terminación previo a la validación del mapping. Si el test de terminación da una respuesta positiva, entonces podremos estar seguros de que la posterior comprobación de la propiedad deseable correspondiente terminará. Finalmente, también extendemos nuestro enfoque más allá del caso relacional y lo aplicamos al contexto de mappings entre esquemas XML. In this thesis, we present a new approach to the validation of mappings between data schemas. It allows the designer to check whether the mapping satisfies certain desirable properties. The feedback that our approach provides to the designer is not only a Boolean answer, but either a (counter)example for the (un)satisfiability of the tested property, or the set of mapping assertions and schema constraints that are responsible for that (un)satisfiability. One of the main characteristics of our approach is that it is able to deal with a very expressive class of relational mapping scenarios; in particular, it is able to deal with mapping assertions in the form of query inclusions and query equalities, and it allows the use of negation and arithmetic comparisons in both the mapping assertions and the views of the schemas; it also allows for integrity constraints, which can be defined not only over the base relations but also in terms of the views. Since reasoning on the class of mapping scenarios that we consider is, unfortunately, undecidable, we propose to perform a termination test as a pre-validation step. If the answer of the test is positive, then checking the corresponding desirable property will terminate. We also go beyond the relational setting and study the application of our approach to the context of mappings between XML schemas.

show abstract

Section: Instance-based Approachesmentioning

confidence: 99%

Validation of mappings between data schemas

Rull Fort

View full text Add to dashboard Cite

show abstract

“…On the one hand, some methods like (Console, Sapino et al 1995;Lobo and Trajcevski 1997) can only handle restricted types of integrity constraints which do not cover the kind of constraints we obtain as a result of the translation of the conceptual schema into logic. On the other hand, most methods do not provide an appropriate treatment to the existential variables that appear in the integrity constraint definition (Ceri, Fraternali et al 1994;Decker, Teniente et al 1996;Mayol and Teniente 2003;Schewe and Thalheim 1999). The general approach of these methods when instantiating an existential variable is either asking for a value from the user at run-time or assigning an arbitrarily chosen value of the corresponding data type.…”

Section: Reasoning On the Schemamentioning

confidence: 99%

Validation of UML conceptual schemas with OCL constraints and operations

Queralt Calafat

View full text Add to dashboard Cite

Per tal de garantir la qualitat final d'un sistema d'informació, és imprescindible que l'esquema conceptual que representa el coneixement sobre el seu domini i les funcions que ha de realitzar sigui semànticament correcte. La correctesa d'un esquema conceptual es pot veure des de dues perspectives. Per una banda, des del punt de vista de la seva definició, determinar la correctesa d'un esquema conceptual consisteix en respondre la pregunta "És correcte l'esquema conceptual?". Aquesta pregunta es pot respondre determinant si l'esquema satisfà certes propietats, com satisfactibilitat, no redundància o executabilitat de les seves operacions. D'altra banda, des de la perspectiva dels requisits que el sistema d'informació ha de satisfer, l'esquema conceptual no només ha de ser correcte sinó que també ha de ser el correcte. Per tal d'assegurar-ho, el dissenyador necessita algun tipus de guia i ajut durant el procés de validació, de manera que pugui entendre què està representant l'esquema exactament i veure si es correspon amb els requisits que s'han de formalitzar. En aquesta tesi presentem una aproximació que millora els resultats de les propostes anteriors adreçades a validar un esquema conceptual en UML, amb les restriccions i operacions formalitzades en OCL. La nostra aproximació permet validar un esquema conceptual tant des del punt de vista de la seva definició com de la seva correspondència amb els requisits. La validació es porta a terme mitjançant un conjunt de proves que s'apliquen a l'esquema, algunes de les quals es generen automàticament mentre que d'altres són definides ad-hoc pel dissenyador. Totes les proves estan formalitzades de tal manera que es poden tractar d'una manera uniforme,independentment de la propietat específica que determinen. La nostra proposta es pot aplicar tant a un esquema conceptual complet com només a la seva part estructural. Quan es pretén validar només la part estructural d'un esquema, oferim un conjunt de condicions que permeten determinar si qualsevol prova de validació que es pugui fer sobre l'esquema acabarà en temps finit. Per aquells casos en els quals aquestes condicions de terminació se satisfan, també proposem un procediment de raonament sobre l'esquema que s'aprofita d'aquest fet i és més eficient que en el cas general. Aquesta aproximació permet validar esquemes conceptuals molt expressius, assegurant completesa i decidibilitat al mateix temps. Per provar la factibilitat de la nostra aproximació, hem implementat el procés de validació complet per a la part estructural d'un esquema. A més, per a la validació d'un esquema conceptual que inclou la definició del comportament, hem implementat el procediment de raonament estenent un mètode existent. To ensure the quality of an information system, it is essential that the conceptual schema that represents the knowledge about its domain and the functions it has to perform is semantically correct. The correctness of a conceptual schema can be seen from two different perspectives. On the one hand, from the point of view of its definition, determining the correctness of a conceptual schema consists in answering to the question "Is the conceptual schema right?". This can be achieved by determining whether the schema fulfills certain properties, such as satisfiability, non-redundancy or operation executability. On the other hand, from the perspective of the requirements that the information system should satisfy, not only the conceptual schema must be right, but it also must be the right one. To ensure this, the designer must be provided with some kind of help and guidance during the validation process, so that he is able to understand the exact meaning of the schema and see whether it corresponds to the requirements to be formalized. In this thesis we provide an approach which improves the results of previous proposals that address the validation of a UML conceptual schema, with its constraints and operations formalized in OCL. Our approach allows to validate the conceptual schema both from the point of view of its definition and of its correspondence to the requirements. The validation is performed by means of a set of tests that are applied to the schema, including automatically generated tests and ad-hoc tests defined by the designer. All the validation tests are formalized in such a way that they can be treated uniformly, regardless the specific property they allow to test. Our approach can be either applied to a complete conceptual schema or only to its structural part. In case that only the structural part is validated, we provide a set of conditions to determine whether any validation test performed on the schema will terminate. For those cases in which these conditions of termination are satisfied, we also provide a reasoning procedure that takes advantage of this situation and works more efficiently than in the general case. This approach allows the validation of very expressive schemas and ensures completeness and decidability at the same time. To show the feasibility of our approach, we have implemented the complete validation process for the structural part of a conceptual schema. Additionally, for the validation of a conceptual schema with a behavioral part, the reasoning procedure has been implemented as an extension of an existing method.

show abstract