Typechecking XML views of relational databases

DOI10.1145/772062.772065MaRDI QIDQ5267433zbMATH OpenOpenAlexFDO

Authors Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu

Publication date 13 June 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1942/621

zbMATH Keywords

XMLcomplexityrelational databaseslogictypechecking

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70)

Recommendations

• XML with data values: Typechecking revisited.
• Modulo constraints and the complexity of typechecking XML views
• scientific article; zbMATH DE number 1953124
• On the complexity of typechecking top-down XML transformations
• Typechecking for XML transformers

Cited in

(9)

• On the complexity of typechecking top-down XML transformations
• Frontiers of tractability for typechecking simple XML transformations
• XML with data values: Typechecking revisited.
• Automata for XML -- a survey
• Typechecking top-down XML transformations: Fixed input or output schemas
• Propagating XML constraints to relations
• Modulo constraints and the complexity of typechecking XML views
• Database Theory - ICDT 2005
• Well-definedness and semantic type-checking for the nested relational calculus

This page was built for publication: Typechecking XML views of relational databases

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