Ranking distributed probabilistic data

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 361-373

  Li, Feifei ^a   Yi, Ke ^b   Jestes, Jeffrey ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Distributed query processing; Probabilistic data; Ranking queries; Top k; Uncertain databases

Indexed keywords

ALL DISTRIBUTED; COMMUNICATION COST; DISTRIBUTED QUERY PROCESSING; DISTRIBUTED SENSOR FIELDS; DISTRIBUTED SITES; ECONOMIC COSTS; EFFICIENT ALGORITHM; FUNDAMENTAL PROBLEM; FUZZY INFORMATION; LARGE AMOUNTS OF DATA; MULTIPLE SOURCE; NETWORK DELAYS; POSSIBLE WORLDS; PROBABILISTIC DATA; RANKING QUERIES; SCIENTIFIC DATA; SCIENTIFIC INSTITUTES; SYNTHETIC AND REAL DATA; UNCERTAIN DATABASE; WORK DESIGN;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; DATABASE SYSTEMS; JOB ANALYSIS; QUERY PROCESSING; UNCERTAINTY ANALYSIS;

DATA PROCESSING;

EID: 70849110773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559885     Document Type: Conference Paper

References (37)

1. P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom. Trio: A system for data, uncertainty, and lineage. In VLDB, 2006.
2. L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and simple relational processing of uncertain data. In ICDE, 2008.
3. L. Antova, C. Koch, and D. Olteanu. From complete to incomplete information and back. In SIGMOD, 2007.
4. B. Babcock and C. Olston. Distributed top-k monitoring. In SIGMOD, 2003.
5. J. Boulos, N. Dalvi, B. Mandhani, S. Mathur, C. Re, and D. Suciu. MYSTIQ: a system for finding more answers by using probabilities. In SIGMOD, 2005.
6. P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In PODC, 2004.
7. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, 2003.
8. S. Chaudhuri, L. Gravano, and A. Marian. Optimizing top-k selection queries over multimedia repositories. IEEE TKDE, 16(8):992-1009, 2004.
9. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
10. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: distributed tracking of approximate quantiles. In SIGMOD, 2005.
11. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In ICDE, 2009.
12. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB Journal, 16(4):523-544, 2007.
13. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
14. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
15. GLPK. GNU Linear Programming Kit. http://www.gnu.org/software/glpk/.
16. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In SIGMOD, 2008.
17. R. Huebsch, M. Garofalakis, J. M. Hellerstein, and I. Stoica. Sharing aggregate computation for distributed queries. In SIGMOD, 2007.
18. R. Jampani, F. Xu, M. Wu, L. L. Perez, C. M. Jermaine, and P. J. Haas. MCDB: a monte carlo approach to managing uncertain data. In SIGMOD, 2008.
19. S. Jeyashanker, S. Kashyap, R. Rastogi, and P. Shukla. Efficient constraint monitoring using adaptive thresholds. In ICDE, 2008.
20. B. Kanagal and A. Deshpande. Online filtering, smoothing and probabilistic modeling of streaming data. In ICDE, 2008.
21. C. Koch and D. Olteanu. Conditioning probabilistic databases. In VLDB, 2008.
22. X. Lian and L. Chen. Probabilistic ranked queries in uncertain databases. In EDBT, 2008.
23. V. Ljosa and A. K. Singh. Top-k spatial joins of probabilistic objects. In ICDE, 2008.
24. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In ICDE, 2005.
25. S. Michel, P. Triantafillou, and G. Weikum. KLEE: a framework for distributed top-k query algorithms. In VLDB, 2005.
26. S. Papadimitriou, J. Sun, and C. Faloutsos. Streaming pattern discovery in multiple time-series. In VLDB, 2005.
27. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probalistic databases. In ICDE, 2007.
28. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In ICDE, 2006.
29. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE, 2007.
30. P. Sen, A. Deshpande, and L. Getoor. Exploiting shared correlations in probabilistic databases. In VLDB, 2008.
31. I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring threshold functions over distributed data streams. In SIGMOD, 2006.
32. A. S. Silberstein, R. Braynard, C. Ellis, K. Munagala, and J. Yang. A sampling-based approach to optimizing top-k queries in sensor networks. In ICDE, 2006.
33. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
34. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang. Probabilistic top-k and ranking-aggregate queries. TODS, To Appear, 2008.
35. M. Wu, J. Xu, X. Tang, and W.-C. Lee. Top-k monitoring in wireless sensor networks. IEEE TKDE, 19(7):962-976, 2007.
36. D. Zeinalipour-Yazti, Z. Vagena, D. Gunopulos, V. Kalogeraki, V. Tsotras, M. Vlachos, N. Koudas, and D. Srivastava. The threshold join algorithm for top-k queries in distributed sensor networks. In DMSN, 2005.
37. X. Zhang and J. Chomicki. On the semantics and evaluation of top-k queries in probabilistic databases. In DBRank, 2008.