Name
Abstract | ||
|---|---|---|
Uncertain data management is becoming increasingly important in many applications, in particular, in scientific databases and data stream systems. Uncertain data in these new environments is naturally modeled by continuous random variables. An important class of queries uses complex selection and join predicates and requires query answers to be returned if their existence probabilities pass a threshold. In this work, we optimize threshold query processing for continuous uncertain data by (i) expediting joins using new indexes on uncertain data, (ii) expediting selections by reducing dimensionality of integration and using faster filters, and (iii) optimizing a query plan using a dynamic, per-tuple based approach. Evaluation results using real-world data and benchmark queries show the accuracy and efficiency of our techniques and significant performance gains over a state-of-the-art threshold query optimizer. |
Year | Venue | Field |
|---|---|---|
2011 | PROCEEDINGS OF THE VLDB ENDOWMENT | Query optimization,Data mining,Joins,Data stream,Computer science,Expediting,Uncertain data,Curse of dimensionality,Probabilistic logic,Database,Query plan |
DocType | Volume | Issue |
Journal | 4 | 11 |
ISSN | Citations | PageRank |
2150-8097 | 0 | 0.34 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liping Peng | 1 | 107 | 7.50 |
| Yanlei Diao | 2 | 2234 | 108.95 |
| Anna Liu | 3 | 441 | 34.75 |