Database Paper Browser

Back to papers

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)

Paper ID
929
Venue
PODS
Year
1991
Pagerank
4.1945683e-05
Overall Rank
12,904 | 10.23%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers