Sciweavers

29 search results - page 2 / 6
» Adaptive nearest neighbor queries in travel time networks
Sort
View
DEXA
2007
Springer
173views Database» more  DEXA 2007»
13 years 11 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
Fuyu Liu, Kien A. Hua, Tai T. Do
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 6 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 5 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
DNIS
2010
Springer
250views Database» more  DNIS 2010»
13 years 11 months ago
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
ICDE
2010
IEEE
874views Database» more  ICDE 2010»
14 years 4 months ago
UV-Diagram: A Voronoi Diagram for Uncertain Data
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...
Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...