监控top-k实时动态社交网络图

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI:10.1145/2933267.2933510

Kamalas Udomlamlert, Cosmas Krisna Adiputra, T. Hara

{"title":"监控top-k实时动态社交网络图","authors":"Kamalas Udomlamlert, Cosmas Krisna Adiputra, T. Hara","doi":"10.1145/2933267.2933510","DOIUrl":null,"url":null,"abstract":"This paper presents our solution to 2016 DEBS Grand Challenge. We proposed our original program to efficiently calculate 2 continuous top-k queries on real-time social-network graph data. Our implementation tried to prevent processing of unaffected events by designing the algorithms to efficiently maintain the spare list of candidates of the top-k results. In addition, we improved the efficiency of the state-of-the-art algorithms to speed up the processing of the queries.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Monitoring top-k on real-time dynamic social-network graphs\",\"authors\":\"Kamalas Udomlamlert, Cosmas Krisna Adiputra, T. Hara\",\"doi\":\"10.1145/2933267.2933510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents our solution to 2016 DEBS Grand Challenge. We proposed our original program to efficiently calculate 2 continuous top-k queries on real-time social-network graph data. Our implementation tried to prevent processing of unaffected events by designing the algorithms to efficiently maintain the spare list of candidates of the top-k results. In addition, we improved the efficiency of the state-of-the-art algorithms to speed up the processing of the queries.\",\"PeriodicalId\":277061,\"journal\":{\"name\":\"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2933267.2933510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2933267.2933510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了我们对2016年DEBS大挑战的解决方案。我们提出了我们的原始程序来有效地计算实时社交网络图数据上的2个连续top-k查询。我们的实现试图通过设计算法来有效地维护top-k结果的备用候选列表，从而防止处理未受影响的事件。此外，我们提高了最先进算法的效率，以加快查询的处理速度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Monitoring top-k on real-time dynamic social-network graphs

This paper presents our solution to 2016 DEBS Grand Challenge. We proposed our original program to efficiently calculate 2 continuous top-k queries on real-time social-network graph data. Our implementation tried to prevent processing of unaffected events by designing the algorithms to efficiently maintain the spare list of candidates of the top-k results. In addition, we improved the efficiency of the state-of-the-art algorithms to speed up the processing of the queries.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems

自引率

0.00%

发文量