Relational expressive power of constraint query languages
Journal of the ACM (JACM)
Querying spatial databases via topological invariants
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
On Capturing First-Order Topological Properties of Planar Spatial Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Towards a Theory of Recursive Structures
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive Complexity Theory for Constraint Databases
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
| Hi-index | 0.00 |
We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure's universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈Q,