Publication at Faculty of Mathematics and Physics |
2009
Abstract
Searching top-k objects for many users face the problem of different user preferences. The family of Threshold algorithms computes top-k objects using sorted access to ordered lists.
Each list is ordered w.r.t. user preference to one of objects? attributes. In this paper we present the index based methods to simulate the sorted access for different user preferences in parallel.
We propose the simulation for different domain types: ordinal, nominal, metric and hierarchical.