610 search results - page 42 / 122 » Efficient Query Evaluation on Probabilistic Databases |
188
click to vote
SIGMOD
2006
ACM
16 years 20 days ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
111
click to vote
KDD
1998
ACM
15 years 4 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
103
Voted
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
93
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
202
Voted
VLDB
2004
ACM
16 years 23 days ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...