Efficient distributed reachability querying of massive temporal graphs
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...
Saved in:
Main Authors: | ZHANG, Tianming, GAO, Yunjun, LU, Chen, GUO, Wei, PU, Shiliang, ZHENG, Baihua, CHRISTIAN S. Jensen |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2019
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4468 https://ink.library.smu.edu.sg/context/sis_research/article/5471/viewcontent/DRQ_VLDBJ.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Towards distributed node similarity search on graphs
由: ZHANG, Tianming, et al.
出版: (2020) -
Distributed similarity queries in metric spaces
由: YANG, Keyu, et al.
出版: (2019) -
Multi-point queries in large spatial databases
由: Hoong, K.N., et al.
出版: (2013) -
A survey of typical attributed graph queries
由: WANG, Yanhao, et al.
出版: (2020) -
A survey of typical attributed graph queries
由: WANG, Yanhao, et al.
出版: (2020)