46 search results - page 1 / 10 » Closest Pair Queries in Spatial Databases |
SIGMOD
2000
ACM
13 years 8 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...
ADBIS
2001
Springer
13 years 8 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
PCI
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
ICDE
2011
IEEE
12 years 10 months ago
2011
IEEE
EDBT
2004
ACM
14 years 4 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...