skip to main content
10.1145/2247596.2247665acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbtConference Proceedingsconference-collections
tutorial

Distributed skyline processing: a trend in database research still going strong

Authors Info & Claims
Published:27 March 2012Publication History

ABSTRACT

During the last decade, data management and storage have become increasingly distributed. In consideration of the huge amount of data available in such systems, advanced query operators, such as skyline queries, are necessary to help users process the data. For example, a user who is interested in buying a car wants to find a good trade-off between minimum age and minimum price. It is not obvious how much cheaper a car should be, if it is one year older than another car. Thus, the skyline query will retrieve a set of data items that are the best trade-offs for the user's preferences. The skyline operator has been proposed about a decade ago, but research on skyline queries, especially in distributed scenarios, is still an ongoing process.

Query processing in distributed environments poses inherent challenges and requires non-traditional techniques due to the distribution of content and the lack of global knowledge. In this tutorial, we will outline the objectives and the main principles that any distributed skyline approach has to fulfill, leading to useful guidelines for the design of efficient distributed skyline algorithms. More importantly, distributed processing of other query types share the same objectives and principles, therefore several of the guidelines are applicable also for other query types. Furthermore, this tutorial will provide a broad survey of the state-of-the-art in distributed skyline processing, present a categorization of the existing approaches based on their characteristics, and point out open research challenges in distributed skyline processing.

References

  1. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--432, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Chen, B. Cui, and H. Lu. Constrained skyline query processing against distributed data sites. TKDE, 23(2):204--217, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Chen, B. Cui, H. Lu, L. Xu, and Q. Xu. iSky: Efficient and progressive skyline computing in a structured P2P network. In ICDCS, pages 160--167, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Cui, L. Chen, L. Xu, H. Lu, G. Song, and Q. Xu. Efficient skyline computation in structured peer-to-peer systems. TKDE, 21(7):1059--1072, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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
  6. K. Fotiadou and E. Pitoura. BITPEER: continuous subspace skyline computation with distributed bitmap indexes. In DaMaP, pages 35--42, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Hose, C. Lemke, and K. Sattler. Processing Relaxed Skylines in PDMS Using Distributed Data Summaries. In CIKM, pages 425--434, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Hose, C. Lemke, K. Sattler, and D. Zinn. A relaxed but not necessarily constrained way from the top to the sky. In CoopIS, pages 339--407, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Hose and A. Vlachou. A survey of skyline processing in highly distributed environments. VLDB Journal, pages 1--26. 10.1007/s00778-011-0246-6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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
  11. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of the ACM, 22(4):469--476, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Li, Q. Tan, and W. Lee. Efficient progressive processing of skyline queries in peer-to-peer systems. In Infoscale, page 26, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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
  14. J. Pei, W. Jin, M. Ester, and Y. Tao. Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In VLDB, pages 253--264, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. B. Rocha-Junior, A. Vlachou, C. Doulkeridis, and K. Nørvåg. AGiDS: A grid-based strategy for distributed skyline query processing. In Globe, pages 12--23, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. B. Rocha-Junior, A. Vlachou, C. Doulkeridis, and K. Nørvåg. Efficient execution plans for distributed skyline query processing. In EDBT, pages 271--282, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis. SKYPEER: Efficient subspace skyline computation over distributed data. In ICDE, pages 416--425, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  19. A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis. Efficient routing of subspace skyline queries over highly distributed data. TKDE, 22(12):1694--1708, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Wang, B. Ooi, A. Tung, and L. Xu. Efficient skyline query processing on peer-to-peer networks. In ICDE, pages 1126--1135, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  21. S. Wang, Q. H. Vu, B. C. Ooi, A. K. Tung, and L. Xu. Skyframe: a framework for skyline query processing in peer-to-peer systems. VLDB Journal, 18(1):345--362, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. P. Wu, C. Zhang, Y. Feng, B. Zhao, D. Agrawal, and A. Abbadi. Parallelizing Skyline Queries for Scalable Distribution. In EDBT, pages 112--130, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Y. Yuan, X. Lin, Q. Liu, W. Wang, J. X. Yu, and Q. Zhang. Efficient computation of the skyline cube. In VLDB, pages 241--252, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. L. Zhu, Y. Tao, and S. Zhou. Distributed skyline retrieval with low bandwidth consumption. TKDE, 21(3):384--400, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Distributed skyline processing: a trend in database research still going strong

        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 Other conferences
          EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology
          March 2012
          643 pages
          ISBN:9781450307901
          DOI:10.1145/2247596

          Copyright © 2012 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 27 March 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • tutorial

          Acceptance Rates

          Overall Acceptance Rate7of10submissions,70%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader