Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.cai.ui.sav.sk:article/47

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

Authors
Publication date
26 January 2012
Publisher
Institute of Informatics, Slovak Academy of Sciences

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

Similar works

Full text

thumbnail-image

Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)

redirect
oaioai:ojs.cai.ui.sav.sk:article/...
Last time updated on 15/12/2019

This paper was published in Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava).

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.