On deciding well-definedness for query languages on trees
From MaRDI portal
Publication:3546341
DOI10.1145/1255443.1255447zbMath1312.68084OpenAlexW2055069928MaRDI QIDQ3546341
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1255443.1255447
Related Items
Well-definedness and semantic type-checking for the nested relational calculus ⋮ Conjunctive query containment over trees
Uses Software
This page was built for publication: On deciding well-definedness for query languages on trees