We study topological queries over two-dimensional spatial databases. First, we show that the topological properties of semialgebraic spatial regions can be completely specified using a classical finite structure, essentially the embedded planar graph of the region boundaries. This provides an invari
Consistency of spatial database query results
β Scribed by Michel Mainguenaud
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 775 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0198-9715
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory. We show that, if the query size (or the number of variables in the query) is considered as a parameter, then the relational calculus and its fragments (conjunctive queri
The method invocation mechanism is one of the essential features in object-oriented programming languages. This mechanism contributes to data encapsulation and code reuse, but there is a risk of a run-time type error. In the case of object-oriented databases (OODBs), a run-time error causes rollback