Advertisement

Extending Fagin’s Algorithm for More Users Based on Multidimensional B-Tree

  • Matúš Ondreička
  • Jaroslav Pokorný
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5207)

Abstract

We discuss the issue of searching the best K objects in more attributes for more users. Every user prefers objects in different ways. User preferences are modelled locally with a fuzzy function and globally with an aggregation function. Also, we discuss the issue of searching the best K objects without accessing all objects. We deal with the use of local preferences when computing Fagin’s algorithms. We created a new model of lists for Fagin’s algorithms based on B + -trees. Furthermore, we use a multidimensional B-tree (MDB-tree)for searching the best K objects. We developed an MD-algorithm, which can effectively find the best K objects in a MDB-tree in accordance with user’s preferences and without accessing all the objects. We show that MD-algorithm achieves better results in the number of accessed objects than Fagin’s algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bayer, R., McCreight, E.: Organization and Maintenance of Large Ordered Indices. Acta Informatica 1(3), 173–189 (1972)CrossRefGoogle Scholar
  2. 2.
    Eckhardt, A., Pokorný, J., Vojtáš, P.: A system recommending top-k objects for multiple users preference. In: Proc. of 2007 IEEE International Conference on Fuzzy Systems, London, England, July 24-26, 2007, pp. 1101–1106 (2007)Google Scholar
  3. 3.
    Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66, 614–656 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gurský, P., Lencses, R., Vojtáš, P.: Algorithms for user dependent integration of ranked distributed information. In: Proceedings of TED Conference on e-Government (TCGOV 2005), pp. 123–130 (2005)Google Scholar
  5. 5.
    Chaudhuri, S., Gravano, L., Marian, M.: Optimizing Top-k Selection Queries over Multimedia Repositories. IEEE Trans. On Knowledge and Data Engineering 16(8), 992–1009 (2004)CrossRefGoogle Scholar
  6. 6.
    Ondreička, M.: Extending Fagin’s algorithm for more users. Master’s thesis, Charles University, Faculty of Mathematics and Physics, Prague (in Slovak) (2008)Google Scholar
  7. 7.
    Scheuerman, P., Ouksel, M.: Multidimensional B-trees for associative searching in database systems. Information systems 34(2) (1982)Google Scholar
  8. 8.
    Vojtáš, P.: Fuzzy logic aggregation for semantic web search for the best (top-k) answer. In: Capturing Intelligence, ch.17, vol. 1, pp. 341–359 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Matúš Ondreička
    • 1
  • Jaroslav Pokorný
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPrague

Personalised recommendations