1,721,033 research outputs found
Validation of Modern JSON Schema: Formalization and Complexity
No full text<p>Artifact evaluation package for the POPL'24 submission <strong>"Validation of Modern JSON Schema: Formalization and Complexity"</strong> by Lyes Attouche, Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani, and Stefanie Scherzinger.</p>
<p>All artifacts (source code, data, scripts) are packaged in a virtual machine running Ubuntu Linux, which can be run using VirtualBox. The README.md file contains the instructions. </p>
Validation of Modern JSON Schema: Formalization and Complexity
No full text<p>Artifact evaluation package for the POPL'24 contribution <strong>"Validation of Modern JSON Schema: Formalization and Complexity"</strong> by Lyes Attouche, Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani, and Stefanie Scherzinger.</p><p>All artifacts (source code, data, scripts) are packaged in a virtual machine running Ubuntu Linux, which can be run using VirtualBox. The README.md file contains the instructions. </p>
Types for Path Correctness of XML Queries
Full text linkIf a subexpression in a query will never contribute data to the query answer, this should be regarded as an error. This principle has been recently accepted into mainstream XML query languages, but was still waiting for a complete treatment. We provide here a precise definition for this class of errors, and define a type system that is sound and complete, in its search for such errors, for a core language, under mild restrictions on the use of recursion in type definitions. In the process, we describe a dichotomy among existential and universal type systems, which is useful to understand some unusual features of our type system.This is the pre-print of the article: Dario Colazzo, Giorgio Ghelli, Paolo Manghi, and Carlo Sartiani. 2004. Types for path correctness of XML queries. In Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (ICFP '04). Association for Computing Machinery, New York, NY, USA, 126–137. https://doi.org/10.1145/1016850.101686
XML Type Projection: A Maximum Flow Approach
No full textIn the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings is crucial. Corruption checking can be automatically performed by relying on an operation called type projection. This work describes an efficient algorithm for checking XML type projection, based on a characterization of type projection in terms of type simulatio
An Efficient Algorithm for XML Type Projection
No full textIn the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings, i.e., mappings that fail in matching the source and/or the target schema, is crucial. Corruption checking can be automatically performed by relying on an operation called type projection. This work describes an efficient algorithm for checking XML type projection, based on a characterization of type projection in terms of type simulation
Efficient Inclusion of Conflict-free XML Types with Interleaving and Counting
No full textInclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleaving and counting can be decided in polynomial time in presence of two important restrictions: no element appears twice in the same content model, and Kleene star is only applied to disjunctions of single elements
Mapping Maintenance in XML P2P Databases
Full text linkUnstructured p2p database systems are usually characterized by the presence of schema mappings among peers. In these systems, the detection of corrupted mappings is a key problem. A corrupted mapping fails in matching the target or the source schema, hence it is not able to transform data conforming to a schema Si into data conforming to a schema Sj, nor it can be used for effective query reformulation. This paper describes a novel technique for maintaining mappings in XML p2p databases, based on a semantic notion of mapping correctness
- …
