Experience of event stream processing for top-k queries and dynamic graphs

Solving 2016 ACM DEBS Grand Challenge problems entails both dynamic graph processing and top-k query processing. A straightforward implementation of solutions would not guarantee good performance or prompt responses. This paper shows our experience in implementing solutions of the problems, including rationales of top-k list management techniques we used in our implementation. We also shows the performance evaluation results among three top-k list management schemes and present the reason for our choice for the final result.