1923 search results - page 47 / 385 » Ranking in Spatial Databases |
ADBIS
1998
Springer
14 years 2 days ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
SSD
2005
Springer
14 years 1 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 ...
ICMCS
1998
IEEE
14 years 3 days ago
1998
IEEE
In this paper, we present an experimental evaluation of three color-spatial retrieval techniques -- the signaturebased technique, the partition-based algorithm and the cluster-bas...
ICDE
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach fo...
IEAAIE
2003
Springer
14 years 1 months ago
2003
Springer
