1542 search results - page 30 / 309 » Redundancy in Spatial Databases |
PODS
2000
ACM
13 years 12 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
We consider spatial databases and queries definable using first-order logic and real polynomial inequalities. We are interested in topological queries: queries whose result only ...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
The update transactions to be executed in spatial databases have been usually known as interactive and long duration works. When a spatial object has a very large geometry of which...
GIS
1995
ACM
13 years 11 months ago
1995
ACM
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
DATAMINE
2000
13 years 7 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...