(Approximate) uncertain skylines

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 186-196

  Afshani, Peyman ^a   Agarwal, Pankaj K ^b   Arge, Lars ^c   Larsen, Kasper Green ^c   Phillips, Jeff M ^d  

^a DALHOUSIE UNIVERSITY   (Canada)

^b Duke University   (United States)

^c AARHUS UNIVERSITY   (Denmark)

^d UNIVERSITY OF UTAH   (United States)

Author keywords

Approximation; Skylines; Uncertainty

Indexed keywords

PROBABILITY DISTRIBUTIONS; QUERY PROCESSING;

APPROXIMATION; DISCRETE SETS; EXACT SOLUTION; LINEAR-TIME APPROXIMATION; NEAR-LINEAR TIME; PROBABILITY: DISTRIBUTIONS; QUERY POINTS; SIMPLE++; SKYLINE; UNCERTAINTY;

APPROXIMATION ALGORITHMS;

EID: 79952357435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1938551.1938576     Document Type: Conference Paper

References (31)

1. P. K. Agarwal and M. Sharir. Arrangements of surfaces in higher dimensions. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49-119. North-Holland, 2000.
2. P. Agrawal, O. Benjelloun, A. D. Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom. Trio: A system for data, uncertainty, and lineage. In ACM Symposium on Principles of Database Systems, 2006.
3. M. J. Atallah and Y. Qi. Computing all skyline probabilities for uncertain data. In ACM Symposium on Principles of Database Systems, pages 279-287, 2009.
4. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
5. S. Börzsönyi, D. Kossman, and K. Stocker. The skyline operator. In IEEE International Conference on Data Engineering, 2001.
6. C.-Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. H. Tung, and Z. Zhang. Finding k-dominant skylines in high dimensional space. In ACM-SIGMOD International Conference on Management of Data, 2006.
7. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilitic queries over imprecise data. In ACM-SIGMOD International Conference on Management of Data, 2003.
8. G. Cormode, A. Deligiannakis, M. Garafalakis, and A. McGregor. Probabilistic histograms for probabilistic data. In International Conference on Very Large Data Bases, 2009.
9. G. Cormode and M. Garafalakis. Histograms and wavelets of probabilitic data. In IEEE International Conference on Data Engineering, 2009.
10. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In IEEE International Conference on Data Engineering, 2009.
11. N. Dalvi and D. Suciu. Efficient query evaluation on probabilitic databases. The VLDB Journal, 16:523-544, 2007.
12. A. Das Sarma, A. Lall, D. Nanongkai, R. J. Lipton, and J. Xu. Representative skylines using threshold-based preference distributions. In IEEE International Conference on Data Engineering, 2011.
13. A. Das Sarma, A. Lall, D. Nanongkai, and J. Xu. Randomized mutli-pass streaming skyline algorithms. In International Conference on Very Large Data Bases, 2009.
14. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry Algorithms and Applications. Springer, 2008.
15. H. Edelsbunner, L. J. Guibas, and J. Stolfi. Optimal point location on a monotone subdivision. SIAM Journal of Computing, 15:317-340, 1986. (Pubitemid 16546555)
16. V. Koltun and C. H. Papadimitriou. Approximately dominating representatives. Theoretical Computer Science, 371:148-154, 2007. (Pubitemid 46215855)
17. D. Kossman, F. Ramsak, and S. Rost. Shooting stars in the sky: an optimal algorithm for skyline queries. In International Conference on Very Large Data Bases, 2002.
18. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of ACM, 22(4):469-476, 1975.
19. J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. In International Conference on Very Large Data Bases, 2009.
20. X. Lian and L. Chen. Monochromatic and bichromatic reverse skyline search over uncertain databases. In ACM-SIGMOD International Conference on Management of Data, 2008.
21. M. Löffler and J. M. Phillips. Shape fitting of point sets with probability distributions. In European Symposium on Algorithms, 2009.
22. M. Löffler and J. Snoeyink. Delaunay triangulations of imprecise points in linear time after preprocessing. In Symposium on Computational Geometry, pages 298-304, 2008.
23. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
24. D. Nanongkai, A. Das Sarma, A. Lall, R. J. Lipton, and J. Xu. Regret-minimizing representative databases. In International Conference on Very Large Data Bases, 2010.
25. D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In ACM-SIGMOD International Conference on Management of Data, 2003.
26. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In International Conference on Very Large Data Bases, 2007.
27. F. P. Preparata and M. I. Shamos. Computational Geometry An Introduction. Springer, 1985.
28. K.-L. Tan, P.-K. Eng, and B. C. Ooi. Efficient progressive skyline computation. In International Conference on Very Large Data Bases, 2001.
29. Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In International Conference on Very Large Data Bases, 2005.
30. D. E. Willard. New data structures for orthogonal range queries. SIAM Journal of Computing, 14(1):232-253, 1985.
31. W. Zhang, X. Lin, Y. Zhang, W. Wang, and J. X. Yu. Probabilistic skyline operator over sliding windows. In IEEE International Conference on Data Engineering, 2009.