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 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.
Keywords
MSC
68T20, 68T30
Cite this article
@article{cai-1933,
author = {Peter Gurský and René Pázman and Peter Vojtáš},
title = {On Supporting Wide Range of Attribute Types for Top-k Search},
journal = {Computing and Informatics},
volume = {28},
number = {4},
pages = {483--513},
year = {2009},
issn = {1335-9150},
url = {https://cai.type.sk/content/2009/4/on-supporting-wide-range-of-attribute-types-for-top-k-search/}
}
TY - JOUR AU - Peter Gurský AU - René Pázman AU - Peter Vojtáš TI - On Supporting Wide Range of Attribute Types for Top-k Search JO - Computing and Informatics VL - 28 IS - 4 SP - 483 EP - 513 PY - 2009 SN - 1335-9150 UR - https://cai.type.sk/content/2009/4/on-supporting-wide-range-of-attribute-types-for-top-k-search/ KW - Top-k search KW - hierarchical attributes KW - metric attributes KW - user preferences ER -
Gurský, P., Pázman, R., & Vojtáš, P. (2009). On Supporting Wide Range of Attribute Types for Top-k Search. Computing and Informatics, 28(4), 483–513. https://cai.type.sk/content/2009/4/on-supporting-wide-range-of-attribute-types-for-top-k-search/