Linearizing nonlinear recursions in polynomial time (Extended Abstract)
Summary: Characterizes when bilinear recursions admit equivalent linear recursions: iff a designated partial proof tree is contained in a bounded set of generated partial proof trees. Replaces exponential CQ-containment tests by necessary-and-sufficient syntactic checks decidable in polynomial time, enabling efficient linear-logic evaluation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yatin P. Saraiya (Stanford University)
BibTeX Citation
@inproceedings{saraiya_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{Linearizing nonlinear recursions in polynomial time (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/73721.73740},
doi = {10.1145/73721.73740},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Saraiya, Yatin P.},
year = {1989}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,970 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.3746238e-05 |
| 7,549 | Hard problems for simple logic programs | 1990 | SIGMOD | 5.6011655e-05 |
| 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 5.5225498e-05 |
| 13,099 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS | 5.093636e-05 |
| 13,116 | Semigroup techniques in recursive query optimization | 1990 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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.00060089598 |
| 63 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00038782376 |
| 313 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.0002168869 |
| 344 | On the Power of Magic | 1987 | PODS | 0.00020659405 |
| 429 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00018607152 |
| 1,970 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.3746238e-05 |
| 4,337 | Magic Counting Methods | 1987 | SIGMOD | 6.7554367e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,245 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS |
| 2 | 7,824 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS |
| 3 | 4,425 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS |
| 4 | 3,603 | Overbound and Right-Linear Queries | 1991 | PODS |
| 5 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 6 | 4,150 | Commutativity and Its Role in the Processing of Linear Recursion | 1989 | VLDB |
| 7 | 1,970 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS |
| 8 | 1,921 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD |
| 9 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 10 | 13,179 | A Necessary Condition For A Doubly Recursive Rule To Be Equivalent To A Linear Recursive Rule | 1987 | SIGMOD |