Typechecking XML views of relational databases

DOI10.1145/772062.772065zbMATH Open1365.68193OpenAlexW2173322574MaRDI QIDQ5267433FDOQ5267433

Tova Milo, Frank Neven, Noga Alon, 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)

Cited In (7)

• 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
• 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)