skip to main content
10.1145/1989323.1989333acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Efficient parallel skyline processing using hyperplane projections

Authors Info & Claims
Published:12 June 2011Publication History

ABSTRACT

The skyline of a set of multi-dimensional points (tuples) consists of those points for which no clearly better point exists in the given set, using component-wise comparison on domains of interest. Skyline queries, i.e., queries that involve computation of a skyline, can be computationally expensive, so it is natural to consider parallelized approaches which make good use of multiple processors. We approach this problem by using hyperplane projections to obtain useful partitions of the data set for parallel processing. These partitions not only ensure small local skyline sets, but enable efficient merging of results as well. Our experiments show that our method consistently outperforms similar approaches for parallel skyline computation, regardless of data distribution, and provides insights on the impacts of different optimization strategies.

References

  1. W.-T. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed skylining for web information systems. In EDBT, pages 256--273, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors and applications. J. ACM, 25(4):536--543, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comput. Syst. Sci., 7(4):448--461, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. J. Carey and D. Kossmann. On saying 'Enough Already!' in SQL. In SIGMOD, pages 219--230, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In ICDE, pages 717--719, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. Cosgaya-Lozano, A. Rau-Chaplin, and N. Zeh. Parallel computation of skyline queries. In 21st International Symposium on High Performance Computing Systems and Applications (HPCS), page 12, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Cui, H. Lu, Q. Xu, L. Chen, Y. Dai, and Y. Zhou. Parallel distributed processing of constrained skyline queries by filtering. In ICDE, pages 546--555, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. In 6th Symposium on Operating System Design and Implementation (OSDI), pages 137--150, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In 9th Annual Symposium on Computational Geometry (SCG), pages 298--307, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Gao, G. Chen, L. Chen, and C. Chen. Parallelizing progressive computation for skyline queries in multi-disk environment. In DEXA, pages 697--706, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In VLDB, pages 229--240, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Z. Huang, C. S. Jensen, H. Lu, and B. C. Ooi. Skyline queries against mobile lightweight devices in manets. In ICDE, page 66, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: an online algorithm for skyline queries. In VLDB, pages 275--286, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. J. ACM, 22(4):469--476, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Matousek. Computing dominances in en (short communication). Information Processing Letters, 38(5):277--278, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In SIGMOD, pages 467--478, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. TODS, 30(1):41--82, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. Park, T. Kim, J. Park, J. Kim, and H. Im. Parallel skyline computation on multicore architectures. In ICDE, pages 760--771, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C. Kozyrakis. Evaluating mapreduce for multi-core and multiprocessor systems. In IEEE 13th International Symposium on High Performance Computer Architecture (HPCA), pages 13--24, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM, pages 161--172, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. K.-L. Tan, P.-K. Eng, and B. C. Ooi. Efficient progressive skyline computation. In VLDB, pages 301--310, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Vlachou, C. Doulkeridis, and Y. Kotidis. Angle-based space partitioning for efficient parallel skyline computation. In SIGMOD, pages 227--238, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Wang, B. C. Ooi, and A. K. H. Tung. Efficient skyline query processing on peer-to-peer networks. In ICDE, pages 1126--1135, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  25. P. Wu, C. Zhang, Y. Feng, B. Y. Zhao, D. Agrawal, and A. E. Abbadi. Parallelizing skyline queries for scalable distribution. In EDBT, pages 112--130, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. H. Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-reduce-merge: simplified relational data processing on large clusters. In SIGMOD, pages 1029--1040, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient parallel skyline processing using hyperplane projections

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
      June 2011
      1364 pages
      ISBN:9781450306614
      DOI:10.1145/1989323

      Copyright © 2011 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 June 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader