Abstract
A frequent task encountered in XML processing is to filter an input document to produce a subdocument; that is, a document whose root-to-leaf paths are root-to-leaf paths of the original document and which inherits the tree structure of the original document. These are what we mean by subtree queries, and while they are similar to XPath filters, they cannot be naturally specified either in XPath or in XQuery. Special-purpose subtree query languages provide a natural idiom for specifying this class of queries, but both composition and evaluation are problematic. In this paper we show that for natural fragments of XPath, the resulting subtree query languages are closed under composition. This closure property allows a sequence of subtree queries to be rewritten as a single subtree query, which can then be evaluated either by a subtree-query specific evaluator or via translation to XQuery. We provide a set of composition algorithms for each common XPath fragment and discuss their complexity.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Bonifati, A., Cobena, G., Manolescu, I., Milo, T.: Dynamic XML Documents with Distribution and Replication. In: SIGMOD (2003)
Alexe, B., Benedikt, M., Fundulaki, I.: Specification, Composition and Evaluation of XML Subtree Queries. Technical report, Bell Laboratories (2005), Available at http://db.bell-labs.com/user/fundulaki/
Amer-Yahia, S., Cho, S., Lakshamanan, L.V., Srivastava, D.: Minimization of Tree Pattern Queries. In: SIGMOD (2001)
Benedikt, M., Fan, W., Kuper, G.: Structural Properties of XPath Fragments. Theoretical Computer Science (2003)
Bertino, E., Ferrari, E.: Secure and Selective Dissemination of XML Documents. TISSEC 5(3), 290–331 (2002)
Clark, J., et al. (eds.) XML Path Language (XPath) 1.0. W3C Recommendation (1999), http://www.w3c.org/TR/xpath
Fernandez, M., Kadiyska, Y., Suciu, D., Morishima, A., Tan, W.-C.: SilkRoute: A framework for publishing relational data in XML. TODS 27(4), 438–493 (2002)
Fundulaki, I., Giraud, G., Lieuwen, D., Onose, N., Pombourq, N., Sahuguet, A.: Share your data, keep your secrets. In: SIGMOD (2004) (Demonstration Track)
Gottlob, G., Koch, C.: Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. In: PODS (2002)
Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. In: VLDB (2002)
Hull, R., Kumar, B., Lieuwen, D.: Towards Federated Policy Management. In: Int’l Workshop on Policies for Distributed Systems and Networks (2003)
Marx, M.: XPath with conditional axis relations. In: EDBT (2004)
Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. XMDM (2002)
Sahuguet, A., Alexe, B.: Sub-document queries over XML with XSquirrel. In: WWW (2005)
Sahuguet, A., Alexe, B., Fundulaki, I., Lalilgand, P., Shikfa, A., Arnail, A.: User Profile Management in Converged Networks. In: CIDR (2005)
Schmidt, A., Waas, F., Kersten, M., Carey, M., Manolescu, I., Busse, R.: XMark: a benchmark for XML Data Management. In: VLDB (2002)
Tatarinov, I., Ives, Z., Halevy, A.Y., Weld, D.S.: Updating XML. In: SIGMOD (2001)
Wadler, P.: Two Semantics for XPath. Technical report, Bell Laboratories. Technical Memorandum (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedikt, M., Fundulaki, I. (2005). XML Subtree Queries: Specification and Composition. In: Bierman, G., Koch, C. (eds) Database Programming Languages. DBPL 2005. Lecture Notes in Computer Science, vol 3774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601524_9
Download citation
DOI: https://doi.org/10.1007/11601524_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30951-2
Online ISBN: 978-3-540-31445-5
eBook Packages: Computer ScienceComputer Science (R0)