Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Geometry of subanalytic and semialgebraic sets
Geometry of subanalytic and semialgebraic sets
Finitely representable databases
Journal of Computer and System Sciences - Special issue on principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
An expressive language for linear spatial database queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complete geometric query languages
Journal of Computer and System Sciences
Reachability and connectivity queries in constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-point query languages for linear constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Linear approximation of planar spatial databases using transitive-closure logic
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIAM Journal on Computing
Constraint Databases
Expressing Topological Connectivity of Spatial Databases
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Theoretical Computer Science - Database theory
| Hi-index | 0.00 |
We consider n-dimensional semi-algebraic spatial databases. We compute in first-order logic extended with a transitive closure operator, a linear spatial database which characterizes the semi-algebraic spatial database up to a homeomorphism. In this way, we generalize our earlier results to semi-algebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dimensions.Consequently, we can prove that first-order logic with a transitive closure operator extended with stop conditions, can express all Boolean topological queries on semi-algebraic spatial databases of arbitrary dimension.