Evaluating top-k queries over incomplete data streams

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 877-886

  Haghani, Parisa ^a   Michel, Sebastian ^a   Aberer, Karl ^a  

^a EPFL   (Switzerland)

Author keywords

Dominance set; Incomplete streams; Skyline; Top k queries

Indexed keywords

APPROXIMATE ALGORITHMS; CONTINUOUS MONITORING; CORRELATION STATISTICS; EXACT ALGORITHMS; INCOMPLETE DATA; LIFE-TIMES; MAIN MEMORY; MULTIPLE INSTANCES; ON-LINE FASHION; QUERY PROCESSING ENGINE; RESEARCH TOPICS; SLIDING WINDOW; TOP-K QUERY;

ALGORITHMS; CLUSTER ANALYSIS; DISCRIMINANT ANALYSIS; KNOWLEDGE MANAGEMENT; REGRESSION ANALYSIS; SYNCHRONIZATION; WINDOWS;

INFORMATION RETRIEVAL;

EID: 74549226206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646064     Document Type: Conference Paper

References (33)

1. Noga Alon, Phillip B. Gibbons, Yossi Matias, and Mario Szegedy. Tracking join and self-join sizes in limited storage. J. Comput. Syst. Sci., 64(3), 2002.
2. Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, and Jennifer Widom. Models and issues in data stream systems. In PODS, 2002.
3. Brian Babcock and Chris Olston. Distributed top-k monitoring. In SIGMOD Conference, 2003.
4. Shivnath Babu, Utkarsh Srivastava, and Jennifer Widom. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Database Syst., 29(3), 2004.
5. Jon Louis Bentley, H. T. Kung, Mario Schkolnick, and Clark D. Thompson. On the average number of maxima in a set of vectors and applications. J. ACM, 25(4), 1978.
6. Christian Böhm, Beng Chin Ooi, Claudia Plant, and Ying Yan. Efficiently processing continuous k-nn queries on data streams. In ICDE, 2007.
7. Stephan Börzsönyi, Donald Kossmann, and Konrad Stocker. The skyline operator. In ICDE, 2001.
8. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1), 2004.
9. Graham Cormode, Flip Korn, and Srikanta Tirthapura. Time-decaying aggregates in out-of-order streams. In PODS, 2008.
10. Graham Cormode and S. Muthukrishnan. What's hot and what's not: tracking most frequent items dynamically. In PODS, 2003.
11. Abhinandan Das, Johannes Gehrke, and Mirek Riedewald. Approximate join processing over data streams. In SIGMOD Conference, 2003.
12. Gautam Das, Dimitrios Gunopulos, Nick Koudas, and Nikos Sarkas. Ad-hoc top-k query answering for data streams. In VLDB, 2007.
13. Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Maintaining stream statistics over sliding windows. SIAM J. Comput., 31(6), 2002.
14. Marianne Durand and Philippe Flajolet. Loglog counting of large cardinalities (extended abstract). In ESA, 2003.
15. Ronald Fagin, Amnon Lotem, and Moni Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4), 2003.
16. Philippe Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2), 1985.
17. Phillip B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, 2001.
18. Phillip B. Gibbons, Yossi Matias, and Viswanath Poosala. Fast incremental maintenance of approximate histograms. In VLDB, 1997.
19. Phillip B. Gibbons and Srikanta Tirthapura. Distributed streams algorithms for sliding windows. In SPAA, 2002.
20. Lukasz Golab and M. Tamer Özsu. Processing sliding window multi-joins in continuous queries over data streams. In VLDB, 2003.
21. Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, and Xuemin Lin. Sliding-window top-k queries on uncertain streams. PVLDB, 1(1), 2008.
22. Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, and Rui Zhang 0003. Approximate nn queries on streams with guaranteed error/performance bounds. In VLDB, 2004.
23. Feifei Li, Ching Chang, George Kollios, and Azer Bestavros. Characterizing and exploiting reference locality in data stream applications. In ICDE, 2006.
24. Kyriakos Mouratidis, Spiridon Bakiras, and Dimitris Papadias. Continuous monitoring of top-k queries over sliding windows. In SIGMOD Conference, 2006.
25. Kyriakos Mouratidis and Dimitris Papadias. Continuous nearest neighbor queries over sliding windows. IEEE Trans. Knowl. Data Eng., 19(6), 2007.
26. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
27. Dimitris Papadias, Yufei Tao, Greg Fu, and Bernhard Seeger. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30(1), 2005.
28. Kresimir Pripuzic, Ivana Podnar Zarko, and Karl Aberer. Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w. In DEBS, 2008.
29. Utkarsh Srivastava and Jennifer Widom. Memory-limited execution of windowed stream joins. In VLDB, 2004.
30. Srikanta Tirthapura, Bojian Xu, and Costas Busch. Sketching asynchronous streams over a sliding window. In PODC, 2006.
31. Roger Weber, Hans-Jörg Schek, and Stephen Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, 1998.
32. Junyi Xie, Jun Yang, and Yuguo Chen. On joining and caching stochastic streams. In SIGMOD Conference, 2005.
33. Ke Yi, Hai Yu, Jun Yang, Gangqiang Xia, and Yuguo Chen. Efficient maintenance of materialized top-k views. In ICDE, 2003.