Linear approximation of planar spatial databases using transitive-closure logic
Summary: Linear approximations of planar polynomial-constraint spatial databases are inexpressible in standard FO constraint queries but definable in FO+transitive closure. An extended transitive-closure logic is complete for computable queries on linear spatial DBs, thus capturing all computable planar topological queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Floris Geerts
- 2. Bart Kuijpers
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,245 | The DEDALE System for Complex Spatial Queries | 1998 | SIGMOD | 9.2085554e-05 |
| 2,851 | On the Decidability of Semi-Linearity for Semi-Algebraic Sets and its Implications for Spatial Databases (extended abstract) | 1997 | PODS | 8.0155027e-05 |
| 4,369 | An Expressive Language for Linear Spatial Database Queries (extended abstract) | 1998 | PODS | 6.2487721e-05 |
| 4,379 | Safe Constraint Queries | 1998 | PODS | 6.2397591e-05 |
| 4,723 | Exact and Approximate Aggregation in Constraint Query Languages | 1999 | PODS | 5.9714196e-05 |
| 8,323 | Towards Practical Constraint Databases (Extended Abstract) | 1996 | PODS | 4.5435639e-05 |
Previous
Page 1 / 1
Next