Skip to main content

On the Equivalence of XML Patterns

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Included in the following conference series:

Abstract

Patterns for matching parts of XML documents are used in a number of areas of XML document management: in links between documents, in templates for document transformation, and in queries for document retrieval. The W3C has defined XSLT patterns as a common sub-language for all these applications. We study the equivalence problem for XSLT patterns by defining a logic-based data model for XML and a semantics for XSLT patterns in terms of Datalog programs. Although uniform equivalence of Datalog programs is not sufficient to capture the equivalence of programs derived from XSLT patterns, we nevertheless show that equivalence can be decided by a variant of the chase process using embedded tuple-generating dependencies. One advantage of this approach is that the method can easily be extended to determine equivalence when documents are known to satisfy constraints imposed by document type definitions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. A. V. Aho, Y. Sagiv, and J. D. Ullman. Equivalences among relational expressions. SIAM J. Computing, 8(2):218–246, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718–741, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  3. K. Böhm, K. Aberer, M. T. Ozsu, and K. Gayer. Query optimization for structured documents based on knowledge on the document type definition. In Proc. Advances in Digital Libraries, pages 196–205. IEEE Press, 1998.

    Google Scholar 

  4. D. Calvanese, G. de Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. Seventeenth ACM Symp. on Principles of Databases Systems, pages 149–158. ACM Press, 1998.

    Google Scholar 

  5. D. Florescu, A. Y. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In Proc. Seventeenth ACM Symp. on Principles of Databases Systems, pages 139–148. ACM Press, 1998.

    Google Scholar 

  6. H. Liefke. Horizontal query optimization on ordered semistructured data. In Proc. WebDB’99: Int. Workshop on the Web and Databases, pages 61–66, 1999.

    Google Scholar 

  7. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. on Database Syst., 4(4):455–469, 1979.

    Article  Google Scholar 

  8. S. Maneth and F. Neven. Structured document transformations based on XSL. In Proc. Database Programming Languages, 1999.

    Google Scholar 

  9. F. Neven and J. Van den Bussche. On implementing structured document query facilities on top of a DOOD. In Proc. 5th Int. Conf. on Deductive and Object-Oriented Databases, pages 351–367, 1997.

    Google Scholar 

  10. Y. Papakonstantinou and V. Vassalos. Query rewriting for semistructured data. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 455–466, 1999.

    Google Scholar 

  11. J. Robie, J. Lapp, and D. Schach. XML query language (XQL). In Proc. QL’98—The Query Languages Workshop, 1998.

    Google Scholar 

  12. Y. Sagiv. Optimizing Datalog programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 659–698. Morgan Kaufmann, 1988.

    Google Scholar 

  13. O. Shmueli. Decidability and expressiveness aspects of logic queries. In Proc. Fifth ACM Symp. on Principles of Databases Systems, pages 237–249, 1986.

    Google Scholar 

  14. P. Wadler. A formal semantics of patterns in XSLT. In Markup Technologies 99, 1999.

    Google Scholar 

  15. P. T. Wood. Optimizing web queries using document type definitions. In ACM CIKM’99 2nd International Workshop on Web Information and Data Management (WIDM’99), pages 28–32. ACM Press, 1999.

    Google Scholar 

  16. World Wide Web Consortium. XML pointer language (XPointer). http://www.w3.org/TR/WD-xptr, March 1998.

  17. World Wide Web Consortium. Extensible stylesheet language (XSL). http://www.w3.org/TR/WD-xsl, 1999.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wood, P.T. (2000). On the Equivalence of XML Patterns. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics