Scaling the monitoring of approximate top-k queries in streaming windows

2021 IEEE International Conference on Big Data (Big Data)(2021)

引用 1|浏览5
暂无评分
摘要
The continuous search for the k best results given a query (top-k) in a data stream is a problem that has gained a lot of attention in recent years, especially in social media and IoT contexts. In these contexts it is essential that the system is able to respond reactively. Therefore, in this study we address how to scale the monitoring of approximate continuous top-k queries to guarantee the reac...
更多
查看译文
关键词
Social networking (online),System performance,Conferences,Big Data,Approximation algorithms,Search problems,Monitoring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要