Constant-Memory Validation of Streaming XML Documents Against DTDs

  • Luc Segoufin
  • Cristina Sirangelo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4353)

Abstract

In this paper we investigate the problem of validating, with constant memory, streaming XML documents with respect to a DTD. Such constant memory validations can only be performed for some but not all DTDs. This paper gives a non trivial interesting step towards characterizing those DTDs for which a constant-memory on-line algorithm exists.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bárány, V., Löding, C., Serre, O.: Regularity Problems for Visibly Pushdown Languages. In: STACS (2006)Google Scholar
  2. 2.
    Chitic, C., Rosu, D.: On Validation of XML Streams Using Finite State Machines. In: WebDB (2004)Google Scholar
  3. 3.
    Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov 44 (1955) (in Russian)Google Scholar
  4. 4.
    Segoufin, L., Vianu, V.: Streaming XML documents. In: PODS (2002)Google Scholar
  5. 5.
    Slobodskoi, A.M.: Unsolvability of the universal theory of finite groups. Algebra and Logic 20, 139–156 (1981)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Luc Segoufin
    • 1
  • Cristina Sirangelo
    • 1
  1. 1.INRIA and Université Paris 11 

Personalised recommendations