Probabilistic top-k dominating query over sliding windows

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 7808 LNCS pp. 782 - 793
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
10.1007%2F978-3-642-37401-2_75.pdfPublished version287.18 kB
Adobe PDF
Probabilistic queries on uncertain data have been intensively investigated lately. Top-k dominating query is important in many applications, e.g., decision making, as it offers choices which are better than the most of others. In this paper, we study the problem of probabilistic top-k dominating query over sliding windows. An efficient algorithm is developed to compute the exact solution. Extensive experiments are conducted to demonstrate the efficiency and effectiveness of the algorithm. © 2013 Springer-Verlag.
Please use this identifier to cite or link to this item: