Skip to main content
SpringerLink
Log in

Hidden Conditioned Homomorphism for XPath Fragment Containment

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3882))

Included in the following conference series:

Abstract

As a query language for navigating XML trees and selecting a set of element nodes, XPath is ubiquitous in XML applications. One important issue of XPath queries is checking containment. In particular, we investigate a frequently used fragment of XPath that consists of node tests, the child axis (/), the descendant axis (//), branches ([]) and label wildcards (*). For special classes of pattern trees, the homomorphism algorithm returns false negatives. In order to address this problem, we propose two containment techniques, conditioned homomorphism and hidden conditioned homomorphism, and then present sound algorithms to check containment. The analytical result is given with an experiment.

Supported by the National Natural Science Foundation of China under Grant No. 60573094, Tsinghua Basic Research Foundation under Grant No. JCqn2005022 and Zhejiang Natural Science Foundation under Grant No. Y105230.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimi-zation of tree pattern queries. In: Proc of the 2001 ACM SIGMOD Conf. on Management of Data (2001)

    Google Scholar 

  2. Amer-Yahia, S., Cho, S., Laksshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. The VLDB Journal 11(4), 315–331 (2002)

    Article  MATH  Google Scholar 

  3. Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, Springer, Heidelberg (2002)

    Google Scholar 

  4. Boag, S., Chamberlin, D., Fernández, M.F., Florescu, D., Robie, J., Siméon, J.: XQuery 1.0: An XML Query Language, http://www.w3.org/TR/xquery.W3CWorkingdraft

  5. Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Reasoning about keys for xml (2000)

    Google Scholar 

  6. Calvanese, D., DeGiacomo, G., Vadi, M.: Decidable containment of recursive queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 330–345. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of 9th ACM Symposium on Theory of Computing, pp. 77–90 (1977)

    Google Scholar 

  8. Clark, J.: XSL Transformations (XSLT), http://www.w3.org/TR/xslt.W3CWorkingdraft

  9. Clark, J., DeRose, S.: XML Path Language (XPath) Version 1.0. W3C Working draft, http://www.w3.org/TR/xpath

  10. DeRose, S., Maler, E., Orchard, D.: XML Linking Language (XLink) Version 1.0. W3C Working draft, http://www.w3.org/TR/xpath

  11. DeRose, S., Jr., R.D., Grosso, P., Maler, E., Marsh, J., Walsh, N.: XML Pointer Language (XPointer). W3C Working draft, http://www.w3.org/TR/xptr

  12. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. Journal of the ACM 51(1), 2–45 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Neven, F.: Automata Theory for XML researchers. SIGMOD Record 31(3), 39–46 (2002)

    Article  Google Scholar 

  15. Neven, F.,, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Proc. 9th Int. Conf. on Database Theory (ICDT), Siena, pp. 315–329 (2003)

    Google Scholar 

  16. Schwentick, T.: XPath query containment. ACM SIGMOD Database priciples Column (2004)

    Google Scholar 

  17. Shmueli, O.: Equivalence of datalog queries is undecidable. The Journal of Logic Programming 15(3), 231–242 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 300–314. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Wood, P.T.: Minimizing simple xpath expressions. In: Fourth International Workshop on the Web and Databases (WebDB 2001) (2001)

    Google Scholar 

  20. Wood, P.T.: On the equivalence of xml patterns. In: International Conference on Deductive and Object-Oriented Databases (DOOD), pp. 1152–1166 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, P.R. China

    Yuguo Liao, Jianhua Feng, Yong Zhang & Lizhu Zhou

Authors
  1. Yuguo Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianhua Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lizhu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, National University of Singapore, Singapore

    Mong Li Lee

  2. School of Computing, National University of Singapore, Singapore

    Kian-Lee Tan

  3. School of Engineering and Technology, Asian Institute of Technology, P.O. Box 4, 12120, Klong Luang, Pathum Thani, Thailand

    Vilas Wuwongse

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, Y., Feng, J., Zhang, Y., Zhou, L. (2006). Hidden Conditioned Homomorphism for XPath Fragment Containment. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_32

Download citation

  • DOI: https://doi.org/10.1007/11733836_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33337-1

  • Online ISBN: 978-3-540-33338-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation