Skip to main content

Numerical Constraints for XML

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4576))

Abstract

We introduce numerical constraints into the context of XML which restrict the number of nodes within subtrees of an XML tree that contain specific value-equal subnodes. We demonstrate the applicability of numerical constraints by optimising XML queries and predicting the number of XML query answers, updates and encryptions.

In order to effectively unlock the wide range of XML applications decision problems associated with numerical constraints are investigated. The implication problem is coNP-hard for several restricted classes of numerical constraints. These sources of intractability direct our attention towards numerical keys that permit the specification of upper bounds. Keys, as introduced by Buneman et al., are numerical keys with upper bound 1. Numerical keys are finitely satisfiable, finitely axiomatisable, and their implication problem is decidable in quadratic time.

This research is supported by the Marsden Fund Council from Government funding, administered by the Royal Society of New Zealand.

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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Apparao, V., et al.: Document object model (DOM) Level 1 Specification, W3C Recommendation (October 1998), http://www.w3.org/TR/REC-DOM-Level-1/

  3. Arenas, M., Libkin, L.: A normal form for XML documents. TODS 29(1), 195–232 (2004)

    Article  Google Scholar 

  4. Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. TCS 336(1), 3–31 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Boag, S., Chamberlin, D., Fernández, M., Florescu, D., Robie, J., Siméon, J.: XQuery 1.0: An XML query language, W3C Recommendation (January 2007), http://www.w3.org/TR/xquery/

  6. Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible markup language (XML) 1.0 (Fourth Edition) W3C Recommendation (August 2006), http://www.w3.org/TR/xml/

  7. Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Keys for XML. Computer Networks 39(5), 473–487 (2002)

    Article  Google Scholar 

  8. Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Reasoning about keys for XML. Inf. Syst. 28(8), 1037–1063 (2003)

    Article  Google Scholar 

  9. Buneman, P., Fan, W., Siméon, J., Weinstein, S.: Constraints for semi-structured data and XML. SIGMOD Record 30(1), 47–54 (2001)

    Article  Google Scholar 

  10. Chamberlin, D., Florescu, D., Robie, J.: XQuery Update Facility, W3C Working Draft, (July 2006), http://www.w3.org/TR/xqupdate/

  11. Clark, J., DeRose, S.: XML path language (XPath) Version 1.0, W3C Recommendation (November 1999), http://www.w3.org/TR/xpath

  12. Fan, W.: XML constraints. In: DEXA Workshops, pp. 805–809 (2005)

    Google Scholar 

  13. Grant, J., Minker, J.: Inferences for numerical dependencies. TCS 41, 271–287 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hara, C., Davidson, S.: Reasoning about nested functional dependencies. In: PODS, pp. 91–100 (1999)

    Google Scholar 

  15. Hartmann, S.: On the implication problem for cardinality constraints and functional dependencies. Ann. Math. Art. Intell. 33, 253–307 (2001)

    Article  MathSciNet  Google Scholar 

  16. Hartmann, S., Link, S.: Unlocking keys for XML trees. In: ICDT 2007. LNCS, vol. 4353, pp. 104–118. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Hartmann, S., Link, S., Schewe, K.-D.: Functional and multivalued dependencies in nested databases generated by record and list constructor. Ann. Math. Art. Intell. 46, 114–164 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hartmann, S., Link, S., Trinh, T.: Efficient reasoning about XFDs with pre-image semantics. In: DASFAA. LNCS, vol. 4443, pp. 1070–1074. Springer, Heidelberg (2007)

    Google Scholar 

  19. Hartmann, S., Trinh, T.: Axiomatising functional dependencies for XML with frequencies. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 159–178. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Imamura, T., Dillaway, B., Simon, E.: XML encryption syntax and processing, W3C Recommendation (December 2002), http://www.w3.org/TR/xmlenc-core/

  21. Kay, M.: XSL transformations (XSLT) Version 2.0 W3C Recommendation (January 2007), http://www.w3.org/TR/xslt20/

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

    Article  MathSciNet  Google Scholar 

  23. Piatetsky-Shapiro, G.: The optimal selection of secondary indices is NP-complete. SIGMOD Record 13(2), 72–75 (1983)

    Article  Google Scholar 

  24. Thalheim, B.: Dependencies in Relational Databases. Teubner (1991)

    Google Scholar 

  25. Thompson, H., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema Part 1: Structures second edition, W3C Recommendation (October 2004), http://www.w3.org/TR/xmlschema-1/

  26. Vincent, M., Liu, J., Liu, C.: Strong functional dependencies and their application to normal forms in XML. TODS 29(3), 445–462 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Daniel Leivant Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Hartmann, S., Link, S. (2007). Numerical Constraints for XML. In: Leivant, D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2007. Lecture Notes in Computer Science, vol 4576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73445-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73445-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73443-7

  • Online ISBN: 978-3-540-73445-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics