Consensus answers for queries over probabilistic databases

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 259-268

  Li, Jian ^a   Deshpande, Amol ^a  

^a University of Maryland ^*  (United States)

Author keywords

Consensus answers; Probabilistic and xor tree; Probabilistic databases; Query processing; Rank aggregation

Indexed keywords

AGGREGATE QUERIES; CONSENSUS ANSWERS; DISTANCE METRICS; EXPECTED DISTANCE; INCONSISTENT INFORMATION; NP-HARDNESS; POLYNOMIAL-TIME; POSSIBLE WORLDS; PROBABILISTIC AND/XOR TREE; PROBABILISTIC DATABASE; PROBABILISTIC DATABASES; RANK AGGREGATION; RANKING QUERIES; TREE MODELS;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 70350660784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559795.1559835     Document Type: Conference Paper

References (46)

1. Nir Ailon. Aggregation of partial rankings, p-ratings and top-m lists. In SODA, pages 415-424, 2007.
2. Nir Ailon, Moses Charikar, and Alantha Newman. Aggregating inconsistent information: Ranking and clustering. In J.ACM, volume 55(5), 2008.
3. Periklis Andritsos, Ariel Fuxman, and Renee J. Miller. Clean answers over dirty databases. In ICDE, 2006.
4. L. Antova, C. Koch, and D. Olteanu. From complete to incomplete information and back. In SIGMOD, 2007.
5. B., H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE TKDE, 1992.
6. G. Beskales, M. Soliman, and I. Ilyas. Efficient search for the top-k probable nearest neighbors in uncertain databases. In VLDB, 2008.
7. J. C. Borda. Mémoire sur les élections au scrutin. Histoire de l'Acadé Royale des Sciences, 1781.
8. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
9. M. J. Condorcet. Éssai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. 1785.
10. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In ICDE, 2009.
11. G. Cormode and A. McGregor. Approximation algorithms for clustering uncertain data. In PODS, 2008.
12. Graham Cormode and Minos Garofalakis. Histograms and wavelets on probabilistic data. In ICDE, 2009.
13. N. Dalvi and D. Suciu. Management of probabilistic data: Foundations and challenges. In PODS, 2007.
14. Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
15. A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
16. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of the Tenth International Conference on the World Wide Web (WWW), pages 613-622, 2001.
17. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation revisited. In Manuscript, 2001.
18. Ronald Fagin, Ravi Kumar, and D. Sivakumar. Comparing top k lists. SIAM J. Discrete Mathematics, 17(1):134-160, 2003.
19. N. Fuhr and T. Rolleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. on Info. Syst., 1997.
20. Gosta Grahne. Horn tables - an efficient tool for handling incomplete information in databases. In PODS, 1989.
21. Todd Green, Grigoris Karvounarakis, and Val Tannen. Provenance semirings. In PODS, pages 31-40, 2007.
22. Todd Green and Val Tannen. Models for incomplete and probabilistic information. In EDBT, 2006.
23. Rahul Gupta and Sunita Sarawagi. Creating probabilistic databases from information extraction models. In VLDB, Seoul, Korea, 2006.
24. J. Hodge and R. E. Klima. The mathematics of voting and elections: a hands-on approach. AMS, 2000.
25. M. Hua, J. Pei, W. Zhang, and X. Lin. Efficiently answering probabilistic threshold top-k queries on uncertain data. In ICDE, 2008.
26. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In SIGMOD, 2008.
27. T. Imielinski and W. Lipski, Jr. Incomplete information in relational databases. Journal of the ACM, 1984.
28. T. S. Jayram, A. McGregor, S. Muthukrishnan, and E. Vee. Estimating statistical aggregates on probabilistic data streams. In PODS, 2007.
29. J. G. Kemeny. Mathematics without numbers. Daedalus, 88:571-591, 1959.
30. L. Lakshmanan, N. Leone, R. Ross, and V. S. Subrahmanian. Probview: a flexible probabilistic database system. ACM Trans. on DB Syst., 1997.
31. Jian Li, Barna Saha, and Amol Deshpande. A unified approach to ranking in probabilistic databases. http://arxiv.org/abs/0904.1366, 2009.
32. M.H.Alsuwaiyel. Algorithms: Design Techniques and Analysis. World Scienfic, 1998.
33. S. Micali and V. Vazirani. An o(sqrt(|v|)|e|) algorithm for finding maximum matching in general graphs. In FOCS, 1980.
34. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
35. C. Ré and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, 2007.
36. Christopher Re and Dan Suciu. Materialized views in probabilistic databases for information exchange and query optimization. In VLDB, Vienna, Austria, 2007.
37. A. Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In ICDE, 2006.
38. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE, 2007.
39. Prithviraj Sen, Amol Deshpande, and Lise Getoor. Exploiting shared correlations in probabilistic databases. In VLDB, 2008.
40. M. Soliman, I. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
41. Mohamed A. Soliman and Ihab F. Ilyas. Ranking with uncertain scores. In ICDE, 2009.
42. Y. Wakabayashi. The complexity of computing medians of relations. In Resenhas, volume 3(3), pages 323-349, 1998.
43. D. Wang, E. Michelakis, M. Garofalakis, and J. M. Hellerstein. BayesStore: Managing large, uncertain data repositories with probabilistic graphical models. In VLDB, 2008.
44. J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In CIDR, 2005.
45. Ke Yi, Feifei Li, Divesh Srivastava, and George Kollios. Efficient processing of top-k queries in uncertain databases. In ICDE, 2008.
46. Xi Zhang and Jan Chomicki. On the semantics and evaluation of top-k queries in probabilistic databases. In DBRank, 2008.