On Supporting Wide Range of Attribute Types for Top-K Search
AbstractSearching 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 the index based methods to simulate the sorted access for different user preferences in parallel are presented. The simulation for different domain types -- ordinal, nominal, metric and hierarchical -- is presented.
Download data is not yet available.
How to Cite
Gurský, P., Pázman, R., & Vojtáš, P. (2012). On Supporting Wide Range of Attribute Types for Top-K Search. COMPUTING AND INFORMATICS, 28(4), 483–513. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/47