Sciweavers

Share
46 search results - page 1 / 10
» Closest Pair Queries in Spatial Databases
Sort
View
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
10 years 1 months ago
Closest Pair Queries in Spatial Databases
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...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
10 years 1 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
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...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
PCI
2005
Springer
10 years 3 months ago
Closest Pair Queries with Spatial Constraints
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...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
ICDE
2011
IEEE
382views Database» more  ICDE 2011»
9 years 3 months ago
A Unified Approach for Computing Top-k Pairs in Multidimensional Space
Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Ji...
EDBT
2004
ACM
126views Database» more  EDBT 2004»
10 years 9 months ago
Spatial Queries in the Presence of Obstacles
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...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
books