高效的分布式动态图形系统

Aya Zaki, M. Attia, Doaa Hegazy, S. Amin
{"title":"高效的分布式动态图形系统","authors":"Aya Zaki, M. Attia, Doaa Hegazy, S. Amin","doi":"10.1109/INTELCIS.2015.7397262","DOIUrl":null,"url":null,"abstract":"Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"31 1","pages":"465-471"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Efficient distributed dynamic graph system\",\"authors\":\"Aya Zaki, M. Attia, Doaa Hegazy, S. Amin\",\"doi\":\"10.1109/INTELCIS.2015.7397262\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.\",\"PeriodicalId\":6478,\"journal\":{\"name\":\"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)\",\"volume\":\"31 1\",\"pages\":\"465-471\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTELCIS.2015.7397262\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2015.7397262","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

研究的重点是静态大图形管理。然而,大多数现实世界的网络都是随着时间而发展的。近年来,管理这些不断发展的网络引起了人们的广泛关注。网络进化的数据可以保存在一个动态图中,以提高搜索查询的表现力和质量,以及快照检索。将网络的连续演化以动态图的形式存储,使得网络的存储量不断增大。现有的动态图模型试图通过消除冗余数据来限制其存储。然而,由于消除步骤,它们的更新时间增加了。这说明在使用的存储和更新时间之间存在权衡。在这项工作中,我们解决了在不增加存储冗余的情况下提高网络进化数据更新时间以及最小化所需内存存储的问题。本文将物化技术与服务器分布式图技术相结合。这种合并减少了更新时间,并以一种有效的方式最大限度地减少了所需的内存存储,并提供了质量更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient distributed dynamic graph system
Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信