A representation independent language for planar spatial databases with Euclidean distance
From MaRDI portal
Publication:2641864
DOI10.1016/j.jcss.2006.10.008zbMath1121.68037OpenAlexW2165801951MaRDI QIDQ2641864
Publication date: 23 August 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.008
Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Uses Software
Cites Work
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
- Finitely representable databases
- Querying spatial databases via topological invariants
- An expressive language for linear spatial database queries
- Handling infinite temporal data
- Relational expressive power of constraint query languages
- Sentences true in all constructive models
- First-Order Queries on Finite Structures Over the Reals
- Safe Constraint Queries
- First‐Order Languages Expressing Constructible Spatial Database Queries
- On the expressiveness of linear-constraint query languages for spatial databases
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A representation independent language for planar spatial databases with Euclidean distance