HUGE: An Efficient and Scalable Subgraph Enumeration System

Yang, Zhengyi; Lai, Longbin; Lin, Xuemin; Hao, Kongzhang; Zhang, Wenjie

doi:10.1145/3448016.3457237

Cited by 34 publications

(8 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These models obtain matches on the query graph by the filtering, ordering and enumeration operation. Another category is the join-based methods, such as Yang et al [36] , Dahm et al [37] . The join-based approaches decompose the query graph into nodes and edges.…”

Section: Learning-free Methods On Subgraph Matchingmentioning

confidence: 99%

AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching

Lan

et al. 2023

Pattern Recognition

View full text Add to dashboard Cite

Section: Learning-free Methods On Subgraph Matchingmentioning

confidence: 99%

AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching

Lan

et al. 2023

Pattern Recognition

View full text Add to dashboard Cite

“…Thus, its correctness is immediately proved. 1 The proof process is similar if t is the earlier one.…”

Section: Algorithm 3: Wc-index Constructionmentioning

confidence: 98%

“…Shortest-path distance is a critical concept in graph analytics [1]- [5]. Specially, a path between two vertices s and t is a shortest path if its length is the shortest among all paths between s and t. The distance of the shortest path is called the shortest-path distance, or shortest distance for short.…”

Section: Introductionmentioning

confidence: 99%

Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs

Peng¹,

Ma²,

Zhang³

et al. 2022

Preprint

View full text Add to dashboard Cite

The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are naturally associated with edges in the graphs and finding the shortest distance between two vertices s and t along only valid edges (i.e., edges that satisfy a given quality constraint) is also critical. In this paper, we investigate this novel and important problem of quality constraint shortest distance queries. We propose an efficient index structure based on 2-hop labeling approaches. Supported by a path dominance relationship incorporating both quality and length information, we demonstrate the minimal property of the new index. An efficient query processing algorithm is also developed. Extensive experimental studies over real-life datasets demonstrates efficiency and effectiveness of our techniques.

show abstract

“…The backtracking search based algorithms [10,15,16,19,28,29,37,40,84], which follow the preprocessing-enumeration framework to obtain matches for query graphs. The other category is the join-based methods [45,46,110]. Among these methods, it has been proved that the WCOJ [70] based database system LogicBlox [6] outperformed other database systems.…”

Section: Related Workmentioning

confidence: 99%