Sciweavers

34 search results - page 6 / 7
» Voronoi-Based K Nearest Neighbor Search for Spatial Network ...
Sort
View
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
13 years 5 months ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
13 years 10 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 6 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
ISCI
2007
141views more  ISCI 2007»
13 years 5 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 7 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