Simple Schemas for Unordered XML
Document type :
Communication dans un congrès avec actes
Title :
Simple Schemas for Unordered XML
Author(s) :
Boneva, Iovka [Auteur]
Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Ciucanu, Radu [Auteur correspondant]
Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Staworko, Slawomir [Auteur]
Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]

Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Ciucanu, Radu [Auteur correspondant]
Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Staworko, Slawomir [Auteur]
Linking Dynamic Data [LINKS]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Conference title :
16th International Workshop on the Web and Databases (WebDB)
City :
New York
Country :
Etats-Unis d'Amérique
Start date of the conference :
2013-06-23
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-00824459/document
- Open access
- Access the document
- http://arxiv.org/pdf/1303.4277
- Open access
- Access the document
- https://hal.inria.fr/hal-00824459/document
- Open access
- Access the document
- document
- Open access
- Access the document
- ciucanu-webdb13.pdf
- Open access
- Access the document
- 1303.4277
- Open access
- Access the document
- document
- Open access
- Access the document
- ciucanu-webdb13.pdf
- Open access
- Access the document