Relational Approach for Shortest Path Discovery over Large Graphs
Summary: Relational FEM framework models graph search with frontier selection, expansion, and merge operators in SQL over disk graphs. Bi-directional set Dijkstra and SegTable for local shortest segments enable set-at-a-time shortest-path discovery with improved scalability and performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jun Gao
- 2. Ruoming Jin
- 3. Jiashuai Zhou
- 4. Jeffrey Xu Yu
- 5. Xiao Jiang
- 6. Tengjiao Wang
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,988 | All-in-One: Graph Processing in RDBMSs Revisited | 2017 | SIGMOD | 6.5589605e-05 |
| 4,360 | GRFusion: Graphs as First-Class Citizens in Main-Memory Relational Database Systems | 2018 | SIGMOD | 6.256733e-05 |
| 4,430 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.1942479e-05 |
| 4,534 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB | 6.1049756e-05 |
| 4,949 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB | 5.8113132e-05 |
| 6,483 | Towards Unified Ad-hoc Data Processing | 2014 | SIGMOD | 5.0456397e-05 |
| 8,256 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB | 4.5490743e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 153 | Relational Databases for Querying XML Documents: Limitations and Opportunities | 1999 | VLDB | 0.00040784455 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00025097452 |
| 656 | ERACER: A Database Approach for Statistical Inference and Data Cleaning | 2010 | SIGMOD | 0.00018588729 |
| 686 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00018178029 |
| 886 | Fast Personalized PageRank on MapReduce | 2011 | SIGMOD | 0.00015597161 |
| 1,414 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012118275 |
| 3,020 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB | 7.6992238e-05 |
| 3,289 | Implementing A Scalable XML Publish/Subscribe System Using Relational Database Systems | 2004 | SIGMOD | 7.2719063e-05 |
| 3,438 | DTD-Directed Publishing with Attribute Translation Grammars | 2002 | VLDB | 7.0932714e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,067 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4795399e-05 |
| 6,639 | Modern Techniques for Querying Graph-Structured Relations: Foundations, System Implementations, and Open Challenges | 2022 | VLDB | 4.9801324e-05 |
| 54 | DISCOVER: Keyword Search in Relational Databases | 2002 | VLDB | 0.00066047203 |
| 8,256 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB | 4.5490743e-05 |
| 8,070 | The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis | 2016 | VLDB | 4.5932982e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 1,564 | Keyword Search in Databases: The Power of RDBMS | 2009 | SIGMOD | 0.00011350495 |
| 945 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00015137526 |
| 4,745 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD | 5.9573154e-05 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |