Incremental validation of XML documents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2572, Issue , 2003, Pages 47-63

  Papakonstantinou, Yannis ^a   Vianu, Victor ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY EQUIPMENT; CONTEXT FREE GRAMMARS;

BRUTE FORCE; ELEMENT TYPE; INCREMENTAL ALGORITHM; INCREMENTAL VALIDATION; INSERTIONS AND DELETIONS; XML SCHEMAS;

XML;

EID: 35248894765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36285-1_4     Document Type: Article

References (25)

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.
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.
4. S. Cluet, C. Delobel, J. Simeon, and K. Smaga. Your mediators need data conversion! In Proc. ACM SIGMOD, 177-188, 1998.
5. T. Cormen and C. Leiserson and R. Rivest. Introduction to Algorithms, Mc Graw-Hill, 1992.
6. G. Dong and J. Su. Space-bounded foies. In Proc. ACM PODS, 139-150, 1995.
7. C. Ghezzi and D. Mandrioli. Augmenting parsers to support incrementality. JACM, 27(3), 1980.
8. H. Garcia-Molina, J. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2001.
9. B. Hesse and N. Immerman. Complete problems for dynamic complexity classes. Proc.IEEE LICS, 313-322, 2002.
10. F. Jalili and J. Gallier. Building friendly parsers. In Proc. ACM POPL, 1982.
11. J. Larcheveque. Optimal incremental parsing. ACM Transactions on Programming Languages and Systems, 17(1), 1995.
12. W. Li. A simple and efficient incremental LL(1) parsing. In Theory and Practice of Informatics, 1995.
13. G. Linden. Incremental updates in structured documents, 1993. Licentiate Thesis, Report C-1993-19, Department of Computer Science, University of Helsinki.
14. M. Lohrey. On the parallel complexity of tree automata. In Proceedings of the 12th RTA, LNCS 2051, 2001.
15. A. Murching, Y. Prasant, and Y. Srikant. Incremental recursive descent parsing. Computer Languages, 15(4), 1990.
16. P.B. Miltersen, S. Subramanian, J.S. Vitter, and R. Tamassia. Complexity models for incremental computation. TCS, 130(1):203-236, 1994.
17. F. Neven. Automata, logic and XML. In Computer Science Logic, 2-26, 2002.
18. L. Petrone. Reusing batch parsers as incremental parsers. In Proc. FSTTCS, 1995.
19. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. JCSS, 55(2), 1997.
20. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. ACM PODS, 35-16, 2000.
21. L. Segoufin. Personal communication, 2002.
22. H. Vollmer. Introduction to Circuit Complexity. Springer Verlag, 1999.
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.