Speeding Up the NRA Algorithm
Abstrakt
In this paper we present new heuristics over the NRA algorithm > that can be used for fast search of top-k objects using wide range of > user preferences. NRA algorithm usually needs a periodical scan of a large number of candidates during the computation. In this paper we > propose methods of no random access top-k search that optimize the candidate list maintenance during the computation to speed up the > search.