Sciweavers

85 search results - page 5 / 17
» Top-k Query Processing in Uncertain Databases
Sort
View
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
14 years 7 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 7 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
12 years 11 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
EDBT
2009
ACM
173views Database» more  EDBT 2009»
14 years 4 days ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
VLDB
1999
ACM
127views Database» more  VLDB 1999»
13 years 11 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano