A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Automata for XML—A survey
2007
Journal of computer and system sciences (Print)
Preserved Fulltext
This survey article aims to give an overview of fundamental properties of the different kinds of automata used in this area and to relate them to the four key aspects of XML processing: schemas, navigation ...
, querying and transformation. ...
Extended DTDs offer a robust framework for expressive schema languages, capturing the regular tree languages. ...
doi:10.1016/j.jcss.2006.10.003
fatcat:rhcckietinczlgoglqehlg2gza
A Web odyssey
2003
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road. ...
For example, it is shown that this fragment of MSO can express FO extended with regular path expressions. ...
It turns out that all transformations over unranked trees over a given nite alphabet expressed in existing XML query languages XML-QL, Lorel, StruQL, UnQL, and a fragment of XSLT can be expressed as k-pebble ...
doi:10.1145/776985.776999
fatcat:bnoqb57m4narbanpijq5eeghdi
A Web Odyssey
2001
Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road. ...
For example, it is shown that this fragment of MSO can express FO extended with regular path expressions. ...
It turns out that all transformations over unranked trees over a given nite alphabet expressed in existing XML query languages XML-QL, Lorel, StruQL, UnQL, and a fragment of XSLT can be expressed as k-pebble ...
doi:10.1145/375551.375554
dblp:conf/pods/Vianu01
fatcat:4r527z4hdbelbflp7ijl74edoe
XML: Model, Schemas, Types, Logics, and Queries
[chapter]
2004
Logics for Emerging Applications of Databases
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Regular Expression Types Extending recursive data types of functional programming languages, regular expression types allow us to enlarge the class of types of XML documents. ...
The XML Typechecking Problem Recall that an XML type is a regular tree language τ ⊆ T Σ . The XML validation problem is: we are given a tree t ∈ T Σ and a type τ and we have to decide whether t ∈ τ . ...
doi:10.1007/978-3-642-18690-5_1
fatcat:f5mtevnovffhnpfgdpb7rqlmji
Guarded Program Transformations Using JTL
[chapter]
2008
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
By allowing the transformation target to be a different language than the source (program translation), we show how the language can be employed for tasks like the generation of database schemas or XML ...
The technique is an extension of JTL (Java Tools Language, [12]), which is a high-level abstraction over DATALOG. ...
By convention, transformations in JTL have two components: guards (similar to a "pointcut" in the AOP terminology), which are logical predicates for deciding the applicability of a transformer (similar ...
doi:10.1007/978-3-540-69824-1_7
fatcat:m2zn7bkjjzdmhcycpddutt76fu
Design and Implementation of Highly Modular Schemas for XML: Customization of RuleML in Relax NG
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The original fifteen Derivation RuleML sublanguages are thus embedded in a syntactic lattice with hundreds of thousands of languages with semantics inherited from the top language. ...
As in earlier (Derivation) RuleML language hierarchies, (logical) expressivity forms the backbone of the language lattice. ...
-PSVI Containment: A language L 1 is a PSVI sublanguage of another language L 2 if every valid document in L 1 can be mapped to a valid document in L 2 with the same post-schema-validation infoset. ...
doi:10.1007/978-3-642-24908-2_9
fatcat:7ihlqwys3rgjxlkbzlmgb6pllq
Query Processing in Data Integration
2013
Dagstuhl Publications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The chapter is closed by a very brief discussion of query processing in data integration with XML and ontologies. Definition 4 (Maximal rewriting). ...
The second part of the chapter investigates query processing in the context of semistructured data, which is best described by graph-based data models, where the expressiveness of query languages not common ...
Since RPQs are essentially regular expressions, the presented technique is directly applicable for them, and it is extended to 2RPQs in [20] using two-way automata to deal with inverse. ...
doi:10.4230/dfu.vol5.10452.129
dblp:conf/dagstuhl/GuagliardoW13
fatcat:2bqbnhu3wbe3rcvsck6aqzr3em
XStruct: Efficient Schema Extraction from Multiple and Large XML Documents
2006
22nd International Conference on Data Engineering Workshops (ICDEW'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
While it is fairly simple to generate XML data, it is a complex task to design a schema and then guarantee that the generated data is valid according to that schema. ...
Based on ideas of [5] , XStruct extracts a schema for XML data by applying several heuristics to deduce regular expressions that are 1-unambiguous and describe each element's contents correctly but generalized ...
[4] for their XTRACT schema extraction application is used to merge the inferred regular expressions for all elements of one type into a single regular expression. ...
doi:10.1109/icdew.2006.166
dblp:conf/icde/HegewaldNW06
fatcat:dlzs3og2xzehrebwqawecezd5a
Using the uni-level description (ULD) to support data-model interoperability
2006
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The ULD extends previous metadata-model approaches by: (a) providing uniform representation and access to data model, schema, and data, and (b) supporting data models with non-traditional schema arrangements ...
Because the ULD is a flat, first-order representation, we show how Datalog over the ULD can provide a flexible mechanism to query, extract, and transform information from data sources that exhibit various ...
Although not shown here, the XML description can be extended (e.g., see [17] ) to include richer content models including the various DTD regular-expression constraints. ...
doi:10.1016/j.datak.2005.10.007
fatcat:ty7koct5yrgrtlej4k6mx4lpzu
Four Lessons in Versatility or How Query Languages Adapt to the Web
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
With Xcerpt we have developed a rule-and pattern based query language that aims to give shield application builders from much of this complexity: In a single query language XML and RDF data can be accessed ...
This fracturing stifles innovation as application builders have to cope not only with one Web stack (e.g., XML technology) but with several ones, each of considerable complexity. ...
SPARQLeR A different approach for extending SPARQL with regular path expressions is taken by the language SPARQLeR described in [103] . ...
doi:10.1007/978-3-642-04581-3_2
fatcat:tyjxlcot7bgztckkzfw6vqq24m
Regular rewriting of active XML and unambiguity
2005
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The results may be extended to (A)XML trees in a straightforward manner. ...
Indeed, we study what we believe to be a more adequate, from a practical view point, rewriting problem that is (1) in the spirit of standard 1-unambiguity constraints imposed on XML schema and (2) can ...
These are similar to restrictions imposed, in standard XML, to ensure efficient document validation on XML schemas [18] . ...
doi:10.1145/1065167.1065204
dblp:conf/pods/AbiteboulMB05
fatcat:dcfk66meuveb5f457i2z4euxia
Efficient inclusion checking for deterministic tree automata and XML Schemas
2009
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(|A| · | | · |D|). ...
We present algorithms for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| · |B|) where B is deterministic (bottom-up or top-down). ...
We thank the anonymous reviewers for their valuable suggestions, which helped us a lot in order to simplify the presentation of the tedious counting arguments in the core of our algorithm and proofs. ...
doi:10.1016/j.ic.2009.03.003
fatcat:bkuqrxuctvhltjbqwlbbydm7cu
The Query Translation Landscape: a Survey
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On the other hand, many query languages have been designed to enable users to interact with the data, from relational, to object-oriented, to hierarchical, to the multitude emerging NoSQL languages. ...
Both industry and research communities have been keen to develop such techniques, which require the translation of a chosen 'universal' query language to the various data model specific query languages ...
With less regularity, works translating to and from XML languages have also been continually published. ...
arXiv:1910.03118v1
fatcat:wsww5vhlwjhqjlouibetb6mo3a
Logics for Unranked Trees: An Overview
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. ...
Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence ...
Acknowledgement I am grateful to Cristiana Chitic, Christoph Koch, Maarten Marx, Frank Neven, Joachim Niehren, Gerald Penn, Thomas Schwentick, Luc Segoufin, Anthony Widjaja To, and the referees for their ...
doi:10.1007/11523468_4
fatcat:7rcqqszwefaurpnvx4pkvbqusq
Logics for Unranked Trees: An Overview
2006
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. ...
Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence ...
Acknowledgement I am grateful to Cristiana Chitic, Christoph Koch, Maarten Marx, Frank Neven, Joachim Niehren, Gerald Penn, Thomas Schwentick, Luc Segoufin, Anthony Widjaja To, and the referees for their ...
doi:10.2168/lmcs-2(3:2)2006
fatcat:fog3giovtjbptikxl3manissga
« Previous
Showing results 1 — 15 out of 329 results