Towards a theory of spatial database queries (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
First-order queries on databases embedded in an infinite structure
Information Processing Letters
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Languages, automata, and logic
Handbook of formal languages, vol. 3
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
Data models and query languages for spatial databases
Data & Knowledge Engineering - Special jubilee issue: DKE 25
Topological queries in spatial databases
Journal of Computer and System Sciences
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 first-order topological queries
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Constraint Databases
A characterization of first-order topological properties of planar spatial data
Journal of the ACM (JACM)
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Information and Computation
Hi-index | 0.00 |
Closed semi-algebraic sets in the plane form a powerful model of planar spatial datasets. We establish a characterization of the topological properties of such datasets expressible in the relational calculus with real polynomial constraints. The characterization is in the form of a query language that can only talk about points in the set and the "cones" around these points.