2298 search results - page 55 / 460 » Querying spatial patterns |
120
click to vote
SIGMOD
2000
ACM
15 years 4 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
131
click to vote
JCDL
2003
ACM
15 years 5 months ago
2003
ACM
The increasing power of techniques to model complex geometry and extract meaning from 3D information create complex data that must be described, stored, and displayed to be useful...
81
Voted
CDB
1997
Springer
15 years 4 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
124
Voted
SSD
2005
Springer
15 years 6 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
182
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...