Span-reachability querying in large temporal graphs

Dong, Wenxia; Yang, Bohua; Zhang, Ying; Qin, Lu; Cheng, Dawei; Zhang, Wenjie

doi:10.1007/s00778-021-00715-z

Cited by 6 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ref. [21] adopted the concept of 2-hop coverage and proposed an index-based approach to answer spanreachability queries in large temporal graphs. [22] proposed a linear greedy algorithm to obtain the path partition, based on which [12] proposed an efficient algorithm buTC + for a TC size computation with time complexity O(r|E|), where r = |S p |.…”

Section: Label+gmentioning

confidence: 99%

“…Both A(3) and D(3) are denoted by H A and H D in Figure 4c, respectively. The Algorithm: As shown by Algorithm 3, for each hop-node v i , we first performed forward and backward BFS to obtain D i (lines 6-15) and A i (lines [16][17][18][19][20][21][22][23][24][25]. At the same time, we generated their partitions D(i) and A(i), for which each subset was recorded in H D and H A , respectively.…”

Section: Case-2 Where Vmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Reachability Ratio Computation for 2-Hop Labeling Scheme

et al. 2023

View full text Add to dashboard Cite

Reachability queries processing has been extensively studied during the past decades. Many approaches have followed the line of designing 2-hop labels to ensure acceleration. Considering its index size cannot be bounded, researchers have proposed to use a part of nodes to construct partial 2-hop labels (p2HLs) to cover as much reachability information as possible. We achieved better query performance using p2HLs with a limited index size and index construction time. However, the adoption of p2HLs was based on intuition, and the number of nodes used to generate p2HLs was fixed in advance blindly, without knowing its applicability. In this paper, we focused on the problem of efficiently computing a reachability ratio (RR) in order to obtain RR-aware p2HLs. Here, RR denoted the ratio of the number of reachable queries that could be answered by p2HLs over the total number of reachable queries involved in a given graph. Based on the RR, users could determine whether p2HLs should be used to answer the reachability queries for a given graph and how many nodes should be chosen to generate p2HLs. We discussed the difficulties of RR computation and propose an incremental-partition algorithm for RR computation. Our rich experimental results showed that our algorithm could efficiently obtain the RR and the overall effects on query performance by different p2HLs. Based on the experimental results, we provide our findings on the use p2HLs for a given graph for processing reachability queries.

show abstract

Section: Label+gmentioning

confidence: 99%

Section: Case-2 Where Vmentioning

confidence: 99%

Efficient Reachability Ratio Computation for 2-Hop Labeling Scheme

et al. 2023

View full text Add to dashboard Cite

show abstract

Efficient algorithms for reachability and path queries on temporal bipartite graphs

Wang,

Cai,

Chen

et al. 2024

The VLDB Journal

View full text Add to dashboard Cite

On Querying Connected Components in Large Temporal Graphs

Xie

Fang

Xia

et al. 2023

Proc. ACM Manag. Data

View full text Add to dashboard Cite

In this paper, for the first time, we introduce the concepts of window-CCs and window-SCCs on undirected and directed temporal graphs, respectively. We then study the queries of window-CC and window-SCC by developing several efficient index-based query solutions. The space costs of the best indices are linear to the sizes of the temporal graphs. The extensive experimental evaluation on 12 real-world datasets demonstrates the high efficiency and effectiveness of the proposed solutions. In the future, we will develop distributed index construction algorithms, which would be useful for very large temporal graphs containing billions of edges. In the future, we will implement our algorithms by using a distributed computing platform (e.g., Pregel), which would be very useful when the temporal graph is too large to be kept by a single machine.

show abstract

Span-reachability querying in large temporal graphs

Cited by 6 publications

References 34 publications

Efficient Reachability Ratio Computation for 2-Hop Labeling Scheme

Efficient Reachability Ratio Computation for 2-Hop Labeling Scheme

Efficient algorithms for reachability and path queries on temporal bipartite graphs

On Querying Connected Components in Large Temporal Graphs

Contact Info

Product

Resources

About