Factoring Augmented Regular Chain Programs
Summary: Extends a traversal language to allow variables in path regexes while preserving efficient evaluation. Translates into augmented regular chain programs, a Datalog-based class that always factors and is incomparable to existing factorable classes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Peter T. Wood (University of Cape Town)
BibTeX Citation
@article{wood_vldb90,
title = {{Factoring Augmented Regular Chain Programs}},
author = {Wood, Peter T.},
journal = {PVLDB},
series = {{VLDB} '90},
pages = {255},
year = {1990}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,280 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS | 4.9793485e-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 |
|---|---|---|---|---|
| 18 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00059023577 |
| 297 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00021840374 |
| 305 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.0002159111 |
| 352 | On the Power of Magic | 1987 | PODS | 0.00020223279 |
| 1,597 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.0001012429 |
| 1,682 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 9.8850863e-05 |
| 1,979 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.2716242e-05 |
| 3,713 | Compiling Separable Recursions | 1988 | SIGMOD | 7.0770304e-05 |
| 4,187 | Argument Reduction by Factoring | 1989 | VLDB | 6.748235e-05 |
| 4,228 | Commutativity and Its Role in the Processing of Linear Recursion | 1989 | VLDB | 6.7165815e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,109 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 2 | 5,096 | Querying Graph Patterns | 2011 | PODS |
| 3 | 9,611 | A Theory of Regular Queries | 2016 | PODS |
| 4 | 7,811 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |
| 5 | 13,280 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS |
| 6 | 13,389 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 7 | 305 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD |
| 8 | 6,741 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 9 | 13,368 | Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations | 1992 | PODS |
| 10 | 1,597 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |