Advertisement

Validation of XML Document Updates Based on XML Schema in XML Databases

  • Sang-Kyun Kim
  • Myungcheol Lee
  • Kyu-Chul Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2736)

Abstract

We study the validation of XML documents when they are updated in XML databases. An XML document can be verified by checking against an XML Schema, which contains structure and type information of XML documents. However, most of XML database systems just validate the whole XML document, but can not validate parts of it. If updates are very frequent, then validating the whole XML document will cause serious performance degradation. Furthermore, rollback should be performed if the updates result in an invalid document, because the updated document is usually validated after the update operation executed. In this paper, we propose an immediate and partial validation mechanism for solving these two problems, i.e the validity of an update operation is checked immediately before the actual update is applied to the database whether it causes invalidity, and validation is performed only on the updated parts of the XML document in the database. Consequently, XML database systems can maintain valid XML documents at any time. We already proposed an immediate and partial validation mechanism based on DTD[6], and we extend the mechanism based on XML Schema in this paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tatarinov, I., Ives, Z.G., Halevy, A.Y., Weld, D.S.: Updating XML. In: Proceedings of ACM SIGMOD Conference, pp. 413–424 (2001)Google Scholar
  2. 2.
    Robie, J., Lehti, R.: Updates in XQuery. In: Proceedings of XML Conference (2001)Google Scholar
  3. 3.
    Software AG. QuiP: a prototype of XQuery, http://www.softwareag.com/developer/quip/default.htm
  4. 4.
    Chen, Y.B., Ling, T.W., Lee, M.L.: Designing Valid XML Views. In: Proceedings of the 21st International Conference on Conceptual Modeling, pp. 463–478. Springer, Heidelberg (2002)Google Scholar
  5. 5.
    Papakonstantinou, Y., Vianu, V.: Incremental Validation of XML Documents. In: Proceedings of the 9th International Conference on Database Theory, pp. 47–63. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Kim, S.-K., Lee, M.-C., Lee, K.-C.: Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases. In: Proceedings of the 3rd Advances in Web-Age Information Management, pp. 387–396. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compilers Principles, Techniques and Tools. Addison-Wesley, Reading (1986)Google Scholar
  8. 8.
    Neven, F.: Automata theory for XML researchers. ACM SIGMOD Record 31(3), 39–46 (2002)CrossRefGoogle Scholar
  9. 9.
    Kilpelainen, P., Wood, D.: SGML and XML Document Grammars and Exceptions. Information and Computation 169, 230–252 (2001)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Bruggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science 120, 197–213 (1993)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Sager, T.J.: On the use of extended grammars. In: Proceedings of the 20th annual conference on Southeast regional conference, pp. 246–252 (1982)Google Scholar
  12. 12.
    Papakonstantinou, Y., Vianu, V.: DTD inference for views of XML data. In: Proceedings of 20th Symposium on Principles of Database Systems (PODS 2001), pp. 35–46. ACM Press, New York (2001)Google Scholar
  13. 13.
    Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoretical Computer Science 48, 117–126 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Thompson, K.: Regular expression search algorithm. Communications of the ACM 11, 419–422 (1968)zbMATHCrossRefGoogle Scholar
  15. 15.
    Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys 16, 1–53 (1961)CrossRefGoogle Scholar
  16. 16.
    Ling, T.W., Lee, M.L., Dobbie, G.: Application of ORA-SS: An Object-Relationship- Attribute Model for Semi-Structured Data. In: Proceedings of the 3rd International Conference on Information Integration and Web-based Applications & Services, pp. 17–28 (2001)Google Scholar
  17. 17.
    Ghezzi, C., Mandrioli, D.: Augmenting parsers to support incrementality. Journal of the Association for Comupting Machinery 27(3), 564–579 (1980)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Wagner, T., Graham, S.: Efficient and flexible incremental parsing. ACM Transactions on Programming Languages and Systems 20(2), 980–1013 (1998)CrossRefGoogle Scholar
  19. 19.
    Larcheveque, J.-M.: Optimal Incremental Parsing. ACM Transactions on Programming Languages and Systems 17(1), 1–15 (1995)CrossRefGoogle Scholar
  20. 20.
    Murching, A., Prasant, Y., Srikant, Y.: Incremental recursive descent parsing. Computer Languages 15(4) (1990)Google Scholar
  21. 21.
    Li, W.: A simple and efficient incremental LL(1) parsing. In: 22nd Seminar on Current Trends in Theory and Practice of Informatics, pp. 399–404 (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sang-Kyun Kim
    • 1
  • Myungcheol Lee
    • 2
  • Kyu-Chul Lee
    • 1
  1. 1.Dept. of Computer EngineeringChungnam National UniversityKorea
  2. 2.Computer System Department, Computer & Software Research LaboratoryElectronics and Telecommunications Research InstituteKorea

Personalised recommendations