Constant-memory validation of streaming XML documents against DTDs

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

Volumn 4353 LNCS, Issue , 2006, Pages 299-313

  Segoufin, Luc ^a   Sirangelo, Cristina ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT MEMORY; NON-TRIVIAL; ON-LINE ALGORITHMS; STREAMING XML;

ARTIFICIAL INTELLIGENCE;

XML;

EID: 84865032011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_21     Document Type: Conference Paper

References (5)

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