Abstract
Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we associate a word automaton; these automata run on the graph of dependency between the non-terminals of the straightline regular tree grammar associated to the given dag, or along complete sibling chains in this grammar. Any given Core XPath query can be decomposed into queries of the basic type, and the answer to the query, on the dag t, can then be expressed as a sub-dag of t suitably labeled under the runs of such automata.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Ed. Morgan Kaufmann Proc. of the 29th Conf. on VLDB, pp. 141–152 (2003)
Busatto, G., Lohrey, M., Maneth, S.: Grammar-Based Tree Compression. EPFL Technical Report IC/2004/80, http://icwww.epfl.ch/publications
Busatto, G., Lohrey, M., Maneth, S.: Efficient Memory Representation of XML Documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 199–216. Springer, Heidelberg (2005)
Fila, B., Anantharaman, S.: Automata for Analyzing and Querying Compressed Documents, Research Report, RR-2006-03, LIFO (2006), http://www.univ-orleans.fr/lifo/prodsci/rapports/RR/RR2006/
Frick, M., Grohe, M., Koch, C.: Query Evaluation of Compressed Trees. In: Proc. of LICS 2003, pp. 188–197. IEEE, Los Alamitos (2003)
Gottlob, G., Koch, C.: Monadic Queries over Tree-Structured Data. In: Proc. of LICS 2002, pp. 189–202. IEEE, Los Alamitos (2002)
Gottlob, G., Koch, C., Pichler, R., Segoufin, L.: The complexity of XPath query evaluation and XML typing. Journal of the ACM 52(2), 284–335 (2005)
Lohrey, M.: Word problems and membership problems on compressed words. SIAM Journal of Computing 35(5), 1210–1240 (2006)
Marx, M.: XPath and Modal Logics for Finite DAGs. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS (LNAI), vol. 2796, pp. 150–164. Springer, Heidelberg (2003)
Martens, W., Neven, F.: On the complexity of typechecking top-down XML transformations. Theoretical Computer Science 336(1), 153–180 (2005)
Neven, F.: Automata Theory for XML Researchers. SIGMOD Record 31(3) (September 2002)
Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science 275(1–2), 633–674 (2002)
Rytter, W.: Compressed and fully compressed pattern matching in one and two dimensions. Proceedings of the IEEE 88(11), 1769–1778 (2000)
World Wide Web Consortium, XML Path Language (XPath Recommendation), http://www.w3c.org/TR/xpath/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fila, B., Anantharaman, S. (2006). Automata for Positive Core XPath Queries on Compressed Documents. In: Hermann, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2006. Lecture Notes in Computer Science(), vol 4246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11916277_32
Download citation
DOI: https://doi.org/10.1007/11916277_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48281-9
Online ISBN: 978-3-540-48282-6
eBook Packages: Computer ScienceComputer Science (R0)