DBL: Efficient reachability queries on dynamic graphs
Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many applications, it is essential to support efficient graph updates while offering good performance in reachability queries. Existing...
Saved in:
Main Authors: | LYU, Qiuyi, LI, Yuchen, HE, Bingsheng, GONG, Bin |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2021
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/6203 https://ink.library.smu.edu.sg/context/sis_research/article/7206/viewcontent/2101.09441.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
ThunderRW: An in-memory graph random walk engine
由: SUN, Shixuan, et al.
出版: (2021) -
Towards efficient motif-based graph partitioning: An adaptive sampling approach
由: HUANG, Shixun, et al.
出版: (2021) -
DyCuckoo: Dynamic hash tables on GPUs
由: LI, Yuchen, et al.
出版: (2021) -
NewsLink: Empowering intuitive news search with knowledge graphs
由: YANG, Yueji, et al.
出版: (2021) -
Geometric approaches for Top-k Queries [Tutorial]
由: MOURATIDIS, Kyriakos
出版: (2017)