Semigroup techniques in recursive query optimization
Summary: Introduces a 'rule expansion' semigroup for finite linear recursive Datalog rules, where multiplication is top-down rule expansion and associativity is proven while distinguishing variable roles. Connects semigroup concepts to program boundedness and rule commutativity to codify prior results and derive new algebraic optimization directions for recursive query evaluation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,185 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013445831 |
| 1,648 | A Study of Transitive Closure As a Recursion Mechanism | 1987 | SIGMOD | 0.00011028408 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 2,036 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.714898e-05 |
| 4,329 | Commutativity And Its Role In The Processing Of Linear Recursion | 1989 | VLDB | 6.2858126e-05 |
| 5,180 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 5.6422249e-05 |
Previous
Page 1 / 1
Next