Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Database Programming Languages

DBPL 2001: Database Programming Languages pp 133–148Cite as

Reasoning about Keys for XML

  • Conference paper
  • First Online:

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

Abstract

We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and decidable in PTIME in the size of keys.

Supported by NSF IIS 99-77408 and NSF DL-2 IIS 98-17444

Supported by NSF DBI99-75206

Supported in part by NSF IIS 00-93168.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. From Relations to Semistructured Data and XML. Morgan Kaufman, 2000.

    Google Scholar 

  2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  3. S. Abiteboul and V. Vianu. Regular path queries with constraints. Journal of Computer and System Sciences (JCSS), 58(4):428–452, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Keys for XML. In WWW 10, 2001.

    Google Scholar 

  5. P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Reasoning about absolute and relative keys for XML. Technical Report TUCIS-TR-2001-002, Temple University, 2001.

    Google Scholar 

  6. P. Buneman, W. Fan, J. Siméon, and S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record, 30(1), 2001.

    Google Scholar 

  7. P. Buneman, W. Fan, and S. Weinstein. Path constraints on semistructured and structured data. In PODS, 1998.

    Google Scholar 

  8. P. Buneman, W. Fan, and S. Weinstein. Interaction between path and type constraints. In PODS, 1999.

    Google Scholar 

  9. P. Buneman, W. Fan, and S. Weinstein. Path constraints in semistructured databases. Journal of Computer and System Sciences (JCSS), 61(2):146–193, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. In PODS, 2001.

    Google Scholar 

  11. W. Fan and J. Siméon. Integrity constraints for XML. In PODS, 2000.

    Google Scholar 

  12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.

    Google Scholar 

  13. C. S. Hara and S. B. Davidson. Reasoning about nested functional dependencies. In PODS, 1999.

    Google Scholar 

  14. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addision Wesley, 1979.

    Google Scholar 

  15. H. Hunt, D. Resenkrantz, and T. Szymanski. On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences (JCSS), 12:222–268, 1976.

    MATH  Google Scholar 

  16. M. Ito and G. E. Weddell. Implication problems for functional constraints on databases supporting complex objects. Journal of Computer and System Sciences (JCSS), 50(1):165–187, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  17. T. Milo and D. Suciu. Index structures for path expressions. In ICDT, 1999.

    Google Scholar 

  18. R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill Higher Education, 2000.

    Google Scholar 

  19. J. Robie, J. Lapp, and D. Schach. XML Query Language (XQL). Workshop on XML Query Languages, Dec. 1998.

    Google Scholar 

  20. V. Vianu. A Webodyssey: From Codd to XML. In PODS, 2001.

    Google Scholar 

  21. W3C. Document Object Model (DOM) Level 1 Specification. Recommendation, Oct. 1998. http://www.w3.org/TR/REC-DOM-Level-1/ .

  22. W3C. Extensible Markup Language (XML) 1.0, Feb 1998. http://www.w3.org/TR/REC-xml .

  23. W3C. XML-Data. Note, Jan. 1998. http://www.w3.org/TR/1998/NOTE-XML-data.

  24. W3C. XML Path Language (XPath). Working Draft, Nov. 1999. http://www.w3.org/TR/xpath .

  25. W3C. XSL Transformations (XSLT). Recommendation, Nov. 1999. http://www.w3.org/TR/xslt .

  26. W3C. XML Schema. Working Draft, May 2001. http://www.w3.org/XML/Schema.

  27. P. Wadler. A Formal Semantics for Patterns in XSL. Technical report, Computing Sciences Research Center, Bell Labs, Lucent Technologies, 2000.

    Google Scholar 

  28. S. Yu. Regular languages. In G. Rosenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 41–110. Springer, 1996.

    Google Scholar 

Download references

Author information

Author notes

  1. Wenfei Fan

    Present address: Temple University, USA

Authors and Affiliations

  1. University of Pennsylvania, Philadelphia, PA, 19104-6389, USA

    Peter Buneman, Susan Davidson & Wang-Chiew Tan

  2. Bell Laboratories, Murray Hill, NJ, 07974-0636, USA

    Wenfei Fan

  3. Universidade Federal do Parana, Curitiba, PR, 81531-990, Brazil

    Carmem Hara

Authors
  1. Peter Buneman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susan Davidson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenfei Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carmem Hara
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wang-Chiew Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Univesità di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Giorgio Ghelli

  2. Department of Computer Science, Concordia University, 1455 De Maisonneuve Blvd. West, Montréal, Québec, Canada, H3G 1M8

    Gösta Grahne

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, WC. (2002). Reasoning about Keys for XML. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-46093-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44080-2

  • Online ISBN: 978-3-540-46093-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation