Skip to main content
SpringerLink
Log in

High Parallel Skyline Computation over Low-Cardinality Domains

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8716))

Abstract

A Skyline query retrieves all objects in a dataset that are not dominated by other objects according to some given criteria. Although there are a few parallel Skyline algorithms on multicore processors, it is still a challenging task to fully exploit the advantages of such modern hardware architectures for efficient Skyline computation. In this paper we present high-performance parallel Skyline algorithms based on the lattice structure generated by a Skyline query. We compare our methods with the state-of-the-art algorithms for multicore Skyline processing. Experimental results on synthetic and real datasets show that our new algorithms outperform state-of-the-art multicore Skyline techniques for low-cardinality domains. Our algorithms have linear runtime complexity and fully play on modern hardware architectures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Proc. of ICDE 2001, pp. 421–430. IEEE, Washington, DC (2001)

    Google Scholar 

  2. Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline Queries, Front and Back. SIGMOD Rec. 42(3), 6–18 (2013)

    Article  Google Scholar 

  3. Mattson, T., Wrinn, M.: Parallel Programming: Can we PLEASE get it right this time? In: Fix, L. (ed.) DAC, pp. 7–11. ACM (2008)

    Google Scholar 

  4. Gustafson, J.L.: Reevaluating Amdahl’s law. Commun. ACM 31(5), 532–533 (1988)

    Article  Google Scholar 

  5. Selke, J., Lofi, C., Balke, W.-T.: Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5982, pp. 246–260. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Im, H., Park, J., Park, S.: Parallel Skyline Computation on Multicore Architectures. Inf. Syst. 36(4), 808–823 (2011)

    Article  MathSciNet  Google Scholar 

  7. Liknes, S., Vlachou, A., Doulkeridis, C., Nørvåg, K.: APSkyline: Improved Skyline Computation for Multicore Architectures. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014, Part I. LNCS, vol. 8421, pp. 312–326. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  8. Morse, M., Patel, J.M., Jagadish, H.V.: Efficient Skyline Computation over Low-Cardinality Domains. In: Proc. of VLDB 2007, pp. 267–278. (2007)

    Google Scholar 

  9. Preisinger, T., Kießling, W.: The Hexagon Algorithm for Evaluating Pareto Preference Queries. In: Proc. of MPref 2007 (2007)

    Google Scholar 

  10. Godfrey, P., Shipley, R., Gryz, J.: Algorithms and Analyses for Maximal Vector Computation. The VLDB Journal 16(1), 5–28 (2007)

    Article  Google Scholar 

  11. Park, S., Kim, T., Park, J., Kim, J., Im, H.: Parallel Skyline Computation on Multicore Architectures. In: Proc. of ICDE 2009, pp. 760–771 (2009)

    Google Scholar 

  12. Lo, E., Yip, K.Y., Lin, K.-I., Cheung, D.W.: Progressive Skylining over Web-accessible Databases. IEEE TKDE 57(2), 122–147 (2006)

    Google Scholar 

  13. Wu, P., Zhang, C., Feng, Y., Zhao, B.Y., Agrawal, D.P., El Abbadi, A.: Parallelizing Skyline Queries for Scalable Distribution. In: Ioannidis, Y., et al. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 112–130. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Hose, K., Vlachou, A.: A Survey of Skyline Processing in Highly Distributed Environments. The VLDB Journal 21(3), 359–384 (2012)

    Article  Google Scholar 

  15. Afrati, F.N., Koutris, P., Suciu, D., Ullman, J.D.: Parallel Skyline Queries. In: Proc. of ICDT 2012, pp. 274–284. ACM, New York (2012)

    Google Scholar 

  16. Cosgaya-Lozano, A., Rau-Chaplin, A., Zeh, N.: Parallel Computation of Skyline Queries. In: Proc. of HPCS 2007, p. 12 (2007)

    Google Scholar 

  17. Park, Y., Min, J.-K., Shim, K.: Parallel Computation of Skyline and Reverse Skyline Queries Using MapReduce. PVLDB 6(14), 2002–(2013)

    Google Scholar 

  18. Vlachou, A., Doulkeridis, C., Kotidis, Y.: Angle-based Space Partitioning for Efficient Parallel Skyline Computation. In: Proc. of SIGMOD 2008, pp. 227–238 (2008)

    Google Scholar 

  19. Köhler, H., Yang, J., Zhou, X.: Efficient Parallel Skyline Processing using Hyperplane Projections. In: Proc. of SIGMOD 2011, pp. 85–96. ACM (2011)

    Google Scholar 

  20. Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N., Shavit, N.: A Lazy Concurrent List-Based Set Algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 3–16. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Bøgh, K.S., Assent, I., Magnani, M.: Efficient GPU-based Skyline computation. In: Proc. of DaMoN, pp. 5:1–5:6. ACM, New York (2013)

    Google Scholar 

  22. Woods, L., Alonso, G., Teubner, J.: Parallel Computation of Skyline Queries. In: Proc. of the FCCM, pp. 1–8. IEEE, Washington, DC (2013)

    Google Scholar 

  23. Pugh, W.: Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33(6), 668–676 (1990)

    Article  MathSciNet  Google Scholar 

  24. Glück, R., Köppl, D., Wirsching, G.: Computational Aspects of Ordered Integer Partition with Upper Bounds. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 79–90. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  25. Shang, H., Kitsuregawa, M.: Skyline Operator on Anti-correlated Distributions. In: Proc. of VLDB 2013 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Augsburg, 86135, Augsburg, Germany

    Markus Endres & Werner Kießling

Authors
  1. Markus Endres
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Kießling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Yannis Manolopoulos

  2. EECS Department, Northwestern University, 2145 Sheridan Road, 60208, Evanston, IL, USA

    Goce Trajcevski

  3. Faculty of Computer Sciences and Engineering, University Ss. Cyril and Methodius Skopje, Rugjer Boshkovikj 16, 1000, Skopje, Macedonia

    Margita Kon-Popovska

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Endres, M., Kießling, W. (2014). High Parallel Skyline Computation over Low-Cardinality Domains. In: Manolopoulos, Y., Trajcevski, G., Kon-Popovska, M. (eds) Advances in Databases and Information Systems. ADBIS 2014. Lecture Notes in Computer Science, vol 8716. Springer, Cham. https://doi.org/10.1007/978-3-319-10933-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10933-6_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10932-9

  • Online ISBN: 978-3-319-10933-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation