Topological queries in spatial databases

DOI10.1006/jcss.1998.1597zbMath0943.68051OpenAlexW2610592248MaRDI QIDQ1305920

Dan Suciu, Victor Vianu, Christos H. Papadimitriou

Publication date: 5 September 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1597

zbMATH Keywords

spatial databasestopological queries

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (9)

Decidability of string graphs ⋮ Reachability and connectivity queries in constraint databases ⋮ Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space ⋮ On the consistency of cardinal direction constraints ⋮ Querying spatial databases via topological invariants ⋮ Complete geometric query languages ⋮ Elementary polyhedral mereotopology ⋮ Combining topological and size information for spatial reasoning ⋮ Composing cardinal direction relations

Uses Software

• Spatial SQL
• Geo-sal

Cites Work

• Computing with infinitary logic
• String graphs. II: Recognizing string graphs is NP-hard
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Intersection graphs of curves in the plane
• Intersection graphs of segments
• Relational expressive power of constraint query languages
• Parallel Algorithms in Graph Theory: Planarity Testing
• On Moschovakis closure ordinals
• How to Draw a Graph
• Convex Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Topological queries in spatial databases