Sciweavers

493 search results - page 12 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
ICDM
2010
IEEE
130views Data Mining» more  ICDM 2010»
13 years 5 months ago
Using Taxonomies to Perform Aggregated Querying over Imprecise Data
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
Atanu Roy, Chandrima Sarkar, Rafal A. Angryk
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
EDBT
2008
ACM
113views Database» more  EDBT 2008»
14 years 7 months ago
Ensuring correctness over untrusted private database
In this paper we address the problem of ensuring the correctness of query results returned by an untrusted private database. The database owns the data and may modify it at any ti...
Sarvjeet Singh, Sunil Prabhakar