Typechecking XML views of relational databases

DOI10.1145/772062.772065zbMath1365.68193OpenAlexW2173322574MaRDI QIDQ5267433

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

XMLcomplexitylogicrelational databasestypechecking

Mathematics Subject Classification ID

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

Related Items (7)

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

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