Sciweavers

46 search results - page 6 / 10
» Closest Pair Queries in Spatial Databases
Sort
View
CLOUDCOM
2010
Springer
13 years 5 months ago
Voronoi-Based Geospatial Query Processing with MapReduce
Geospatial queries (GQ) have been used in a wide variety of applications such as decision support systems, profile-based marketing, bioinformatics and GIS. Most of the existing qu...
Afsin Akdogan, Ugur Demiryurek, Farnoush Banaei Ka...
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 29 days ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
EDBT
2009
ACM
207views Database» more  EDBT 2009»
13 years 11 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 9 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet