Processing Windowed Top-k Queries on Uncertain Streams

摘要

We designed efficient synopses to continuously monitor the top-k results on uncertain streams, and showed that all the existing top-k definitions can be plugged into our framework. In the present paper, we adopted the simple uncertain data model where each tuple appears with a certain probability independent of other tuples. In future, we are planning to find solutions to cope with more complex uncertain models.