Efficient distributed reachability querying of massive temporal graphs

• المؤلفون الرئيسيون: ZHANG, Tianming, GAO, Yunjun, LU, Chen, GUO, Wei, PU, Shiliang, ZHENG, Baihua, CHRISTIAN S. Jensen
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2019
• الموضوعات: Graph; Reachability; Distributed processing; Query processing; Algorithm; Computer Engineering; Theory and Algorithms
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/4468; https://ink.library.smu.edu.sg/context/sis_research/article/5471/viewcontent/DRQ_VLDBJ.pdf

Reachability computation is a fundamental graph functionality with a wide range of applications. In spite of this, little work has as yet been done on efficient reachability queries over temporal graphs, which are used extensively to model time-varying networks, such as communication networks, socia...