1Chang R,Kalashnikov D V,Prabhakar S. Evaluating probabilistic queries over imprecise data[A].New York:ACM,2003.551-562.
2Pei J,Jiang B,Lin X. Probabilistic skylines on uncertain data[A].New York:ACM,2007.15-26.
3Atallah M J,Qi Y. Computing all skyline probabilities for uncertain data[A].New York:ACM,2009.279-287.
4Christian B,Frank F,Annahita O. Probabilistic skyline queries[A].New York:ACM,2009.651-660.doi:10.1016/j.semcdb.2011.03.002.
5Bohm C,Pryakhin A,Schubert M. The Gauss-tree:Efficient object identification in databases of probabilistic feature vectors[A].Piscataway,NJ:IEEE,2006.9-20.doi:10.1007/s11745-011-3596-3.
6Ding X F,Jin H. Efficient and progressive algorithms for distributed skyline queries over uncertain data[A].Piscataway,NJ:IEEE,2010.149-158.
7Zhang W J,Lin X M,Zhang Y. Probahilistic skyline operator over sliding windows[A].Piscataway,NJ:IEEE,2009.1060-1071.
8Re C,Dalvi N N,Suciu D. Efficient top-k query evaluation on prohabilistic data[A].Piscataway,NJ:IEEE,2007.886-895.doi:10.1016/j.mehy.2011.07.039.
9Soliman M A,Ilyas I F,Chang K C. Top-k query processing in uncertain databases[A].Piscataway,NJ:IEEE,2007.895-905.
10Yi K,Li F,Kollios G. Efficient processing of top-k queries in uncertain databases[A].Piscataway,NJ:IEEE,2008.1669-1682.
