A unified approach to ranking in probabilistic databases

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 502-513

  Li, Jian ^a   Saha, Barna ^a   Deshpande, Amol ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DATABASE SYSTEMS; DECISION MAKING; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; QUERY PROCESSING;

COMPLEX CORRELATION; GENERATING FUNCTIONS; MULTICRITERIA OPTIMIZATION; PROBABILISTIC DATABASE; RANKING FUNCTIONS; TOP-K QUERY PROCESSING; UNCERTAIN DATAS; UNIFIED APPROACH;

INFORMATION RETRIEVAL;

EID: 77952252122     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687685     Document Type: Article

References (39)

1. E. Adar and C. Re. Managing uncertainty in social networks. IEEE Data Eng. Bull., 2007.
2. Periklis Andritsos, Ariel Fuxman, and Renee J. Miller. Clean answers over dirty databases. In ICDE, 2006.
3. G. Beylkin and L. Monzon. On approximation of functions by exponential sums. Applied and Computational Harmonic Analysis, 19:17-48, 2005.
4. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In ICML, pages 89-96, 2005.
5. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
6. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In ICDE, 2009.
7. Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
8. Nilesh Dalvi and Dan Suciu. Management of probabilistic data: Foundations and challenges. In PODS, 2007.
9. O. Dekel, C. Manning, and Y. Singer. Log-linear models for label-ranking. In NIPS 16, 2004.
10. A. Deshpande, C. Guestrin, and S. Madden. Using probabilistic models for data management in acquisitional environments. In CIDR, 2005.
11. Xin Luna Dong, Alon Y. Halevy, and Cong Yu. Data integration with uncertainty. In VLDB, 2007.
12. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In WWW, 2001.
13. Ronald Fagin, Ravi Kumar, and D. Sivakumar. Comparing top k lists. In SODA, 2003.
14. Jensen Finn and Jensen Frank. Optimal junction trees. In UAI, pages 360-366, 1994.
15. N. Fuhr and T. Rolleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. on Info. Syst., 1997.
16. Minos Garofalakis and Dan Suciu, editors. IEEE Data Engineering Bulletin Special Issue on Probabilistic Data Management. March 2006.
17. Todd Green, Grigoris Karvounarakis, and Val Tannen. Provenance semirings. In PODS, pages 31-40, 2007.
18. Todd Green and Val Tannen. Models for incomplete and probabilistic information. In EDBT, 2006.
19. R. Gupta and S. Sarawagi. Creating probabilistic databases from information extraction models. In VLDB, 2006.
20. R. Herbrich, T. Graepel, P. Bollmann-Sdorra, and K. Obermayer. Learning preference relations for information retrieval. In ICML-98 Workshop: Text Categorization and Machine Learning, page 83-86, 1998.
21. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In SIGMOD, 2008.
22. I. Ilyas, G. Beskales, and M. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys, 2008.
23. T. S. Jayram, R. Krishnamurthy, S. Raghavan, S. Vaithyanathan, and H. Zhu. Avatar information extraction system. IEEE Data Eng. Bull., 29(1), 2006.
24. J.F.Hauer, C.J. Demeure, and L.L.Scharf. Initial results in prony analysis of power system response signals. IEEE Transactions on Power Systems, 5(1):80-89, 1990.
25. C. Jin, K. Yi, L. Chen, J. Xu Yu, and X. Lin. Sliding-window top-k queries on uncertain streams. In VLDB, 2008.
26. T. Joachims. Optimizing search engines using click-through data. In Proc. ACM SIGKDD, pages 133-142, 2002.
27. C. Koch. MayBMS: A System for Managing Large Uncertain and Probabilistic Databases. Chapter in Managing and Mining Uncertain Data, C. Aggarwal ed., Springer, 2009.
28. C. Koch and D. Olteanu. Conditioning Probabilistic Databases. In VLDB, pages 313-325, 2008.
29. L. Lakshmanan, N. Leone, R. Ross, and V. S. Subrahmanian. Probview: a flexible probabilistic database system. TODS, 1997.
30. J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. CoRR, abs/0904.1366, 2009.
31. Jian Li and Amol Deshpande. Consensus answers for queries over probabilistic databases. In PODS, 2009.
32. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
33. A. Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In ICDE, 2006.
34. P. Sen, A. Deshpande, and L. Getoor. PrDB: Managing and Exploiting Rich Correlations in Probabilistic Databases. VLDB Journal, 2009.
35. M. Soliman, I. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
36. P. Talukdar et al. Learning to Create Data-Integrating Queries. In VLDB, 2008.
37. J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In CIDR, 2005.
38. K. Yi, F. Li, D. Srivastava, and G. Kollios. Efficient processing of top-k queries in uncertain databases. In ICDE, 2008.
39. Xi Zhang and Jan Chomicki. On the semantics and evaluation of top-k queries in probabilistic databases. In DBRank, 2008.