skip to main content
10.1145/1265530.1265558acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Reasoning about XML update constraints

Published:11 June 2007Publication History

ABSTRACT

We introduce in this paper a class of constraints for describing howan XML document can evolve, namely XML update constraints. For these constraints, we study the implication problem, giving algorithms and complexity results for constraints of varying expressive power. Besides classical constraint implication, we also consider an instance-based approach. More precisely, we study implication with respect to a current tree instance, resulting from a series of unknown updates. The main motivation of our work is reasoning about data integrity under update restrictions in contexts where owners may lose control over their data, such as in publishing or exchange.

References

  1. S. Abiteboul, B. Cautis, A. Fiat, and T. Milo. Digital signatures for modifiable collections. In ARES, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying XML with incomplete information. In PODS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Abiteboul and V. Vianu. Regular path queries with constraints. J. Comput. Syst. Sci., 58(3), 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Arenas. Design principles for XML data. PhD thesis, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Arenas and L. Libkin. XML data exchange: consistency and query answering. In PODS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Arenas, W. Fan, and L. Libkin. Consistency of XML specifications. In Inconsistency Tolerance, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. Lecture Notes in Computer Science, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Benedikt and C. Koch. XPath leashed. Technical report, 2006.Google ScholarGoogle Scholar
  10. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Buneman, S. Davidson, W. Fan, C. Hara, and W. C. Tan. Reasoning about keys for XML. Inf. Syst., 28(8), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Cautis, S. Abiteboul, and T. Milo. Reasoning about XML update constraints. In BDA, 2006.Google ScholarGoogle Scholar
  13. C. Y. Chan, W. Fan, P. Felber, M. N. Garofalakis, and R. Rastogi. Tree pattern aggregation for scalable XML data dissemination. In VLDB, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Deutsch and V. Tannen. XML queries and constraints, containment and reformulation. Theor. Comput. Sci., 336(1), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Devanbu, M. Gertz, C. Martel, and S. Stubblebine. Authentic third-party data publication. In IFIP Workshop on Database Security, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. W. Fan. XML constraints: Specification, analysis, and applications. In DEXA Workshops, 2005.Google ScholarGoogle Scholar
  17. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. W. Fan and J. Siméon. Integrity constraints for XML. J. Comput. Syst. Sci., 66(1), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of XPath query evaluation and xml typing. J. ACM, 52(2), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. In ICDT, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In CT-RSA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. of ACM PODS, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. G. Miklau and D. Suciu. Modeling integrity in data exchange. In SDM, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  24. F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2 (3:1), 2006.Google ScholarGoogle ScholarCross RefCross Ref
  25. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In PODS, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. R. L. Rivest. Two signature schemes., 2000. Manuscript.Google ScholarGoogle Scholar
  27. T. Schwentick. XPath query containment. SIGMOD Record, 33 (1), 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. I. Tatarinov, Z. G. Ives, A. Y. Halevy, and D. S. Weld. Updating XML. In SIGMOD, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. P. Wadler. A formal semantics of patterns in XSLT, 1999.Google ScholarGoogle Scholar
  30. Extensible Markup Language 1.0 (2nd Edition). http://www.w3.org/TR/REC-xml.Google ScholarGoogle Scholar
  31. The XML Schema specification. http://www.w3.org/TR/XML/Schema.Google ScholarGoogle Scholar

Index Terms

  1. Reasoning about XML update constraints

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            June 2007
            328 pages
            ISBN:9781595936851
            DOI:10.1145/1265530

            Copyright © 2007 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 11 June 2007

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate476of1,835submissions,26%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!