Affiliation:
1. The Chinese University of Hong Kong
Abstract
Many real-world graphs, e.g., social networks, biological networks, knowledge graphs, naturally come with edge-labels, with different labels representing different relationships between nodes. On such edge-labeled graphs, an important query is the
label-constrained reachability (LCR)
query, where we are given a source
s
, a target
t
, a label set ψ, and the goal is to check if there exists any path
P
from
s
to
t
such that labels of edges on
P
all belong to ψ. Existing indexing schemes for LCR queries still focus on static graphs, despite the fact that many edge-labeled graphs are dynamic in nature.
Motivated by the limitations of existing solutions, we present a study on how to effectively maintain the indexing scheme on dynamic graphs. Our proposed approach is based on the state-of-the-art 2-hop index for LCR queries. In this paper, we present efficient algorithms for updating the index structure in response to dynamic edge insertions/deletions and demonstrate the correctness of our update algorithms. Following that, we present that adopting a query-friendly but update-unfriendly indexing scheme results in surprisingly superb query/update efficiency and outperforms those update-friendly ones. We analyze and demonstrate that the query-friendly indexing scheme actually achieves the same time complexity as those of update-friendly ones. Finally, we present the batched update algorithms where the updates may include multiple edge insertions/deletions. Extensive experiments show the effectiveness of the proposed update algorithms, query-friendly indexing scheme, and batched update algorithms.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference33 articles.
1. Hierarchical Hub Labelings for Shortest Paths
2. Fast exact shortest-path distance queries on large networks by pruned landmark labeling
3. Renzo Angles , Marcelo Arenas , Pablo Barceló , Aidan Hogan , Juan L. Reutter , and Domagoj Vrgoc . 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. 50, 5 ( 2017 ), 68:1--68:40. Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan L. Reutter, and Domagoj Vrgoc. 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. 50, 5 (2017), 68:1--68:40.
4. Formal-Language-Constrained Path Problems
5. Incremental Maintenance of 2-Hop Labeling of Large Graphs
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Label-constrained shortest path query processing on road networks;The VLDB Journal;2023-12-16
2. Distributed Asynchronous Regular Path Queries (RPQs) on Graphs;Proceedings of the 24th International Middleware Conference: Industrial Track;2023-12-11
3. Efficient Core Maintenance in Large Bipartite Graphs;Proceedings of the ACM on Management of Data;2023-11-13
4. An Overview of Reachability Indexes on Graphs;Companion of the 2023 International Conference on Management of Data;2023-06-04
5. Integrating Connection Search in Graph Queries;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04