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)
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
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A characterization of first-order topological properties of planar spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Hi-index | 0.00 |
Planar spatial datasets can be modeled by closed semi-algebraic sets in the plane. 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 point that can only talk about points in the set and the “cones” around these points.