Database Reference
In-Depth Information
Garrett Wolf, Aravind Kalavagattu, Hemal Khatri, Raju Balakrishnan, Bhaumik Chokshi, Jianchun
Fan, Yi Chen, and Subbarao Kambhampati. Query processing over incomplete autonomous
databases: query rewriting using learned data dependencies. Very Large Data Bases J. , 18(5):
1167-1190, 2009. DOI: 10.1007/s00778-009-0155-0 Cited on page(s) 13
Fei Xu, Kevin S. Beyer, Vuk Ercegovac, Peter J. Haas, and Eugene J. Shekita. E = mc 3 : managing
uncertain enterprise data in a cluster-computing environment. In Proc. ACM SIGMOD Int. Conf.
onManagement of Data , pages 441-454, 2009. DOI: 10.1145/1559845.1559893 Cited on page(s)
11 , 134
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, and Ge Yu. Efficient and effective similarity search
over probabilistic data based on earth mover's distance. Proc. Very Large Data Bases , 3:758-769,
2010. Cited on page(s) 13
Qin Zhang, Feifei Li, and Ke Yi. Finding frequent items in probabilistic data. In Proc. ACM SIG-
MOD Int. Conf. on Management of Data , pages 819-832, 2008. DOI: 10.1145/1376616.1376698
Cited on page(s) 12
Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang 0011, and Jeffrey Xu Yu. Probabilistic skyline
operator over sliding windows. In Proc. 25th IEEE Int. Conf. on Data Eng. , pages 1060-1071,
2009. DOI: 10.1109/ICDE.2009.83 Cited on page(s) 13
Xi Zhang and Jan Chomicki. On the semantics and evaluation of top-k queries in probabilis-
tic databases. In Proc. 24th IEEE Int. Conf. on Data Eng. (Workshops) , pages 556-563, 2008.
DOI: 10.1109/ICDEW.2008.4498380 Cited on page(s) 13
Esteban Zimányi. Query evaluation in probabilistic relational databases. Theor. Comput. Sci. , 171
(1-2):179-219, 1997. DOI: 10.1016/S0304-3975(96)00129-6 Cited on page(s) 13
Zhaonian Zou, Jianzhong Li, Hong Gao, and Shuo Zhang. Finding top-k maximal cliques
in an uncertain graph. In Proc. 26th IEEE Int. Conf. on Data Eng. , pages 649-652, 2010.
DOI: 10.1109/ICDE.2010.5447891 Cited on page(s) 12
Search WWH ::




Custom Search