Facebook Instagram Twitter RSS Feed PodBean Back to top on side

On Supporting Wide Range of Attribute Types for Top-K Search

In: Computing and Informatics, vol. 28, no. 4
P. Gurský - R. Pázman - P. Vojtáš

Details:

Year, pages: 2009, 483 - 513
Keywords:
Top-k search, hierarchical attributes, metric attributes, user preferences
About article:
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.
How to cite:
ISO 690:
Gurský, P., Pázman, R., Vojtáš, P. 2009. On Supporting Wide Range of Attribute Types for Top-K Search. In Computing and Informatics, vol. 28, no.4, pp. 483-513. 1335-9150.

APA:
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. 1335-9150.