Skip to main content

Boolean Operations for Attribute-Element Constraints

Extended Abstract

  • Conference paper
  • First Online:

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

Abstract

The history of schema languages for XML is an increase of expressiveness. While early schema languages mainly focused on the element structure, Clark first paid an equal attention to attributes by allowing both element and attribute constraints in a single regular expression. In this paper, we investigate an algorithmic aspect of Clark’s mechanism (called “attribute-element constraints”), namely, intersection and difference operations, which have been proved to be important in static typechecking for XML processing programs. The contributions here are (1) proofs of closure under intersection and difference and (2) algorithm formulations incorporating a “divide-and-conquer” strategy for avoiding an exponential blow-up for typical inputs.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48(1):117–126, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Bray, D. Hollander, A. Layman, and J. Clark. Namespaces in XML. http://www.w3.org/TR/REC-xml-names, 1999.

  3. T. Bray, J. Paoli, C. M. Sperberg-McQueen, and E. Maler. Extensible markup language (XML™). http://www.w3.org/XML/, 2000.

  4. J.A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481–494, Oct. 1964.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Buneman and B. Pierce. Union types for semistructured data. In Internet Programming Languages, volume 1686 of Lecture Notes in Computer Science. Springer-Verlag, Sept. 1998. Proceedings of the International Database Programming Languages Workshop.

    Google Scholar 

  6. J. Clark. TREX: Tree Regular Expressions for XML. http://www.thaiopensource.com/trex/, 2001.

  7. J. Clark. http://www.thaiopensource.com/relaxng/implement.html, 2002.

  8. J. Clark and M. Murata. RELAX NG. http://www.relaxng.org, 2001.

  9. D.C. Fallside. XML Schema Part 0: Primer, W3C Recommendation. http://www.w3.org/TR/xmlschema-0/, 2001.

  10. P. Fankhauser, M. Fernández, A. Malhotra, M. Rys, J. Siméon, and P. Wadler. XQuery 1.0 Formal Semantics. http://www.w3.org/TR/query-semantics/, 2001.

  11. A. Frisch, G. Castagna, and V. Benzaken. Semantic subtyping. In Seventeenth Annual IEEE Symposium on Logic In Computer Science, 2002.

    Google Scholar 

  12. R. Harper and B. Pierce. A recrd calculus based on symmetric concatenation. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando FL, pages 131–142. ACM, Jan. 1991.

    Google Scholar 

  13. J. E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  14. H. Hosoya and M. Murata. Validation and boolean operations for attribute-element constraints. In Programming Languages Technologies for XML (PLANX), pages 1–10, 2002.

    Google Scholar 

  15. H. Hosoya and M. Murata. Boolean operations and inclusion test for attribute-element constraints. Full version, 2003.

    Google Scholar 

  16. H. Hosoya and B.C. Pierce. XDuce: A typed XML processing language (preliminary report). In Proceedings of Third International Workshop on the Web and Databases (WebDB2000), volume 1997 of Lecture Notes in Computer Science, pages 226–244, May 2000.

    Google Scholar 

  17. H. Hosoya and B.C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 67–80, Jan. 2001.

    Google Scholar 

  18. H. Hosoya, J. Vouillon, and B.C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11–22, Sept. 2000. Full version under submission to TOPLAS.

    Google Scholar 

  19. N. Klarlund, A. Møller, and M. I. Schwartzbach. DSD: A schema language for XML. http://www.brics.dk/DSD/, 2000.

  20. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 11–22. ACM, May 2000.

    Google Scholar 

  21. A. Møller. Document Structure Description 2.0, December 2002. BRICS, Department of Computer Science, University of Aarhus, Notes Series NS-02-7. Available from http://www.brics.dk/DSD/.

  22. M. Murata. Transformation of documents and schemas by patterns and contextual conditions. In Principles of Document Processing’ 96, volume 1293 of Lecture Notes in Computer Science, pages 153–169. Springer-Verlag, 1997.

    Google Scholar 

  23. M. Murata. RELAX (REgular LAnguage description for XML). http://www.xml.gr.jp/relax/, 2001.

  24. A. Tozawa. Towards static type inference for XSLT. In Proceedings of ACM Symposium on Document Engineering, 2001.

    Google Scholar 

  25. J. Vouillon. Interleaving types for XML. Personal communication, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hosoya, H., Murata, M. (2003). Boolean Operations for Attribute-Element Constraints. 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_19

Download citation

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

  • 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