Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases
Summary: Presents factoring and the notion of proof-tree removability: a uniform transformation framework that rewrites Datalog programs to ensure selected recursive subgoals occur only a bounded number of times in proof trees. Generalizes recursively redundant subgoals to produce equivalent programs with smaller, cheaper recursion without solving undecidable boundedness. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Laks V. S. Lakshmanan (Concordia University)
- 2. Héctor J. Hernández (New Mexico State University)
BibTeX Citation
@inproceedings{lakshmanan_pods91,
address = {New York, NY, USA},
series = {{PODS} '91},
title = {{STRUCTURAL QUERY OPTIMIZATION — A UNIFORM FRAMEWORK FOR SEMANTIC QUERY OPTIMIZATION IN DEDUCTIVE DATABASES}},
url = {https://dl.acm.org/doi/10.1145/113413.113423},
doi = {10.1145/113413.113423},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lakshmanan, Laks V. S. and Hernández, Héctor J.},
year = {1991}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 946 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.00012936921 |
| 1,201 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00011560838 |
| 1,830 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.5498891e-05 |
| 2,024 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.166955e-05 |
| 2,062 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.0974416e-05 |
| 3,541 | Data Functions, Datalog and Negation (Extended Abstract) | 1988 | SIGMOD | 7.2161746e-05 |
| 5,413 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 6.1401229e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,633 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS |
| 2 | 5,050 | On the Optimization of Recursive Relational Queries: Application to Graph Queries | 2020 | SIGMOD |
| 3 | 8,148 | Optimization of Object-Oriented Recursive Queries using Cost-Controlled Strategies | 1992 | SIGMOD |
| 4 | 7,139 | Optimizing Recursive Queries with Program Synthesis | 2022 | SIGMOD |
| 5 | 8,356 | Optimizing Nested Recursive Queries | 2024 | SIGMOD |
| 6 | 6,429 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS |
| 7 | 6,433 | Optimizing Existential Datalog Queries | 1988 | PODS |
| 8 | 6,741 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 9 | 13,406 | Semigroup techniques in recursive query optimization | 1990 | PODS |
| 10 | 2,923 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS |