Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data 2000
DOI: 10.1145/342009.335414
|View full text |Cite
|
Sign up to set email alerts
|

Closest pair queries in spatial databases

Abstract: 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 different algorithms (four recursive and one iterative) are presented for solving this problem. The case of 1 closest pair is treated as a special case. An extensive study, based on experiments performed with synthetic as well as with real point data sets, is presented.A wide range of values for the basic parameters affecting the performance… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
149
0

Year Published

2001
2001
2005
2005

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 137 publications
(150 citation statements)
references
References 21 publications
1
149
0
Order By: Relevance
“…An application on their hint mechanism was to design a hybrid replacement strategy, combining the LRU and MRU page replacement policies. There are several studies on spatial queries involving more than one R-tree, and most of them examine the use of buffering to reduce the I/O activity [3,5,7,11,12,17].…”
Section: Related Work and Motivationmentioning
confidence: 99%
See 4 more Smart Citations
“…An application on their hint mechanism was to design a hybrid replacement strategy, combining the LRU and MRU page replacement policies. There are several studies on spatial queries involving more than one R-tree, and most of them examine the use of buffering to reduce the I/O activity [3,5,7,11,12,17].…”
Section: Related Work and Motivationmentioning
confidence: 99%
“…Metrics (MINIMINDIST, MINMAXDIST and MAXMAXDIST) and properties between two MBRs in the k-dimensional Euclidean space were proposed for the 1-CPQ and K-CPQ in [5] as bounds for the branch-and-bound (recursive and non-recursive) algorithms. The recursive branch-and-bound algorithm (with a synchronous traversal, following a depth-first search strategy) for processing the 1-CPQ between two sets of points stored in two R-trees with the same height can be described by the following steps:…”
Section: Algorithms For Closest Pairs Queriesmentioning
confidence: 99%
See 3 more Smart Citations