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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R., McCreight, E.: Organization and Maintenance of Large Ordered Indices. Acta Informatica 1(3), 173–189 (1972)
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)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66, 614–656 (2003)
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)
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)
Ondreička, M.: Extending Fagin’s algorithm for more users. Master’s thesis, Charles University, Faculty of Mathematics and Physics, Prague (in Slovak) (2008)
Scheuerman, P., Ouksel, M.: Multidimensional B-trees for associative searching in database systems. Information systems 34(2) (1982)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ondreička, M., Pokorný, J. (2008). Extending Fagin’s Algorithm for More Users Based on Multidimensional B-Tree. In: Atzeni, P., Caplinskas, A., Jaakkola, H. (eds) Advances in Databases and Information Systems. ADBIS 2008. Lecture Notes in Computer Science, vol 5207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85713-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-85713-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85712-9
Online ISBN: 978-3-540-85713-6
eBook Packages: Computer ScienceComputer Science (R0)