A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Filters
Using regular tree automata as XML schemas
Proceedings IEEE Advances in Digital Libraries 2000
Preserved Fulltext
We address the problem of tight XML schemas and propose regular tree automata to model XML data. ...
Finally, we show the conversion of tree automata schema into XML DTDs. 0-7695-0659-3/00 $10.00 ã 2000 IEEE ...
Conclusion We study the use of tree automata as schemas for XML files. ...
doi:10.1109/adl.2000.848373
dblp:conf/adl/Chidlovskii00
fatcat:qiemczy53jesxocgbnnootdxay
Answering XML Twig Queries with Automata
[chapter]
2004
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.
In this paper, a novel approach is proposed to compute twig queries with matching twig query automata and path schema trees. ...
XML is emerging as a de facto standard for information representation and data exchange over the web. ...
Some XML stream processing systems use automata to represent user profiles such as XFilter [2] and YFilter [7] , and use a SAX interfaced parser to parse XML documents and activate automata. ...
doi:10.1007/978-3-540-24655-8_18
fatcat:43ujt67tkrhhzoclmeeroshidq
Taxonomy of XML schema languages using formal language theory
2005
ACM Transactions on Internet Technology
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 2005; you can also visit the original URL.
The file type is application/pdf.
Makoto Murata, Dongwon Lee and Murali Mani • Taxonomy of XML Schema Languages using Formal Language Theory Extreme Markup Languages 2000 3 Tree Grammars In this section, as a mechanism for describing permissible ...
XML-Schema Formal Description (formerly called MSL [BFRW01] ) is a mathematical model of XML-Schema. However, it is tailored for XML-Schema and is thus unable to capture other schema languages. ...
Since Kilho Shin advocated use of tree automata for structured documents in 1992, many researchers have used regular tree grammars or tree automata for XML (see OASIS [OA01] and Vianu [VV01] ). ...
doi:10.1145/1111627.1111631
fatcat:np3lygcjzvdehldu5bultfctlq
Automata for XML—A survey
2007
Journal of computer and system sciences (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 2019; you can also visit the original URL.
The file type is application/pdf.
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 ...
Automata play an important role for the theoretical foundations of XML data management, but also in tools for various XML processing tasks. ...
Regular tree languages as a framework for XML schema languages have also been considered in [28, 97] . ...
doi:10.1016/j.jcss.2006.10.003
fatcat:rhcckietinczlgoglqehlg2gza
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.
The details of how constructions lead to minimal automata are provided in [15] . τ i ≈ L τ i , 1 ≤ i ≤ k
Uses of Tree Automata With tree languages essentially behaving as nicely as conventional regular ...
Thus, the investigation of tree automata and grammars holds considerable promise. Regular Tree Languages and XML types A regular tree language L ⊆ T Σ can be thought of as an XML type. ...
doi:10.1007/978-3-642-18690-5_1
fatcat:f5mtevnovffhnpfgdpb7rqlmji
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
2009
SIAM journal on computing (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 2017; you can also visit the original URL.
The file type is application/pdf.
Example: a [3..5] b + (cd) [0,10] Additional operator in XML Schema (minoccurs and maxoccurs). Properties Defines only regular languages. Every numerical occurrence predicate can be unfolded. ...
Is exponentially succinct with regard to standard regular expressions because integers are encoded in binary. Example a [0..2 n ] = a? · · · a? ...
EDTDs are equivalent to regular unranked tree automata.
W. ...
doi:10.1137/070697367
fatcat:ciqgixqeebfw7kpwuatltsc3oi
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
[chapter]
2006
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.
Example: a [3..5] b + (cd) [0,10] Additional operator in XML Schema (minoccurs and maxoccurs). Properties Defines only regular languages. Every numerical occurrence predicate can be unfolded. ...
Is exponentially succinct with regard to standard regular expressions because integers are encoded in binary. Example a [0..2 n ] = a? · · · a? ...
EDTDs are equivalent to regular unranked tree automata.
W. ...
doi:10.1007/11965893_19
fatcat:gynnid2z4nhxbo33wv23ojsp7e
XML Schema Containment Checking Based on Semi-implicit Techniques
[chapter]
2003
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.
Since XML schemas are related to the class of tree regular languages, their containment checking is reduced to the language containment problem for non-deterministic tree automata (NTAs). ...
We used semi-implicit encoding which encodes a set of subsets of states as a BDD, rather than encoding a set of states by it. ...
In implementation, we used Hosoya et al's algorithm that converts XML schemas into tree automata. Example 1. ...
doi:10.1007/3-540-45089-0_20
fatcat:uriajunwajf3fctoktvbuqrzyu
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.
We next discuss a powerful, e ective tool for dealing with such questions: a remarkable connection between schemas and tree automata. XML schemas, tree automata, and logic. ...
Automata theory has emerged as a powerful tool for understanding XML schema and query languages. ...
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.
We next discuss a powerful, e ective tool for dealing with such questions: a remarkable connection between schemas and tree automata. XML schemas, tree automata, and logic. ...
Automata theory has emerged as a powerful tool for understanding XML schema and query languages. ...
doi:10.1145/375551.375554
dblp:conf/pods/Vianu01
fatcat:4r527z4hdbelbflp7ijl74edoe
Efficient Schema-Based Revalidation of XML
[chapter]
2004
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 2004; you can also visit the original URL.
The file type is application/pdf.
As XML schemas evolve over time or as applications are integrated, it is sometimes necessary to validate an XML document known to conform to one schema with respect to another schema. ...
In this paper, we describe how knowledge of conformance to an XML Schema (or DTD) may be used to determine conformance to another XML Schema (or DTD) efficiently. ...
XML Schemas are not as powerful as regular tree automata. The XML Schema specification places restrictions on the decoupling of element tags and types. ...
doi:10.1007/978-3-540-24741-8_37
fatcat:4ov33okggffepfsgmwkehyahpy
XML access control using static analysis
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
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.
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access control policies. ...
schema but hidden by the access control policy. ...
We do not use particular schema languages in this paper, but rather use tree regular grammars [9] as a formal model of schemas. Murata et al. ...
doi:10.1145/948121.948122
fatcat:ifqx53vv55eptk3gwymk4i7tn4
XML access control using static analysis
2006
ACM Transactions on Privacy and Security
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.
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access control policies. ...
schema but hidden by the access control policy. ...
We do not use particular schema languages in this paper, but rather use tree regular grammars [9] as a formal model of schemas. Murata et al. ...
doi:10.1145/1178618.1178621
fatcat:wtjosayjgreunov7cynu54axcq
Automata theory for XML researchers
2002
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.
a new paradigm: unranked tree automata use regular string languages to deal with unrankedness. ...
As the structure of XML documents can be adequately represented by unranked trees, unranked tree automata can serve XML research in four different ways: (i) as a basis of schema languages [10, 12, 13, ...
S c h e m a s Like extended context-free grammars form abstractions of DTDs, unranked tree automata are an abstraction of the various XML schema proposals. Here, w? denotes w + e. ...
doi:10.1145/601858.601869
fatcat:5eaun2gnrrg7jnujfpevj6usde
XML access control using static analysis
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
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.
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access control policies. ...
schema but hidden by the access control policy. ...
We do not use particular schema languages in this paper, but rather use tree regular grammars [9] as a formal model of schemas. Murata et al. ...
doi:10.1145/948109.948122
dblp:conf/ccs/MurataTKH03
fatcat:nq6y5djdsje3vgquu55sep6ju4
« Previous
Showing results 1 — 15 out of 1,207 results