Advertisement

Index Structures for Preference Database Queries

  • Markus Endres
  • Felix Weichmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10333)

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.

Keywords

Execution Time Index Structure Range Query Skyline Query Base Preference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. Database Syst. (TODS) 2(1), 11–26 (1977)CrossRefGoogle Scholar
  2. 2.
    Bhattacharya, A.: Fundamentals of Database Indexing and Searching. CRC Press, Chapman & Hall Book, Boca Raton (2015)Google Scholar
  3. 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. 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. 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. 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. 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 SocietyGoogle Scholar
  8. 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. 9.
    Mandl, S., Kozachuk, O., Endres, M., Kießling, W.: Preference analytics in EXASolution. In: Proceedings of BTW 2015 (2015)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute for Computer ScienceUniversity of AugsburgAugsburgGermany

Personalised recommendations