Polynomial-time program transformations in deductive databases
Summary: Tight complexity dichotomy for k-containment of conjunctive queries: 2-containment in P, 3-containment NP-complete, so slight relaxations turn common program transformations NP-hard. Yields poly-time algorithms for restricted deductive-database transformations and characterizes complexity of sequencability/commutativity of linear rules, 1-boundedness in sirups, and ZYT-linearizability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,570 | On the Efficiency of Checking Perfect Privacy | 2006 | PODS | 6.0780779e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8602644e-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 |
| 58 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD | 0.00064826446 |
| 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 |
| 2,036 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.714898e-05 |
| 3,553 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9779134e-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