Sciweavers

627 search results - page 18 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 9 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
PODS
2008
ACM
250views Database» more  PODS 2008»
15 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
15 years 10 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
VLDB
2004
ACM
129views Database» more  VLDB 2004»
15 years 2 months ago
Probabilistic Ranking of Database Query Results
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, ...
PVLDB
2008
81views more  PVLDB 2008»
14 years 9 months ago
On efficiently searching trajectories and archival data for historical similarities
We study the problem of efficiently evaluating similarity queries on histories, where a history is a d-dimensional time
Reza Sherkat, Davood Rafiei