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,327 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS | 4.9605343e-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.00058816744 |
| 299 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00021766741 |
| 306 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021533151 |
| 353 | On the Power of Magic | 1987 | PODS | 0.0002014941 |
| 1,592 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.0001010713 |
| 1,688 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 9.8481921e-05 |
| 1,986 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.2371562e-05 |
| 3,722 | Compiling Separable Recursions | 1988 | SIGMOD | 7.0503269e-05 |
| 4,206 | Argument Reduction by Factoring | 1989 | VLDB | 6.722747e-05 |
| 4,249 | Commutativity and Its Role in the Processing of Linear Recursion | 1989 | VLDB | 6.6912366e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,133 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 2 | 5,122 | Querying Graph Patterns | 2011 | PODS |
| 3 | 9,647 | A Theory of Regular Queries | 2016 | PODS |
| 4 | 7,835 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |
| 5 | 13,327 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS |
| 6 | 13,436 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 7 | 306 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD |
| 8 | 6,764 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 9 | 13,415 | Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations | 1992 | PODS |
| 10 | 1,592 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |