By Topic

Efficient Top-K Problem Solvings for More Users in Tree-Oriented Data Structures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ondreička, M. ; Dept. of Software Eng., Charles Univ. in Prague, Prague, Czech Republic ; Pokorný, J.

This paper focuses on efficient searching the best K objects in more attributes according to user preferences. User preferences are modelled locally with fuzzy functions and globally with an aggregation function. Because of local preferences, we have used B+-tree for sorting objects according to a fuzzy function. We deal with the usage of TA-algorithm, which uses B+-trees, and MD-algorithm, which is based on multidimensional B-tree. In this paper we develop a new algorithm, MXT-algorithm, which id based on integration of MD-algorithm with more instances of TA-algorithm. We also develop a new tree-oriented data structure based on B+-trees, multidimensional B-tree with lists, in which MXT-algorithm can effectively find the best K objects according to user preferences. Finally, we show that according to the type of object attribute domains, it is possible to choose the best data structure for objects storage and also top-K algorithm for efficient top-K problem solving.

Published in:

Signal-Image Technology & Internet-Based Systems (SITIS), 2009 Fifth International Conference on

Date of Conference:

Nov. 29 2009-Dec. 4 2009