Sciweavers

26 search results - page 3 / 6
» Probabilistic Group Nearest Neighbor Queries in Uncertain Da...
Sort
View
EDBT
2009
ACM
207views Database» more  EDBT 2009»
13 years 8 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
2010
IEEE
874views Database» more  ICDE 2010»
14 years 5 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...
MDM
2009
Springer
116views Communications» more  MDM 2009»
13 years 12 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
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 7 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
14 years 6 months ago
Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyria...