Optimizing probabilistic query processing on continuous uncertain data

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 1169-1180

  Peng, Liping ^a   Diao, Yanlei ^a   Liu, Anna ^b  

^a University of Massachusetts Amherst   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; INFORMATION MANAGEMENT;

AND JOINS; DATASTREAM SYSTEMS; EVALUATION RESULTS; EXISTENCE PROBABILITIES; MANAGEMENT IS; PROBABILISTICS; SCIENTIFIC DATA; SCIENTIFIC DATABASE; THRESHOLD QUERIES; UNCERTAIN DATAS;

QUERY PROCESSING;

EID: 84863758445     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402751     Document Type: Conference Paper

References (21)

1. R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. In SIGMOD, 261-272, 2000.
2. N. Beckmann, H.-P. Kriegel, et al. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD, 322-331, 1990.
3. O. Benjelloun, A. D. Sarma, et al. Uldbs: Databases with uncertainty and lineage. In VLDB, 953-964, 2006.
4. P. Bizarro, S. Babu, et al. Content-based routing: different plans for different data. In VLDB, 757-768, 2005.
5. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
6. S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. In ACM TODS, 24(2):177-228, 1999.
7. R. Cheng, S. Singh, et al. Efficient join processing over uncertain data. In CIKM, 738-747, 2006.
8. R. Cheng, Y. Xia, et al. Efficient indexing methods for probabilistic threshold queries over uncertain data. In VLDB, 876-887, 2004.
9. P. Cudŕe-Mauroux, H. Kimura, et al. A demonstration of SciDB: A science-oriented dbms. PVLDB, 2(2):1534-1537, 2009.
10. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523-544, 2007.
11. M. Geoffrey and P. David. Finite Mixture Models. Wiley, 2000.
12. J. Li and A. Deshpande. Ranking continuous probabilistic datasets. PVLDB, 3(1):638-649, 2010.
13. L. Peng, Y. Diao, et al. Optimizing Probabilistic Query Processing. UMass Tech Report. http://claro.cs.umass.edu/pubs/tr11.pdf.
14. Y. Qi, R. Jain, S. Singh, et al. Threshold query optimization for uncertain data. In SIGMOD, 315-326, 2010.
15. N. Ravishanker and D.K. Dey. A first course in linear model theory. Chapman & Hall/CRC, 2002.
16. S. Singh, C. Mayfield, et al. Database support for probabilistic attributes and tuples. In ICDE, 1053-1061, 2008.
17. D. Suciu, A. Connolly, et al. Embracing uncertainty in large-scale computational astrophysics. In MUD Workshop, 2009.
18. A. S. Szalay, et al. Designing and mining multi-terabyte astronomy archives: The sloan digital sky survey. In SIGMOD, 451-462, 2000.
19. T. T. L. Tran, et al. Conditioning and aggregating uncertain data streams: Going beyond expectations. PVLDB, 3(1):1302-1313, 2010.
20. T. T. L. Tran, L. Peng, et al. Pods: a new model and processing algorithms for uncertain data streams. In SIGMOD, 159-170, 2010.
21. D. Z. Wang, E. Michelakis, et al. Bayesstore: Managing large, uncertain data repositories with probabilistic graphical models. In VLDB, 340-351, 2008.