Database Paper Browser

Back to papers

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)

Paper ID
1066
Venue
PODS
Year
1995
Pagerank
4.1945683e-05
Overall Rank
12,796 | 10.99%
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.

Rank Cited Paper Year Venue Pagerank
200 OPTIMIZING DATALOG PROGRAMS (Extended Abstract) 1987 PODS 0.00035012858
365 On the Power of Magic 1987 PODS 0.00025585898
3,759 Hy+: A Hygraph-based Query and Visualization System 1993 SIGMOD 6.7810039e-05
3,999 EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) 1987 PODS 6.5469939e-05
4,178 Argument Reduction by Factoring 1989 VLDB 6.3812002e-05
7,075 Magic-sets Transformation in Nonrecursive Systems 1992 PODS 4.842703e-05
12,929 Factoring Augmented Regular Chain Programs 1990 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers