Sciweavers

785 search results - page 10 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 9 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
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 5 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
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 7 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002