Skip to main content
SpringerLink
Log in

Beyond Skylines: Explicit Preferences

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2017)

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

Included in the following conference series:

Abstract

Skyline queries are well-known in the database community and there are many algorithms for the computation of the Pareto frontier. But users do not only think of finding the Pareto optimal objects, they often want to find the best objects concerning an explicit specified preference order. While preferences themselves often are defined as general strict partial orders, almost all algorithms are designed to evaluate Pareto preferences combining weak orders, i.e., Skylines. In this paper, we consider general strict partial orders and we present a method to evaluate such explicit preferences by embedding any strict partial order into a complete lattice. This enables preference evaluation with specialized lattice based algorithms instead of algorithms relying on tuple-to-tuple comparisons and therefore speed-ups their computation as can be seen in our experiments.

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.

    Implementation available at https://github.com/endresma/ExplicitPreference.git.

  2. 2.

    https://github.com/jgrapht/jgrapht.

  3. 3.

    We used the Java Runtime object with the methods totalMemory() and freeMemory() to determine the total amount of used memory in the JVM.

References

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

    Google Scholar 

  2. Kießling, W.: Foundations of preferences in database systems. In: Proceedings of VLDB 2002, pp. 311–322. VLDB, Hong Kong (2002)

    Google Scholar 

  3. Kießling, W.: Preference queries with SV-semantics. In: Proceedings of COMAD 2005, pp. 15–26. Computer Society of India, Goa (2005)

    Google Scholar 

  4. Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline queries, front and back. SIGMOD 42(3), 6–18 (2013)

    Article  Google Scholar 

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

    Google Scholar 

  6. Bartolini, I., Ciaccia, P., Patella, M.: SaLSa: computing the skyline without scanning the whole sky. In: Proceedings of CIKM 2006, pp. 405–414. ACM, New York (2006)

    Google Scholar 

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

    Google Scholar 

  8. Preisinger, T., Kießling, W.: The Hexagon algorithm for evaluating pareto preference queries. In: Proceedings of MPref 2007 (2007)

    Google Scholar 

  9. Morse, M., Patel, J.M., Jagadish, H.V.: Efficient skyline computation over low-cardinality domains. In: Proceedings of VLDB 2007, pp. 267–278 (2007)

    Google Scholar 

  10. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  11. Lee, J., Hwang, S.-W.: BSkyTree: scalable skyline computation using a balanced pivot selection. In: Proceedings of EDBT 2010, pp. 195–206. ACM (2010)

    Google Scholar 

  12. Raynaud, O., Thierry, E.: The complexity of embedding orders into small products of chains. Order 27(3), 365–381 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  14. Capelle, C.: Representation of an order as union of interval orders. In: Bouchitté, V., Morvan, M. (eds.) ORDAL 1994. LNCS, vol. 831, pp. 143–161. Springer, Heidelberg (1994). doi:10.1007/BFb0019432

    Chapter  Google Scholar 

  15. Fishburn, P.C.: Interval graphs and interval orders. Discrete Math. 55(2), 135–149 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fishburn, P.: Preference structures and their numerical representation. Th. Comp. Sci. 217(2), 359–383 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Endres, M., Preisinger, T.: Preference structures and their lattice representation. Report–02, University of Augsburg (2016)

    Google Scholar 

  18. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Augsburg, Universitätsstr. 6a, 86159, Augsburg, Germany

    Markus Endres & Timotheus Preisinger

Authors
  1. Markus Endres
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timotheus Preisinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Markus Endres .

Editor information

Editors and Affiliations

  1. Arizona State University , Tempe - Phoenix, Arizona, USA

    Selçuk Candan

  2. Hong Kong University of Science and Tech , Hong Kong, China

    Lei Chen

  3. Aalborg University , Aalborg, Denmark

    Torben Bach Pedersen

  4. University of New South Wales , Sydney, New South Wales, Australia

    Lijun Chang

  5. The University of Queensland , Brisbane, Queensland, Australia

    Wen Hua

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Endres, M., Preisinger, T. (2017). Beyond Skylines: Explicit Preferences. In: Candan, S., Chen, L., Pedersen, T., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10177. Springer, Cham. https://doi.org/10.1007/978-3-319-55753-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55753-3_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55752-6

  • Online ISBN: 978-3-319-55753-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation