Skyline Queries with Noisy Comparisons

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

Volumn 31, Issue , 2015, Pages 185-198

  Groz, Benoit ^a,b   Milo, Tova ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT;

COMPUTATION MODEL; CROWDSOURCING; HIGH PROBABILITY; MODEL COMPARISON; MULTI-CRITERIA; OPTIMAL PREDICTIONS; OUTPUT-SENSITIVE ALGORITHM; PARTIAL INFORMATION;

DATABASE SYSTEMS;

EID: 84955309366     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2745754.2745775     Document Type: Conference Paper

References (47)

1. F. N. Afrati, P. Koutris, D. Suciu, and J. D. Ullman. Parallel skyline queries. In ICDT, pages 274-284, 2012.
2. P. Afshani. Fast computation of output-sensitive maxima in a word ram. In SODA, pages 1414-1423, 2014.
3. P. Afshani, P. K. Agarwal, L. Arge, K. G. Larsen, and J. M. Phillips. (approximate) uncertain skylines. Theory Comput. Syst., 52(3):342-366, 2013.
4. P. Afshani, J. Barbay, and T. M. Chan. Instance-optimal geometric algorithms. In FOCS, pages 129-138, 2009.
5. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel sets. Combinatorica, 3(1):1-19, 1983.
6. J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica, 9(2):168-183, 1993.
7. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421-430, 2001.
8. M. Braverman and E. Mossel. Noisy sorting without resampling. In SODA, pages 268-276, 2008.
9. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16(4):361-368, 1996.
10. T. M. Chan, K. G. Larsen, and M. Patrascu. Orthogonal range searching on the ram, revisited. In SOCG, pages 1-10, 2011.
11. T. M. Chan and P. Lee. On constant factors in comparison-based geometric algorithms and data structures. In 30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08-11, 2014, page 40, 2014.
12. J. Chomicki, P. Ciaccia, and N. Meneghetti. Skyline queries, front and back. SIGMOD Record, 42(3):6-18, 2013.
13. R. Cole. Parallel merge sort. SIAM J. Comput., 17(4):770-785, 1988.
14. R. Cole. Correction: Parallel merge sort. SIAM J. Comput., 22(6):1349, 1993.
15. S. B. Davidson, S. Khanna, T. Milo, and S. Roy. Using the crowd for top-k and group-by queries. In ICDT, pages 225-236, 2013.
16. U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM J. Comput., 23(5):1001-1018, 1994.
17. P. Godfrey, R. Shipley, and J. Gryz. Algorithms and analyses for maximal vector computation. VLDB J., 16(1):5-28, 2007.
18. N. Goyal and M. Saks. Rounds vs. queries tradeo in noisy computation. Theory of Computing, 6(1):113-134, 2010.
19. S. Guo, A. G. Parameswaran, and H. Garcia-Molina. So who won?: dynamic max discovery with the crowd. In SIGMOD Conference, pages 385-396, 2012.
20. A. Gupta and A. Kumar. Sorting and selection with structured costs. In FOCS, pages 416-425, 2001.
21. A. Gupta and A. Kumar. Where's the winner? max- nding and sorting with metric costs. In APPROX-RANDOM, pages 74-85, 2005.
22. E. Hemaspaandra, L. A. Hemaspaandra, and J. Rothe. Hybrid elections broaden complexity-theoretic resistance to control. CoRR, abs/cs/0608057, 2006.
23. E. Hemaspaandra, H. Spakowski, and J. Vogel. The complexity of kemeny elections. Theor. Comput. Sci., 349(3):382-391, 2005.
24. X. Hu, C. Sheng, Y. Tao, Y. Yang, and S. Zhou. Output-sensitive skyline algorithms in external memory. In SODA, pages 887-900, 2013.
25. Z. Huang, S. Kannan, and S. Khanna. Algorithms for the generalized sorting problem. In FOCS, pages 738-747, 2011.
26. C. Kenyon and V. King. On boolean decision trees with faulty nodes. Random Struct. Algorithms, 5(3):453-464, 1994.
27. M. E. Khalefa, M. F. Mokbel, and J. J. Levandoski. Skyline query processing for incomplete data. In ICDE, pages 556-565, 2008.
28. D. G. Kirkpatrick and R. Seidel. Output-size sensitive algorithms for nding maximal vectors. In SOCG, pages 89-96, 1985.
29. V. Koltun and C. H. Papadimitriou. Approximately dominating representatives. Theor. Comput. Sci., 371(3):148-154, 2007.
30. D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, pages 275-286, 2002.
31. H. T. Kung, F. Luccio, and F. P. Preparata. On nding the maxima of a set of vectors. J. ACM, 22(4):469-476, 1975.
32. F. T. Leighton, Y. Ma, and C. G. Plaxton. Breaking the theta (n log2 n) barrier for sorting with faults. J. Comput. Syst. Sci., 54(2):265-304, 1997.
33. C. Lo , K. E. Maarry, and W.-T. Balke. Skyline queries in crowd-enabled databases. In EDBT, pages 465-476, 2013.
34. A. Marcus, E. Wu, D. R. Karger, S. Madden, and R. C. Miller. Human-powered sorts and joins. PVLDB, 5(1):13-24, 2011.
35. J. Matousek. Computing dominances in en. Inf. Process. Lett., 38(5):277-278, 1991.
36. I. Newman. Computing in fault tolerant broadcast networks and noisy decision trees. Random Struct. Algorithms, 34(4):478-501, 2009.
37. D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30(1):41-82, 2005.
38. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-o s and optimal access of web sources. In FOCS, pages 86-92, 2000.
39. M. Paterson. Improved sorting networks with o(log n) depth. Algorithmica, 5(1):65-92, 1990.
40. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, pages 15-26, 2007.
41. A. Pelc. Searching games with errors- fty years of coping with liars. Theor. Comput. Sci., 270(1-2):71-109, 2002.
42. J. I. Seiferas. Sorting networks of logarithmic depth, further simplified. Algorithmica, 53(3):374-384, 2009.
43. C. Sheng and Y. Tao. Worst-case effiecient skyline algorithms. ACM Trans. Database Syst., 37(4):26, 2012.
44. S. Vassilvitskii and M. Yannakakis. Eciently computing succinct trade-o curves. Theor. Comput. Sci., 348(2-3):334-356, 2005.
45. F. F. Yao. On nding the maximal elements in a set of plane vectors. Technical Report UIUCDCS-R-74-667, University of Illinois, 1974.
46. H. P. Young. Condorcet's Theory of Voting. American Political Science Review, 82:1231-1244, 1988.
47. R. Yuster. Ecient algorithms on sets of permutations, dominance, and real-weighted apsp. In SODA, pages 950-957, 2009.