Sliding-window top-k queries on uncertain streams

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 301-312

  Jin, Cheqing ^a   Yi, Ke ^b   Chen, Lei ^b   Yu, Jeffrey Xu ^c   Lin, Xuemin ^d,e  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^d UNIVERSITY OF NEW SOUTH WALES   (Australia)

^e CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA MINING; INFORMATION RETRIEVAL; QUERY PROCESSING; SENSOR NETWORKS;

POSSIBLE WORLDS; PROCESSING TIME; STREAMING APPLICATIONS; SYNTHETIC AND REAL DATA; UNCERTAIN DATA STREAMS; UNCERTAIN DATAS; UNCERTAIN STREAMS; UNIFIED FRAMEWORK;

DATA HANDLING;

EID: 84859174486     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453892     Document Type: Article

References (34)

1. C. C. Aggarwal and P. S. Yu. A framework for clustering uncertain data streams. In Proc. of ICDE, 2008.
2. C. C. Aggarwal and P. S. Yu. A survey of uncertain data algorithms and applications. In IBM Research Report. www.charuaggarwal.net/RC24394.pdf, October, 2007.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. of ACM STOC, 1996.
4. B. Babcock and C. Olston. Distributed top-k monitoring. In Proc. of SIGMOD, 2003.
5. A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. In Proc. of STOC, 2008.
6. A. Chakrabarti, T. Jayram, and M. Pǎatraşcu. Tight lower bounds for selection in randomly ordered streams. In Proc. of SODA, 2008.
7. J. Chen and K. Yi. Dynamic structures for top-k queries on uncertain data. In Proc. of ISAAC, 2007.
8. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In Proc. of ACM SIGMOD, 2003.
9. G. Cormode and M. Garofalakis. Sketching probabilistic data streams. In Proc. of ACM SIGMOD, 2007.
10. G. Cormode, F. Korn, and S. Tirthapura. Exponentially decayed aggregates on data streams. In Proc. of ICDE, 2008.
11. G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for sensor data aggregation. In Proc. of PODC, 2007.
12. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Proc. of ICDE, 2004.
13. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In Proc. of ACM PODS, 2007.
14. G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In Proc. of VLDB, 2006.
15. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In Proc. of SODA, 2002.
16. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proc. of PODS, 2001.
17. L. Golab. Sliding Window Query Processing over Data Streams. PhD thesis, University of Waterloo, 2006.
18. S. Guha and A. McGregor. Approximate quantiles and the order of the stream. In Proc. of PODS, 2006.
19. M. Hua, J. Pei, A. W. C. Fu, X. Lin, and H.-F. Leung. Efficiently answering top-k typicality queries on large databases. In Proc. of VLDB, 2007.
20. M. Hua, J. Pei, W. Zhang, and X. Lin. Efficiently answering probabilistic threshold top-k queries on uncertain data. In Proc. of ICDE, 2008.
21. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In Proc. of SIGMOD, 2008.
22. T. Jayram, S. Kale, and E. Vee. Efficient aggregation algorithms for probabilistic data. In Proc. of SODA, 2007.
23. T. Jayram, A. McGregor, S. Muthukrishnan, and E. Vee. Estimating statistical aggregates on probabilistic data streams. In Proc. of PODS, 2007.
24. K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In Proc. of ACM SIGMOD, 2006.
25. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations & Trends in Theoretical Computer Science, 2005.
26. S. Nepal and M. V. Ramakrishna. Query processing issues in image(multimedia) databases. In Proc. of ICDE, 1999.
27. D. S. Nilesh and N. Dalvi. Efficient query evaluation on probabilistic databases. In Proc. of VLDB, 2004.
28. C. Ŕe, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proc. of ICDE, 2007.
29. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In Proc. of ICDE, 2006.
30. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang. Top-k query processing in uncertain databases. In Proc. of ICDE, 2007.
31. D. Xin, H. Cheng, X. Yan, and J. Han. Extracting redundancy-aware top-k patterns. In Proc. of KDD, 2006.
32. D. Xin, J. Han, H. Cheng, and X. Li. Answering top-k queries with multi-dimensional selections: the ranking cube approach. In Proc. of VLDB, 2006.
33. K. Yi, F. Li, G. Kollios, and D. Srivastava. Efficient processing of top-k queries in uncertain databases. In Proc. of ICDE, 2008.
34. Q. Zhang, F. Li, and K. Yi. Finding frequent items in probabilistic data. In Proc. of SIGMOD, 2008.