Skip to main content
SpringerLink
Log in

A Partitioning Approach for Skyline Queries in Presence of Partial and Dynamic Orders

  • Chapter
  • First Online:
Transactions on Large-Scale Data- and Knowledge-Centered Systems XLIX

Part of the book series: Lecture Notes in Computer Science ((TLDKS,volume 12920))

  • 156 Accesses

Abstract

Consider the case of tourists looking for flight tickets. While one may assume that every tourist does prefer lower price, the preference among the airline companies is on the one hand partial, i.e., some companies may be incomparable, and on the other hand, it is dynamic in the sense that users have different preferences among the companies. In this paper, we address the problem of answering skyline queries in the presence of such partially and dynamically ordered attributes. The main idea of our solution consists in decomposing each query into a set of independent sub-queries with respect to the user’s preference. Our contribution is twofold: (i) we propose an algorithm exploiting the above property to evaluate skyline queries on the fly and (ii) a pre-materialization of some sub-queries in order to optimize a query workload. We demonstrate empirically the efficiency of our proposals regarding its direct competitors.

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 EPUB and 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

Notes

  1. 1.

    https://github.com/DynamicPartialSky/dySky.

  2. 2.

    We use the term order for ordering just a single pair of values.

  3. 3.

    https://github.com/karimalami7/dySky.

References

  1. Afrati, F.N., Koutris, P., Suciu, D., Ullman, J.D.: Parallel skyline queries. Theory Comput. Syst. 57(4), 1008–1037 (2015)

    Article  MathSciNet  Google Scholar 

  2. Balke, W.-T., Güntzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: Bertino, E., et al. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24741-8_16

    Chapter  Google Scholar 

  3. Bartolini, I., Ciaccia, P., Patella, M.: Efficient sort-based skyline evaluation, 33, 31 (2008)

    Google Scholar 

  4. Bernhard, K., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Heidelberg (2005, 2008)

    Google Scholar 

  5. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of ICDE Conference, pp. 421–430 (2001)

    Google Scholar 

  6. Chan, C.Y., Eng, P.K., Tan, K.L.: Stratified computation of skylines with partially-ordered domains. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 203–214. ACM (2005)

    Google Scholar 

  7. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of ICDE Conference, pp. 717–719 (2003)

    Google Scholar 

  8. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting: Theory and optimizations. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds.) Intelligent Information Processing and Web Mining, vol. 31, pp. 595–604. Springer, Heidelberg (2005). https://doi.org/10.1007/3-540-32392-9_72

    Chapter  Google Scholar 

  9. Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 229–240. VLDB Endowment (2005)

    Google Scholar 

  10. Greenberg, H.: A dynamic programming solution to integer linear programs. J. Math. Anal. Appl. 26(2), 454–459 (1969)

    Article  MathSciNet  Google Scholar 

  11. Hsueh, Y.-L., Hascoet, T.: Caching support for skyline query processing with partially ordered domains. IEEE Trans. Knowl. Data Eng. 26(11), 2649–2661 (2014)

    Article  Google Scholar 

  12. Hsueh, Y.-L., Lin, C.-C., Chang, C.-C.: An efficient indexing method for skyline computations with partially ordered domains. IEEE Trans. Knowl. Data Eng. 29, 963–976 (2017)

    Article  Google Scholar 

  13. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 275–286. VLDB Endowment (2002)

    Google Scholar 

  14. Lee, J., Hwang, S.-W.:. Bskytree: scalable skyline computation using a balanced pivot selection. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 195–206. ACM (2010)

    Google Scholar 

  15. Lee, J., Hwang, S.-W.: Scalable skyline computation using a balanced pivot selection technique. Inf. Syst. 39, 1–21 (2014)

    Article  Google Scholar 

  16. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467–478. ACM (2003)

    Google Scholar 

  17. Sacharidis, D., Papadopoulos, S., Papadias, D.: Topologically sorted skylines for partially ordered domains. In: IEEE 25th International Conference on Data Engineering, ICDE’09, pp. 1072–1083. IEEE (2009)

    Google Scholar 

  18. Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory, vol. 6. JHU Press, Baltimore (1992)

    MATH  Google Scholar 

  19. Wong, R.C.-W., Pei, J., Fu, A.W.-C., Wang, K.: Online skyline analysis with dynamic preferences on nominal attributes. IEEE Trans. Knowl. Data Eng. 21(1), 35–49 (2009)

    Article  Google Scholar 

  20. Zhang, S., Mamoulis, N., Cheung, D.W., Kao, B.: Efficient skyline evaluation over partially ordered domains. Proc. VLDB Endowm. 3(1–2), 1255–1266 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. Bordeaux, CNRS, LaBRI, UMR 5800, Talence, France

    Karim Alami & Sofian Maabout

Authors
  1. Karim Alami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sofian Maabout
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karim Alami .

Editor information

Editors and Affiliations

  1. IRIT, Paul Sabatier University, Toulouse, France

    Abdelkader Hameurlain

  2. IFS, Technical University of Vienna, Vienna, Austria

    A Min Tjoa

  3. LIP 6, Sorbonne University, Paris, France

    Bernd Amann

  4. IRISA, Rennes University, Lannion, France

    François Goasdoué

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Alami, K., Maabout, S. (2021). A Partitioning Approach for Skyline Queries in Presence of Partial and Dynamic Orders. In: Hameurlain, A., Tjoa, A.M., Amann, B., Goasdoué, F. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems XLIX. Lecture Notes in Computer Science(), vol 12920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-64148-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-64148-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-64147-7

  • Online ISBN: 978-3-662-64148-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation