Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14382
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GELADE, Wouter | - |
dc.contributor.author | NEVEN, Frank | - |
dc.date.accessioned | 2012-11-16T12:05:43Z | - |
dc.date.available | 2012-11-16T12:05:43Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 77 (3), p. 505-519 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/1942/14382 | - |
dc.description.abstract | Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules of the form (r, s) where r and s are regular expressions and can be seen as a type-free extension of DTDs with vertical regular expressions. Sets of such rules can be interpreted both in an existential or universal way. In the present paper, we study the succinctness of both semantics w.r.t. each other and w.r.t. the common abstraction of XSDs in terms of single-type extended DTDs. The investigation is carried out relative to three kinds of vertical pattern languages: regular, linear, and strongly linear patterns. We also consider the complexity of the simplification problem for each of the considered pattern-based schemas. (C) 2010 Elsevier Inc. All rights reserved. | - |
dc.language.iso | en | - |
dc.title | Succinctness of pattern-based schema languages for XML | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencedate | SEP 23-24, 2007 | - |
local.bibliographicCitation.conferencename | 11th International Symposium on Database Programming Languages | - |
local.bibliographicCitation.conferenceplace | Vienna, AUSTRIA | - |
dc.identifier.epage | 519 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 505 | - |
dc.identifier.volume | 77 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Reprint Address: Gelade, W (reprint author), Hasselt Univ, Hasselt, Belgium. Addresses: 1. Hasselt Univ, Hasselt, Belgium 2. Transnat Univ Limburg, Sch Informat Technol, Hasselt, Belgium | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1016/j.jcss.2010.04.008 | - |
dc.identifier.isi | 000288474800005 | - |
item.fulltext | With Fulltext | - |
item.contributor | GELADE, Wouter | - |
item.contributor | NEVEN, Frank | - |
item.accessRights | Open Access | - |
item.validation | ecoom 2012 | - |
item.fullcitation | GELADE, Wouter & NEVEN, Frank (2011) Succinctness of pattern-based schema languages for XML. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 77 (3), p. 505-519. | - |
crisitem.journal.issn | 0022-0000 | - |
crisitem.journal.eissn | 1090-2724 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
journal.pdf | 300.5 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
8
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
8
checked on Apr 22, 2024
Page view(s)
100
checked on May 30, 2023
Download(s)
220
checked on May 30, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.