Relational queries over interpreted structures
From MaRDI portal
Publication:3457752
DOI10.1145/347476.347477zbMath1327.68089OpenAlexW2031856459MaRDI QIDQ3457752
Michael Benedikt, Leonid O. Libkin
Publication date: 17 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/347476.347477
Database theory (68P15) Model theory of finite structures (03C13) Model theory of ordered structures; o-minimality (03C64) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (9)
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ Reachability and connectivity queries in constraint databases ⋮ Quantifier rank for parity of embedded finite models. ⋮ Efficient Evaluation of Arbitrary Relational Calculus Queries ⋮ The past and future of embedded finite model theory ⋮ Aggregate operators in constraint query languages ⋮ An expressive language for linear spatial database queries ⋮ Uniform generation in spatial constraint databases and applications ⋮ Stability theory, permutations of indiscernibles, and embedded finite models
This page was built for publication: Relational queries over interpreted structures
