Abstract
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.
Cite
CITATION STYLE
Feng, X., Zhao, X., Gao, Y., & Zhang, Y. (2013). Probabilistic top-k dominating query over sliding windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7808 LNCS, pp. 782–793). https://doi.org/10.1007/978-3-642-37401-2_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
