Makoto Murata
ABSTRACT
Query languages for XML often use path expressions to locate elements in XML documents. Path expressions are regular expressions such that underlying alphabets represent conditions on nodes. Path expressions represent conditions on paths from the root, but do not represent conditions on siblings, siblings of ancestors, and descendants of such siblings. In order to capture such conditions, we propose to extend underlying alphabets. Each symbol in an extended alphabet is a triplet (e1, a, e2), where a is a condition on nodes, and e1 (e2) is a condition on elder (resp. younger) siblings and their descendants; e1 and e2 are represented by hedge regular expressions, which are as expressive as hedge automata (hedges are ordered sequences of trees). Nodes matching such an extended path expression can be located by traversing the XML document twice. Furthermore, given an input schema and a query operation controlled by an extended path expression, it is possible to construct an output schema. This is done by identifying, where in the input schema the given extended path expression is satisfied.
- 1.S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Dataand XML. Morgan Kaufmann, 1999.]] Google Scholar
Digital Library
- 2.S. Abiteboul and V. Vianu. Regular path queries with constraints. In PODS 97, 1997.]] Google ScholarDigital Library
- 3.T. Arnold-Moore, M. Fuller, and R. Sacks-Davis. System architecture of a content management server for XML document applications. Markup Languages, 2(1), 2000.]]Google Scholar
- 4.R. Baeza-Yates and G. Navarro. Integrating contents and structure in text retrieval. SIGMOD Record, 25(1):67-79, Mar. 1996.]] Google ScholarDigital Library
- 5.T. Bray, J. Paoli, and C. M. Sperberg-McQueen. Extensible Markup Language (XML) 1.0. W3C Recommendation. http://www.w3.org/TR/REC-xml, Feburary 1998.]]Google Scholar
- 6.A. Br. uggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages: Theory and Practice, 2(1):81-106, Winter 2000.]]Google ScholarCross Ref
- 7.J. Buchi. Weak second-order arithmetic and finite automata, 1960.]]Google ScholarCross Ref
- 8.P. Buneman,W. Fan, and S. Weinsten. Path constraints on semistructured and structured data. In PODS 98, 1998.]] Google ScholarDigital Library
- 9.J. Clark. TREX - tree regular expressions for XML, 2001. http://www.thaiopensource.com/trex/.]]Google Scholar
- 10.J. Clark and S. DeRose. XML Path Language (XPath) version 1.0. W3C Recommendation. http://www.w3.org/TR/xpath, November 1999.]]Google Scholar
- 11.H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. "Tree Automata Techniques and Applications", 1997. http://www.grappa.univ-lille3.fr/tata.]]Google Scholar
- 12.B. Courcelle. On recognizable sets and tree automata. In M. Nivat and H. A . it-Kaci, editors, Resolution of Equations in Algebraic Structures. Academic Press, 1989.]]Google ScholarCross Ref
- 13.H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, Berlin, 1995.]]Google ScholarCross Ref
- 14.M. Fernandez, J. Simeon, and P. Wadler. XML query languages: Experiences and exemplars. http://wwwdb.research.bell-labs.com/user/simeon/xquery.html.]]Google Scholar
- 15.M. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemas. In ICDE 98, 1998.]] Google ScholarDigital Library
- 16.F. Gecseg and M. Steinby. Tree languages. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, Volume 3, Beyond Words, volume 3, pages 1-68. Springer-Verlag, 1997.]] Google ScholarDigital Library
- 17.H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In POPL 01, 2001.]] Google ScholarDigital Library
- 18.ISO/IEC. Information Technology - Document Description and Processing Languages - Regular Language Description for XML (RELAX) - Part 1: RELAX Core, 2000. DTR 22250-1.]]Google Scholar
- 19.A. Mendelzon and P. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6), 1995.]] Google ScholarDigital Library
- 20.A. R. Meyer. Weak monadic second order theory of successor is Not elementary-recursive. In LOGCOLLOQ: Logic Colloquium, volume 453 of LNM. Springer-Verlag, 1975.]]Google ScholarCross Ref
- 21.T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In PODS 00, 2000.]] Google ScholarDigital Library
- 22.M. Murata. Transformation of documents and schemas by patterns and contextual conditions. In PODP 96, volume 1293 of LNCS. Springer-Verlag, 1997.]] Google ScholarDigital Library
- 23.A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 134-145. Springer-Verlag, 1998.]] Google ScholarDigital Library
- 24.F. Neven. Extension of attribute grammars for structured document queries. In DBPL 99, 1999.]] Google ScholarDigital Library
- 25.F. Neven and J. V. den Bussche. Expressiveness of structured document query languages based on attribute grammars. In PODS 98, pages 11-17, 1998.]] Google ScholarDigital Library
- 26.F. Neven and T. Schwentick. Query automata. In PODS 99, 1999.]] Google ScholarDigital Library
- 27.F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In PODS 00, 2000.]] Google ScholarDigital Library
- 28.M. Nivat and A. Podelski. Another variation on the common subexpression problem. Discrete Mathematics, 114:379-401, 1993.]] Google ScholarDigital Library
- 29.C. Pair and A. Quere. Definition et etude des bilangages reguliers. Information and Control, 13(6):565-593, Dec. 1968.]]Google ScholarCross Ref
- 30.Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In PODS 00, 2000.]] Google ScholarDigital Library
- 31.A. Podelski. A monoid approach to tree automata. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, pages 41-56. North-Holland, 1992.]]Google Scholar
- 32.M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27:1-36, 1975.]]Google ScholarCross Ref
- 33.W. Thomas. Languages, automata and logic. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, Volume 3, Beyond Words, volume 3, pages 389-449. Springer-Verlag, 1997.]] Google ScholarDigital Library
- 34.H. S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. "XML Schema Part 1: Structures", 2001. http://www.w3.org/TR/xmlschema-1/.]]Google Scholar
- 35.P. Wadler. A formal semantics of patterns in XSLT. In Markup Technologies 99, 1999.]]Google Scholar
Index Terms
- Extended path expressions of XML
Recommendations
Filtering XPath expressions for XML access control
XPath is a standard for specifying parts of XML documents and a suitable language for both query processing and access control of XML. In this paper, we use the XPath expression for representing user queries and access control for XML. And we propose an ...
Navigational Path Expressions on XML Schemas
DEXA '08: Proceedings of the 19th international conference on Database and Expert Systems ApplicationsXML Schema is employed for describing the type and structure of information contained in valid XML documents. As for a document, a schema can be navigated and its components can be identified through a path language. In this paper we discuss the ...
Comments