A Unified Query Planning Framework for Conjunctive Regular Path Queries

Summary: Introduces a unified algebraic framework for optimizing conjunctive regular path queries via a composable hypergraph model and six core operators. Transformation-based plan enumeration plus cost-based selection outperforms heuristic combinations in MillenniumDB and Neo4j. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID: h140ac64864ac9a6a
Venue: VLDB
Year: 2026
Pagerank: 4.9793485e-05
Overall Rank: 10,817 | 27.28%
DOI: 10.14778/3828612.3828624

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Yue Pang (Hong Kong University of Science and Technology; Peking University)
2. Lei Zou (Peking University)
3. Angela Bonifati (CNRS; French University Institute; Laboratory of Informatics in Image and Information Systems; University of Lyon)
4. M. Tamer Özsu (University of Waterloo)
5. Xiaofang Zhou (Hong Kong University of Science and Technology)

BibTeX Citation

@article{pang_vldb26,
        title = {{A Unified Query Planning Framework for Conjunctive Regular Path Queries}},
        author = {Pang, Yue and Zou, Lei and Bonifati, Angela and Özsu, M. Tamer and Zhou, Xiaofang},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {10},
        pages = {2686--2698},
        doi = {10.14778/3828612.3828624},
        url = {https://doi.org/10.14778/3828612.3828624},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
239	The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing	2018	VLDB	0.000235107
387	The LDBC Social Network Benchmark: Interactive Workload	2015	SIGMOD	0.00019426275
402	Worst-case Optimal Join Algorithms	2012	PODS	0.00019104625
712	Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins	2019	VLDB	0.00014578373
1,900	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD	9.4059063e-05
3,420	Query Planning for Evaluating SPARQL Property Paths	2016	SIGMOD	7.3147525e-05
4,075	A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction	2024	SIGMOD	6.8188389e-05
4,553	GQL and SQL/PGQ: Theoretical Models and Expressive Power	2025	VLDB	6.5393335e-05
4,587	Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction	2023	SIGMOD	6.5161686e-05
9,140	Materialized View Selection & View-Based Query Planning for Regular Path Queries	2024	SIGMOD	5.2214001e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,728	Weighted Hypertree Decompositions and Optimal Query Plans	2004	PODS
2	3,124	Evaluating Queries with Generalized Path Expressions	1996	SIGMOD
3	719	Querying Graph Databases	2013	PODS
4	712	Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins	2019	VLDB
5	10,127	A Modular Graph-Native Query Optimization Framework	2025	SIGMOD
6	288	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD
7	9,140	Materialized View Selection & View-Based Query Planning for Regular Path Queries	2024	SIGMOD
8	10,431	cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries	2026	SIGMOD
9	1,468	Expressive Languages for Path Queries over Graph-Structured Data	2010	PODS
10	11,561	Efficient Regular Simple Path Queries under Transitive Restricted Expressions	2024	VLDB