Simple Schemas for Unordered XML

Simple Schemas for Unordered XML

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 characteri...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Boneva, Iovka, Ciucanu, Radu, Staworko, Slawek
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Databases
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Boneva, Iovka
Ciucanu, Radu
Staworko, Slawek
description 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.
doi_str_mv 10.48550/arxiv.1303.4277
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1303_4277</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1303_4277</sourcerecordid><originalsourceid>FETCH-LOGICAL-a657-e32d539a289ccf0f29a821f940ffe9ed68bfdcae27c297dc57868874bc1bc72f3</originalsourceid><addsrcrecordid>eNotzr0KwjAUQOEsDlLdnSQv0JomTZOMIv5BxaEV3Eqa3IsFq5KC6NtL1elsh4-QWcqSTEvJFja82meSCiaSjCs1JrRsu8cVaOku0Nme4j3Q0-0ePATw9HwoJmSE9trD9N-IVJt1tdrFxXG7Xy2L2OZSxSC4l8JYro1zyJAbq3mKJmOIYMDnukHvLHDluFHeSaVzrVXWuLRxiqOIyPy3_QrrR2g7G971IK0HqfgAG_c3sQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Simple Schemas for Unordered XML</title><source>arXiv.org</source><creator>Boneva, Iovka ; Ciucanu, Radu ; Staworko, Slawek</creator><creatorcontrib>Boneva, Iovka ; Ciucanu, Radu ; Staworko, Slawek</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.1303.4277</identifier><language>eng</language><subject>Computer Science - Databases</subject><creationdate>2013-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1303.4277$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1303.4277$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Boneva, Iovka</creatorcontrib><creatorcontrib>Ciucanu, Radu</creatorcontrib><creatorcontrib>Staworko, Slawek</creatorcontrib><title>Simple Schemas for Unordered XML</title><description>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.</description><subject>Computer Science - Databases</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr0KwjAUQOEsDlLdnSQv0JomTZOMIv5BxaEV3Eqa3IsFq5KC6NtL1elsh4-QWcqSTEvJFja82meSCiaSjCs1JrRsu8cVaOku0Nme4j3Q0-0ePATw9HwoJmSE9trD9N-IVJt1tdrFxXG7Xy2L2OZSxSC4l8JYro1zyJAbq3mKJmOIYMDnukHvLHDluFHeSaVzrVXWuLRxiqOIyPy3_QrrR2g7G971IK0HqfgAG_c3sQ</recordid><startdate>20130318</startdate><enddate>20130318</enddate><creator>Boneva, Iovka</creator><creator>Ciucanu, Radu</creator><creator>Staworko, Slawek</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130318</creationdate><title>Simple Schemas for Unordered XML</title><author>Boneva, Iovka ; Ciucanu, Radu ; Staworko, Slawek</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a657-e32d539a289ccf0f29a821f940ffe9ed68bfdcae27c297dc57868874bc1bc72f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Databases</topic><toplevel>online_resources</toplevel><creatorcontrib>Boneva, Iovka</creatorcontrib><creatorcontrib>Ciucanu, Radu</creatorcontrib><creatorcontrib>Staworko, Slawek</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Boneva, Iovka</au><au>Ciucanu, Radu</au><au>Staworko, Slawek</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simple Schemas for Unordered XML</atitle><date>2013-03-18</date><risdate>2013</risdate><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.</abstract><doi>10.48550/arxiv.1303.4277</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1303.4277
ispartof
issn
language eng
recordid cdi_arxiv_primary_1303_4277
source arXiv.org
subjects Computer Science - Databases
title Simple Schemas for Unordered XML
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T23%3A15%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Simple%20Schemas%20for%20Unordered%20XML&rft.au=Boneva,%20Iovka&rft.date=2013-03-18&rft_id=info:doi/10.48550/arxiv.1303.4277&rft_dat=%3Carxiv_GOX%3E1303_4277%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true