PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration

Summary: PathEnum delivers real-time hop-constrained s-t path enumeration (HcPE) via a light-weight index that prunes edges, plus two enumeration modes: DFS-based and join-based. A join-based cost model optimizes search order; experiments on 15 real-world graphs show orders-of-magnitude improvements in time, throughput, and latency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6181
Venue: SIGMOD
Year: 2021
Pagerank: 5.1568586e-05
Overall Rank: 6,208 | 56.82%
DOI: 10.1145/3448016.3457290

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,926	RapidFlow: An Efficient Approach to Continuous Subgraph Matching	2022	VLDB	5.271318e-05
8,668	Towards Generating Hop-constrained s-t Simple Path Graphs	2023	SIGMOD	4.4718257e-05
9,089	Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs	2024	SIGMOD	4.39898e-05
10,062	Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings	2026	SIGMOD	4.1945683e-05
10,467	Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs	2025	SIGMOD	4.1945683e-05
10,720	RICH: Real-time Identification of negative Cycles for High-efficiency Arbitrage	2025	VLDB	4.1945683e-05
11,014	Efficient Regular Simple Path Queries under Transitive Restricted Expressions	2024	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
260	Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling	2013	SIGMOD	0.00030040036
342	EmptyHeaded: A Relational Engine for Graph Processing	2016	SIGMOD	0.00026795977
943	Wander Join: Online Aggregation via Random Walks	2016	SIGMOD	0.00015145883
1,333	Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins	2019	VLDB	0.00012523806
1,394	Real-time Constrained Cycle Detection in Large Dynamic Graphs	2018	VLDB	0.0001221552
1,924	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00010077055
2,912	TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data	2018	SIGMOD	7.9130459e-05
3,036	RapidMatch: A Holistic Approach to Subgraph Query Processing	2021	VLDB	7.6735171e-05
3,646	G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching	2020	SIGMOD	6.8853079e-05
3,957	2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles	2018	VLDB	6.5903145e-05
4,534	Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice	2020	VLDB	6.1049756e-05
4,556	Distributed Subgraph Matching on Timely Dataflow	2019	VLDB	6.0883757e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
7,762	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	4.6583829e-05
506	On Graph Query Optimization in Large Networks	2010	VLDB	0.00021475362
279	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029113513
4,745	Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs	2016	SIGMOD	5.9573154e-05
8,668	Towards Generating Hop-constrained s-t Simple Path Graphs	2023	SIGMOD	4.4718257e-05
10,467	Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs	2025	SIGMOD	4.1945683e-05
7,675	Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale	2022	VLDB	4.6817479e-05
4,534	Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice	2020	VLDB	6.1049756e-05
9,089	Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs	2024	SIGMOD	4.39898e-05