Querying spatial databases via topological invariants
From MaRDI portal
Publication:1591156
DOI10.1006/jcss.2000.1712zbMath0963.68058MaRDI QIDQ1591156
Publication date: 19 December 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
A representation independent language for planar spatial databases with Euclidean distance, An Ehrenfeucht-Fraïssé game approach to collapse results in database theory, Reachability and connectivity queries in constraint databases, Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space, On the expressiveness of linear-constraint query languages for spatial databases, The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of elementary algebra and geometry
- 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
- An optimal lower bound on the number of variables for graph identification
- Topological queries in spatial databases
- Finitely representable databases
- Queries with arithmetical constraints
- Computing with first-order logic
- Infinitary logic and inductive definability over finite structures
- On monadic NP vs monadic co-NP
- Relational queries computable in polynomial time
- Relational expressive power of constraint query languages