Sciweavers

31 search results - page 1 / 7
» Efficient Processing of 3-Sided Range Queries with Probabili...
Sort
View
ICDT
2010
ACM
127views Database» more  ICDT 2010»
14 years 2 months ago
Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees
Alexis Kaporis, Apostolos Papadopoulos, Spyros Sio...
WAIM
2009
Springer
13 years 11 months ago
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Li...
CIKM
2006
Springer
13 years 8 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
DOLAP
2005
ACM
13 years 6 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 6 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...