Sciweavers

610 search results - page 9 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
15 years 3 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
CDB
2004
Springer
158views Database» more  CDB 2004»
15 years 1 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
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
SIGMOD
2002
ACM
87views Database» more  SIGMOD 2002»
15 years 10 months ago
Efficient evaluation of queries in a mediator for WebSources
Vladimir Zadorozhny, Louiqa Raschid, Maria-Esther ...
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 10 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