Sciweavers

90 search results - page 5 / 18
» Continuous obstructed nearest neighbor queries in spatial da...
Sort
View
TKDE
2010
185views more  TKDE 2010»
13 years 6 months ago
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 9 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras
GIS
2005
ACM
14 years 8 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 2 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 2 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa