Skip to main content
SpringerLink
Log in

XML Schema Containment Checking Based on Semi-implicit Techniques

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2759))

Included in the following conference series:

Abstract

XML schemas are computer languages defining grammars for XML (Extensible Markup Languages) documents. Containment checking for XML schemas has many applications, and is thus important. Since XML schemas are related to the class of tree regular languages, their containment checking is reduced to the language containment problem for non-deterministic tree automata (NTAs). However, an NTA for a practical XML schema has 102−103 states for which the textbook algorithm based on naive determinization is expensive. Thus we in this paper consider techniques based on BDDs (binary decision diagrams). We used semi-implicit encoding which encodes a set of subsets of states as a BDD, rather than encoding a set of states by it. The experiment on several real-world XML schemas proves that our containment checker can answer problems that cannot be solved by previously known algorithms.

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 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. Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA’ 96, London, Ontario, Canada, LNCS 1260. Springer Verlag, 1997.

    Google Scholar 

  2. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions and Computers, C-35(8):677–691, August 1986.

    Article  Google Scholar 

  3. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking. MIT press, 1999.

    Google Scholar 

  4. Aske Simon Christensen, Anders Muller, and Michael I. Schwartzbach. Static analysis for dynamic XML. In Proceedings of 1st Workshop on Programming Languages Technology for XML (PLAN-X 2002), 2002.

    Google Scholar 

  5. Bernd Finkbeiner. Language containment checking with nondeterministic BDDs. In 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 24–38, 2001.

    Chapter  Google Scholar 

  6. [HJJ+95]_Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, and Anders Sandholm. Mona: Monadic secondorder logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of LNCS, pages 89–110. Springer, 1995.

    Google Scholar 

  7. Haruo Hosoya and Makoto Murata. Validation and boolean operations for attribute-element constraints. In Proceedings of 1st Workshop on Programming Languages Technology for XML (PLAN-X 2002), 2002.

    Google Scholar 

  8. Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11–22, Sep., 2000.

    Google Scholar 

  9. G.M. Kuper and J. Simeon. Subsumption for XML types. In Proceedings of International Conference on Database Theory (ICDT), Jan., 2001.

    Google Scholar 

  10. Nils Klarlund, Michael I. Schwartzbach, and Anders Møller. The DSD schema language. Automated Software Engineering Journal, to appear, 2002.

    Google Scholar 

  11. Makoto Murata, Dongwon Lee, and Murali Mani. Taxonomy of XML schema languages using formal language theory. In Proceedings of Extreme Markup Language 2001, Montreal, pages 153–166, 2001.

    Google Scholar 

  12. Alain J. Mayer and Larry J. Stockmeyer. The complexity of word problems-this time with interleaving. Information and Computation, 115(2):293–311, 1994.

    Article  MathSciNet  Google Scholar 

  13. Oraganization for Advancement of Structured Information Standards (OASIS). RELAX NG, 2001. http://www.oasis-open.org/committees/relax-ng/.

  14. RELAX (REgular LAnguage description for XML). http://www.xml.gr.jp/relax/.

  15. Hermut Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19(3):424–437, June 1990.

    Article  MATH  MathSciNet  Google Scholar 

  16. Hervé J. Touati, Robert K. Brayton, and Robert Kurshan. Testing language containment for ω-automata using BDDs. Information and Computation, 118(1):101–109, April 1995.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Tasiran, R. Hojati, and R. K. Brayton. Language containment using non-deteministic omega-automata. In Proc. of CHARME’95, volume 987 of LNCS. Springer-Verlag, 1995.

    Google Scholar 

  18. World Wide Web Consortium. XHTML1.0, 2000. http://www.w3.org/TR/xhtml.

Download references

Author information

Authors and Affiliations

  1. IBM Research, Tokyo Research Laboratory, IBM Japan ltd., Japan

    Akihiko Tozawa

  2. Graduate School of Information Science and Technology, University of Tokyo, Japan

    Masami Hagiya

Authors
  1. Akihiko Tozawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masami Hagiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99163, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tozawa, A., Hagiya, M. (2003). XML Schema Containment Checking Based on Semi-implicit Techniques. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45089-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45089-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation