Boris Chidlovskii. Using Regular Tree Automata as XML Schemas. In Proceedings of IEEE Advances in Digital Libraries 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and an alphabet Sigma for a DTD D, we can construct a regular tree grammar (RTG) G such that the set of trees generated by the grammar is precisely the set of trees that satisfy Q. The result then follows from the facts that DTDs are a special case of RTGs, that RTGs are closed under intersection [6], and that containment is decidable (and exptime complete) for RTGs [4, 12, 13] This same result is proved independently in [10] The definition of regular tree grammars we use is similar to that in [6] A regular tree grammar (RTG) G is a 4 tuple h Sigma ; N;P; n 0 i, where 1. Sigma is a ....

.... from the facts that DTDs are a special case of RTGs, that RTGs are closed under intersection [6] and that containment is decidable (and exptime complete) for RTGs [4, 12, 13] This same result is proved independently in [10] The definition of regular tree grammars we use is similar to that in [6]. A regular tree grammar (RTG) G is a 4 tuple h Sigma ; N;P; n 0 i, where 1. Sigma is a finite set of element names, 2. N is a finite set of nonterminals, 3. P is a finite set of productions of the form n a(R) where n 2 N , a 2 Sigma , and R is a regular expression over N , 4. n 0 2 N is ....

B. Chidlovskii. Using regular tree automata as XML schemas. In Proc. IEEE Advances in Digital Libraries, pages 89--104, 2000.

.... extended context free grammars in which the right hand sides of productions are unambiguous regular expressions [7] To address some of the problems posed by XML DTDs, regular tree automata (RTA) or, equivalently, forest regular grammars (FRG) have been recently proposed for use as XML schemata[12, 18]; RTA based schemata are more powerful Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full ....

....and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and or a fee. JCDL 2000 Roanoke, Virginia USA Copyright 2001 ACM 0 89791 88 6 97 05 . 5.00. than usual XML DTD. For example, XML queries [12] are more easily implemented, optimized and pruned in terms of RTA based schemata. In particular, RTA based schemata allow the implementation of context sensitive content models [18] which allow an element to have di erent behaviors depending on its placement in the document structure, i.e. ....

[Article contains additional citation context not shown here]

B. Chidlovskii. Using regular tree automata as XML schemas. In J. Hoppenbrouwers, T. de Souza Lima, M. Papazoglou, and A. Sheth, editors, Proc. IEEE Advances on Digital Libraries Conference

....XML. In [17] the author proposes an XML data model based on lists. Queries are transformed into an algebraic form called OPAL (Ordered List processing Algebra) and are processed by iterating over lists. The author describes how Finite State Automata can be used to process and optimize queries. In [18] the author introduces an XML query algebra based on a tree automata model. A new data model named XOM is proposed in [19] which is based on a rooted connected directed graph both cyclic and acyclic, whose nodes are labeled and edges are ranked. A new algebra called XOM Algebra, which includes six ....

Boris Chidlovskii. Using Regular Tree Automata as XML Schemas. In Proceedings of the IEEE Advances in Digital Libraries 2000 (ADL 2000).

No context found.

Boris Chidlovskii. Using Regular Tree Automata as XML Schemas. In Proceedings of IEEE Advances in Digital Libraries 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC