Database Paper Browser

Back to papers

Magic Functions : A Technique To Optimize Extended Datalog Recursive Programs

Summary: MAGIC FUNCTIONS: a generalized method to optimize Datalog recursive programs via fixpoint functional equations solved with Tarski's theorem. Key novelty: push selections through recursion, support non-binary and cyclic rules with function symbols, and directly generate optimized relational algebra with symbolic pruning and range queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7784
Venue
VLDB
Year
1987
Pagerank
4.2751057e-05
Overall Rank
9,834 | 31.59%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,226 An Implementation Model For Reasoning With Complex Objects 1988 SIGMOD 4.5551494e-05
11,053 Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers 2024 VLDB 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers