Commutativity And Its Role In The Processing Of Linear Recursion
Summary: Analyzes commutativity in linear recursion for query processing; gives a polynomial-time test and a sufficient condition for two linear, restricted rules to commute. Centers commutativity in separable recursion and redundant predicates via algebraic structure. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,038 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.7062591e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8555836e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 12,931 | Semigroup techniques in recursive query optimization | 1990 | PODS | 4.1905499e-05 |
| 12,939 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
| 569 | Query Optimization by Simulated Annealing | 1987 | SIGMOD | 0.00019912758 |
| 612 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.0001915957 |
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 2,038 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.7062591e-05 |
| 3,556 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9712392e-05 |
Previous
Page 1 / 1
Next