Skip to main content
SpringerLink
Log in

The Structure of Preference Orders

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2015)

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

Abstract

Preferences are an important natural concept in real life and are well-known in the database and artificial intelligence community. Modeling preferences as strict partial orders closely matches people’s intuition. There are many algorithms for the evaluation of these strict partial orders. In particular some algorithms rely on the total order or the lattice structure constructed by a preference query. This paper provides an overview of the structure of preference orders. We present several measures of the different “better-than graphs” and give a deep insight into the structure of preferences. In fact, a careful analysis of the underlying “better-than graph” enables one to develop efficient algorithms for preference computation.

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

References

  1. Stefanidis, K., Koutrika, G., Pitoura, E.: A survey on representation, composition and application of preferences in database systems. ACM Trans. Database Syst. 36(4), 19:1–19:45 (2011)

    Google Scholar 

  2. Kießling, W.: Foundations of preferences in database systems. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 311–322. VLDB Endowment, Hong Kong, China (2002)

    Google Scholar 

  3. Chomicki, J.: Preference formulas in relational queries. TODS 2003: ACM Trans. Database Syst. 28, 427–466 (2003)

    Google Scholar 

  4. Arvanitis, A., Koutrika, G.: Towards preference-aware relational databases. In: ICDE 2012: Proceedings of the 28th International Conference on Data Engineering, Washington, DC, USA, April 2012

    Google Scholar 

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

    Book  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. Preisinger, T., Kießling, W.: The hexagon algorithm for evaluating pareto preference queries. In: Proceedings of the 3rd Multidisciplinary Workshop on Advances in Preference Handling (2007)

    Google Scholar 

  9. Endres, M., Kießling, W.: High parallel skyline computation over low-cardinality domains. In: Manolopoulos, Y., Trajcevski, G., Kon-Popovska, M. (eds.) ADBIS 2014. LNCS, vol. 8716, pp. 97–111. Springer, Heidelberg (2014)

    Google Scholar 

  10. Endres, M., Kießling, W.: Semi-skyline optimization of constrained skyline queries. In: ADC 2011: Proceedings of the 22nd Australasian Database Conference, vol. 115, pp. 7–16. ACS (2011)

    Google Scholar 

  11. 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, EDBT 2010, pp. 195–206. ACM, New York, NY, USA (2010)

    Google Scholar 

  12. Han, H., Jung, H., Eom, H., Yeom, H.Y.: An efficient skyline framework for matchmaking applications. J. Netw. Comput. Appl. 34(1), 102–115 (2011)

    Article  Google Scholar 

  13. Endres, M., Roocks, P., Kießling, W.: Scalagon: an efficient skyline algorithm for all seasons. In: Renz, M., Shahabi, C., Zhou, X., Chemma, M.A. (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 292–308. Springer, Heidelberg (2015)

    Google Scholar 

  14. Fishburn, P.C.: Intransitive indifference in preference theory: a survey. Oper. Res. 18(2), 207–228 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kießling, W., Endres, M., Wenzel, F.: The preference SQL system - an overview. Bull. Tech. Commitee Data Eng. IEEE Comput. Soc. 34(2), 11–18 (2011)

    Google Scholar 

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

    Google Scholar 

  17. Endres, M., Roocks, P., Kießling, W.: Algebraic optimization of grouped preference queries. In: Proceedings of IDEAS 2014, pp. 247–256. ACM, New York, NY, USA (2014)

    Google Scholar 

  18. Preisinger, T., Kießling, W., Endres, M.: The BNL++ algorithm for evaluating pareto preference queries. In: Proceedings of the 2nd Multidisciplinary Workshop on Advances in Preference Handling, pp. 114–121 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Markus Endres

Authors
  1. Markus Endres
    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. Poznan University of Technology, Poznán, Poland

    Morzy Tadeusz

  2. INRIA, Montpellier, France

    Patrick Valduriez

  3. Teleport 2, LIAS/ISAE-ENSMA, Poitiers, France

    Ladjel Bellatreche

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Endres, M. (2015). The Structure of Preference Orders. In: Tadeusz, M., Valduriez, P., Bellatreche, L. (eds) Advances in Databases and Information Systems. ADBIS 2015. Lecture Notes in Computer Science(), vol 9282. Springer, Cham. https://doi.org/10.1007/978-3-319-23135-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23135-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23134-1

  • Online ISBN: 978-3-319-23135-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation