Skip to main content
SpringerLink
Log in

Incremental Validation of XML Documents

  • Conference paper
  • First Online:
Database Theory — ICDT 2003 (ICDT 2003)

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

Included in the following conference series:

Abstract

We investigate the incremental validation of XML documents with respect to DTDs and XML Schemas, under updates consisting of element tag renamings, insertions and deletions. DTDs are modeled as extended context-free grammars and XML Schemas are abstracted as “specialized DTDs”, allowing to decouple element types from element tags. For DTDs, we exhibit an O(m log n) incremental validation algorithm using an auxiliary structure of size O(n), where n is the size of the document and m the number of updates. For specialized DTDs, we provide an O(m log2 n) incremental algorithm, again using an auxiliary structure of size O(n). This is a significant improvement over brute-force re-validation from scratch.

Authors supported in part by the NSF under grant numbers IRI-9734548, IRI- 9221268 and Digital Government 9983510.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over non-ranked alphabets. HKUST-TCSC-2001-05, HKUST 2001. Available at http://www.cs.ust.hk/tcsc/RR/2001-05.ps.gz.

  2. A. Bruggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 142(2):182–206, 1998.

    Article  MathSciNet  Google Scholar 

  3. C. Beeri and T. Milo. Schemas for integration and translation of structured and semi-structured data. In Int’l. Conf. on Database Theory, pages 296–313, 1999.

    Google Scholar 

  4. S. Cluet, C. Delobel, J. Simeon, and K. Smaga. Your mediators need data conversion! In Proc. ACM SIGMOD, 177–188, 1998.

    Google Scholar 

  5. T. Cormen and C. Leiserson and R. Rivest. Introduction to Algorithms, Mc Graw-Hill, 1992.

    Google Scholar 

  6. G. Dong and J. Su. Space-bounded foies. In Proc. ACM PODS, 139–150, 1995.

    Google Scholar 

  7. C. Ghezzi and D. Mandrioli. Augmenting parsers to support incrementality. JACM, 27(3), 1980.

    Google Scholar 

  8. H. Garcia-Molina, J. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2001.

    Google Scholar 

  9. B. Hesse and N. Immerman. Complete problems for dynamic complexity classes. Proc.IEEE LICS, 313–322, 2002.

    Google Scholar 

  10. F. Jalili and J. Gallier. Building friendly parsers. In Proc. ACM POPL, 1982.

    Google Scholar 

  11. J. Larcheveque. Optimal incremental parsing. ACM Transactions on Programming Languages and Systems, 17(1), 1995.

    Google Scholar 

  12. W. Li. A simple and efficient incremental LL(1) parsing. In Theory and Practice of Informatics, 1995.

    Google Scholar 

  13. G. Linden. Incremental updates in structured documents, 1993. Licentiate Thesis, Report C-1993-19, Department of Computer Science, University of Helsinki.

    Google Scholar 

  14. M. Lohrey. On the parallel complexity of tree automata. In Proceedings of the 12th RTA, LNCS 2051, 2001.

    Google Scholar 

  15. A. Murching, Y. Prasant, and Y. Srikant. Incremental recursive descent parsing. Computer Languages, 15(4), 1990.

    Google Scholar 

  16. P.B. Miltersen, S. Subramanian, J.S. Vitter, and R. Tamassia. Complexity models for incremental computation. TCS, 130(1):203–236, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  17. F. Neven. Automata, logic and XML. In Computer Science Logic, 2–26, 2002.

    Google Scholar 

  18. L. Petrone. Reusing batch parsers as incremental parsers. In Proc. FSTTCS, 1995.

    Google Scholar 

  19. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. JCSS, 55(2), 1997.

    Google Scholar 

  20. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. ACM PODS, 35–46, 2000.

    Google Scholar 

  21. L. Segoufin. Personal communication, 2002.

    Google Scholar 

  22. H. Vollmer. Introduction to Circuit Complexity. Springer Verlag, 1999.

    Google Scholar 

  23. W3C. The extensible markup language (XML), 1998. W3C Recomendation available at http://www.w3c.org/XML.

  24. W3C. XML schema definition, 2001. W3C Recomendation available at http://www.w3c.org/XML/Schema.

  25. T. Wagner and S. Graham. Efficient and flexible incremental parsing. ACM Transactions on Programming Languages and Systems, 20(2), 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, University of California at San Diego, USA

    Yannis Papakonstantinou & Victor Vianu

Authors
  1. Yannis Papakonstantinou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00198, Roma, Italy

    Diego Calvanese  & Maurizio Lenzerini  & 

  2. Department of Computer Science, Stanford University, Room 474 Gates Computer Science Building 4B, 94305-9045, Stanford, CA, USA

    Rajeev Motwani

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papakonstantinou, Y., Vianu, V. (2003). Incremental Validation of XML Documents. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds) Database Theory — ICDT 2003. ICDT 2003. Lecture Notes in Computer Science, vol 2572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36285-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36285-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00323-6

  • Online ISBN: 978-3-540-36285-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation