Skip to main content
SpringerLink
Log in

Index Structures for Preference Database Queries

  • Conference paper
  • First Online:
Flexible Query Answering Systems (FQAS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10333))

Included in the following conference series:

Abstract

Preference queries enable satisfying search results by delivering best matches, even when no tuple in a dataset fulfills all preferences perfectly. Several methods were developed for preference query processing, such as window-based, distributed, divide-and-conquer, and index-based algorithms. In particular, all index-based algorithms were designed to evaluate Pareto preferences, where the participating preferences are all equally important. In this paper we present index structures for base preferences. Our comprehensive experiments show how indexing data for preference database queries enable faster access of the data tuples and therefore lead to performance advantages when evaluating preferences.

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/endresma/PreferenceIndex.git.

  2. 2.

    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. Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. Database Syst. (TODS) 2(1), 11–26 (1977)

    Article  Google Scholar 

  2. Bhattacharya, A.: Fundamentals of Database Indexing and Searching. CRC Press, Chapman & Hall Book, Boca Raton (2015)

    Google Scholar 

  3. 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 

  4. Chaudhuri, S., Dalvi, N., Kaushik, R.: Robust cardinality and cost estimation for skyline operator. In: Proceedings of ICDE 2006, p. 64. IEEE Computer Society, Washington, DC (2006)

    Google Scholar 

  5. Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline queries, front and back. In: Proceedings of SIGMOD 2013, vol. 42, no. 3, pp. 6–18 (2013)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. Lueker, G.S.: A data structure for orthogonal range queries. In: Proceedings of FOCS 1978, SFCS 1978, pp. 28–34. IEEE CS, Washington, DC (1978)

    Google Scholar 

  9. Mandl, S., Kozachuk, O., Endres, M., Kießling, W.: Preference analytics in EXASolution. In: Proceedings of BTW 2015 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Markus Endres & Felix Weichmann

Authors
  1. Markus Endres
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Felix Weichmann
    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. Roskilde University, Roskilde, Denmark

    Henning Christiansen

  2. ENSSAT-IRISA, Lannion Cedex, France

    Hélène Jaudoin

  3. University of Westminster, London, United Kingdom

    Panagiotis Chountas

  4. Roskilde University, Roskilde, Denmark

    Troels Andreasen

  5. Aalborg University, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Endres, M., Weichmann, F. (2017). Index Structures for Preference Database Queries. In: Christiansen, H., Jaudoin, H., Chountas, P., Andreasen, T., Legind Larsen, H. (eds) Flexible Query Answering Systems. FQAS 2017. Lecture Notes in Computer Science(), vol 10333. Springer, Cham. https://doi.org/10.1007/978-3-319-59692-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59692-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59691-4

  • Online ISBN: 978-3-319-59692-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation