On Supporting Wide Range of Attribute Types for Top-K Search
Peter Gurský ; René Pázman ; Peter Vojtáš
Computing and Informatics, Tome 28 (2012) no. 1, p. 483-513 / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  
@article{cai47,
     author = {Peter Gursk\'y and Ren\'e P\'azman and Peter Vojt\'a\v s},
     title = {On Supporting Wide Range of Attribute Types for Top-K Search},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     pages = { 483-513},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai47}
}

Peter Gurský; René Pázman; Peter Vojtáš. On Supporting Wide Range of Attribute Types for Top-K Search. Computing and Informatics, Tome 28 (2012) no. 1, pp.  483-513. http://gdmltest.u-ga.fr/item/cai47/