Rewriting of visibly pushdown languages for XML data integration

DOI10.1016/J.TCS.2011.05.047MaRDI QIDQ719268zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 10 October 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.05.047

zbMATH Keywords

data integrationvisibly pushdown languagesXML

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• View-based tree-language rewritings for XML
• scientific article; zbMATH DE number 1953134
• On the Membership Problem for Visibly Pushdown Languages
• Active XML document rewriting based on tree automata theory
• Visibly Pushdown Transducers for Approximate Validation of Streaming XML

Cites work

• Automata for XML -- a survey
• scientific article; zbMATH DE number 1953135 (Why is no real title available?)
• scientific article; zbMATH DE number 2080479 (Why is no real title available?)
• scientific article; zbMATH DE number 1830777 (Why is no real title available?)
• Marrying Words and Trees
• Representation theorems on regular languages
• Rewriting of regular expressions and regular path queries
• Visibly pushdown languages

Cited in

(5)

• A visual language should be easy to use: a step forward for XML-GL
• Colored nested words
• Verification of opacity and diagnosability for pushdown systems
• A methodology for measuring structure similarity of fuzzy XML documents
• Evolving schemas for streaming XML

Describes a project that uses

Uses Software

• XPath
• Relax NG

This page was built for publication: Rewriting of visibly pushdown languages for XML data integration

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