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,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-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.0010066783 |
| 296 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028644922 |
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
| 673 | One-Sided Recursions | 1987 | PODS | 0.00018348841 |
| 3,999 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.5469939e-05 |
| 4,555 | Magic Counting Methods | 1987 | SIGMOD | 6.0891017e-05 |
| 4,732 | Handling Redundancy in the Processing of Recursive Database Queries | 1987 | SIGMOD | 5.9639609e-05 |
| 5,515 | Worst-case Complexity Analysis of Methods for Logic Query Implementation | 1987 | PODS | 5.4636431e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.0010066783 |
| 1,423 | Magic is Relevant | 1990 | SIGMOD | 0.00012054867 |
| 7,075 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS | 4.842703e-05 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-05 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 5,515 | Worst-case Complexity Analysis of Methods for Logic Query Implementation | 1987 | PODS | 5.4636431e-05 |
| 3,553 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9779134e-05 |
| 296 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028644922 |
| 4,555 | Magic Counting Methods | 1987 | SIGMOD | 6.0891017e-05 |