Counting Methods for Cyclic Relations
Summary: Handles counting-based evaluation for linear, two-rule Datalog selection queries (column=constant), overcoming failures of standard counting methods on cyclic databases. Presents a counting-style algorithm that reduces evaluation to intersections of semi-linear sets and constructs them efficiently, matching traditional counting methods' asymptotic runtime. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,048 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.689916e-05 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 6,363 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0896537e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00099936325 |
| 299 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028555103 |
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
| 1,611 | One-Sided Recursions | 1987 | PODS | 0.00011146101 |
| 3,990 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.5536618e-05 |
| 4,440 | Magic Counting Methods | 1987 | SIGMOD | 6.180671e-05 |
| 4,479 | Handling Redundancy in the Processing of Recursive Database Queries | 1987 | SIGMOD | 6.1439609e-05 |
| 5,347 | Worst-case Complexity Analysis of Methods for Logic Query Implementation | 1987 | PODS | 5.555803e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,637 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.3978567e-05 |
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00099936325 |
| 1,423 | Magic is Relevant | 1990 | SIGMOD | 0.00012047765 |
| 7,069 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS | 4.8380576e-05 |
| 6,363 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0896537e-05 |
| 2,048 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.689916e-05 |
| 5,347 | Worst-case Complexity Analysis of Methods for Logic Query Implementation | 1987 | PODS | 5.555803e-05 |
| 3,556 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9712392e-05 |
| 299 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028555103 |
| 4,440 | Magic Counting Methods | 1987 | SIGMOD | 6.180671e-05 |