Skip to Main content Skip to Navigation
Conference papers

Simple Schemas for Unordered XML

Iovka Boneva 1, 2 Radu Ciucanu 1, 2, * Slawomir Staworko 1, 2
* Corresponding author
2 LINKS - Linking Dynamic Data
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and its restriction, disjunction-free multiplicity schemas (MS). We investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership of a tree to the language of a schema, schema containment, twig query satisfiability, implication, and containment in the presence of schema. Our research indicates that the proposed formalisms retain much of the expressiveness of DTDs without an increase in computational complexity.
Document type :
Conference papers
Complete list of metadata
Contributor : Radu Ciucanu Connect in order to contact the contributor
Submitted on : Thursday, May 7, 2015 - 5:02:56 PM
Last modification on : Monday, April 20, 2020 - 4:14:06 PM
Long-term archiving on: : Wednesday, April 19, 2017 - 7:34:50 PM


Files produced by the author(s)


  • HAL Id : hal-00824459, version 1
  • ARXIV : 1303.4277


Iovka Boneva, Radu Ciucanu, Slawomir Staworko. Simple Schemas for Unordered XML. 16th International Workshop on the Web and Databases (WebDB), Jun 2013, New York, United States. ⟨hal-00824459⟩



Les métriques sont temporairement indisponibles