DBScholar

Back to papers

Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs

Summary: Generalizes Magic Functions to compile extended recursive Datalog as fixpoint functional equations, pushing selections through recursion and producing only query-relevant answers. Directly yields optimized relational algebra, enables symbolic redundancy elimination, and supports non-binary/cyclic rules, function symbols, and range queries. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7975
Venue
VLDB
Year
1987
Pagerank
5.1845938e-05
Overall Rank
9,981 | 31.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{gardarin_vldb87,
        title = {{Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs}},
        author = {Gardarin, Georges},
        journal = {PVLDB},
        series = {{VLDB} '87},
        pages = {21},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers