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

Abstract

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.

Keywords

• Top-K Problem
• fuzzy function
• aggregation function
• B+-tree