Visibly Pushdown Transducers for Approximate Validation of Streaming XML

DOI10.1007/978-3-540-77684-0_16MaRDI QIDQ5445303zbMATH OpenOpenAlexFDO

Authors

Publication date 4 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77684-0_16

Mathematics Subject Classification ID

General topics in the theory of data (68P01) Formal languages and automata (68Q45)

Recommendations

• Updates, schema updates and validation of XML documents -- using abstract state machines with automata-defined states
• Evolving schemas for streaming XML
• Sublinear DTD validity
• Validating XML documents in the streaming model with external memory
• The word problem for visibly pushdown languages described by grammars

Cites work

• A Minimum Distance Error-Correcting Parser for Context-Free Languages
• Automata, Languages and Programming
• Bounded regular path queries in view-based data integration
• Foundations of Information and Knowledge Systems
• Regular path queries under approximate semantics
• Visibly pushdown languages

Cited in

(9)

• Visibly pushdown transducers
• Visibly rational expressions
• Sublinear DTD validity
• Minimization of visibly pushdown automata using partial Max-SAT
• Updates, schema updates and validation of XML documents -- using abstract state machines with automata-defined states
• Approximate XML structure validation based on document-grammar tree similarity
• Evolving schemas for streaming XML
• Validating streaming JSON documents with learned VPAs
• Rewriting of visibly pushdown languages for XML data integration

This page was built for publication: Visibly Pushdown Transducers for Approximate Validation of Streaming XML

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445303)