Magic Factoring of Closure Programs (Extended Abstract)
Summary: Extend magic factoring to closure programs with multiple IDB predicates by showing their rule grammar yields a regular language representable as a regular expression. Prove correctness and apply TGDs to transform the program into one that simulates an NFA for the expression, enabling substantial evaluation speedups. (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. Peter T. Wood (University of Cape Town)
BibTeX Citation
@inproceedings{wood_pods95,
address = {New York, NY, USA},
series = {{PODS} '95},
title = {{Magic Factoring of Closure Programs (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/212433.220209},
doi = {10.1145/212433.220209},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Wood, Peter T.},
year = {1995}
}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 |
|---|---|---|---|---|
| 313 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.0002168869 |
| 344 | On the Power of Magic | 1987 | PODS | 0.00020659405 |
| 3,922 | Hy+: A Hygraph-based Query and Visualization System | 1993 | SIGMOD | 7.016223e-05 |
| 4,099 | Argument Reduction by Factoring | 1989 | VLDB | 6.9030568e-05 |
| 4,425 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.7101609e-05 |
| 7,131 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS | 5.694968e-05 |
| 13,124 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,131 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS |
| 2 | 6,008 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD |
| 3 | 3,307 | Magic Conditions | 1990 | PODS |
| 4 | 7,079 | Adding Magic to an Optimising Datalog Compiler | 2008 | SIGMOD |
| 5 | 6,620 | An alternating fixpoint tailored to magic programs | 1993 | PODS |
| 6 | 6,948 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS |
| 7 | 13,099 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 8 | 9,981 | Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs | 1987 | VLDB |
| 9 | 13,124 | Factoring Augmented Regular Chain Programs | 1990 | VLDB |
| 10 | 4,099 | Argument Reduction by Factoring | 1989 | VLDB |