Learning-Based Dynamic Graph Stream Sketch
暂无分享,去创建一个
Sanglu Lu | Wenzhong Li | Ding Li | Yizhou Chen | Mingkai Lin | Sanglu Lu | Mingkai Lin | Wenzhong Li | Ding Li | Yizhou Chen
[1] Tong Yang,et al. SF-Sketch: A Two-Stage Sketch for Data Streams , 2017, IEEE Transactions on Parallel and Distributed Systems.
[2] Jaana Kekäläinen,et al. Cumulated gain-based evaluation of IR techniques , 2002, TOIS.
[3] Moses Charikar,et al. Finding frequent items in data streams , 2002, Theor. Comput. Sci..
[4] Hongzhi Wang,et al. Learned sketches for frequency estimation , 2020, Inf. Sci..
[5] George Varghese,et al. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.
[6] Charu C. Aggarwal,et al. gSketch: On Query Estimation in Graph Streams , 2011, Proc. VLDB Endow..
[7] Graham Cormode,et al. An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.