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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6203 https://ink.library.smu.edu.sg/context/sis_research/article/7206/viewcontent/2101.09441.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
ThunderRW: An in-memory graph random walk engine
by: SUN, Shixuan, et al.
Published: (2021) -
Towards efficient motif-based graph partitioning: An adaptive sampling approach
by: HUANG, Shixun, et al.
Published: (2021) -
DyCuckoo: Dynamic hash tables on GPUs
by: LI, Yuchen, et al.
Published: (2021) -
NewsLink: Empowering intuitive news search with knowledge graphs
by: YANG, Yueji, et al.
Published: (2021) -
Geometric approaches for Top-k Queries [Tutorial]
by: MOURATIDIS, Kyriakos
Published: (2017)