Efficient top-( k, l) range query processing for uncertain data based on multicore architectures.

Query processing over uncertain data is very important in many applications due to the existence of uncertainty in real-world data. In this paper, we first elaborate a new and important query in the context of an uncertain database, namely uncertain top-( k, l) range (UTR) query, which retrieves $$l$$ uncertain tuples that are expected to meet score range constraint [ $$CR_1$$ , $$CR_2$$ ] and have the maximum top- k probabilities but no less than a user-specified probability threshold $$q$$ . In order to enable the UTR query answer faster, we put forward some effective pruning rules to reduce the UTR query space, which are integrated into an efficient UTR query procedure. What's more, to improve the efficiency and effectiveness of the UTR query, a parallel UTR (PUTR) query procedure is presented. Extensive experiments have verified the efficiency and effectiveness of our proposed algorithms. It is worth to notice that, comparing to the UTR query procedure, the PUTR query procedure performs much more efficiently and effectively. [ABSTRACT FROM AUTHOR]