Finding Regular Simple Paths in Graph Databases
Summary: Find node pairs connected by a simple path in a labeled digraph with path labels in L(R). General problem intractable; polynomial-time for conflict-free G/R; defines a syntactically characterized language class solvable in poly-time data+expression. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alberto O. Mendelzon (University of Toronto)
- 2. Peter T. Wood (University of Cape Town; University of Toronto)
BibTeX Citation
@article{mendelzon_vldb89,
title = {{Finding Regular Simple Paths in Graph Databases}},
author = {Mendelzon, Alberto O. and Wood, Peter T.},
journal = {PVLDB},
series = {{VLDB} '89},
pages = {185--193},
year = {1989}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 217 | Traversal Recursion: A Practical Approach to Supporting Recursive Applications | 1986 | SIGMOD | 0.00024458594 |
| 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021733819 |
| 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00011140171 |
| 3,739 | Neptune: a Hypertext System for CAD Applications | 1986 | SIGMOD | 7.1594837e-05 |
| 4,425 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.7101609e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,066 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS |
| 2 | 3,452 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 3 | 294 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 4 | 5,146 | Query Containment and Rewriting Using Views for Regular Path Queries Under Constraints | 2003 | PODS |
| 5 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 6 | 747 | Querying Graph Databases | 2013 | PODS |
| 7 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 8 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 9 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 10 | 7,658 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |