Database Paper Browser

Back to papers

Magic-sets Transformation in Nonrecursive Systems

Summary: Algorithms to apply magic-sets (and its supplementary variant) in nonrecursive DBMSs while guaranteeing the transformed program remains nonrecursive. Introduces covered-subgoal elimination to drop subgoals and sometimes convert recursive queries into equivalent nonrecursive ones. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
980
Venue
PODS
Year
1992
Pagerank
4.842703e-05
Overall Rank
7,075 | 50.79%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
4,199 Implementation of Magic-sets in a Relational Database System 1994 SIGMOD 6.3662839e-05
12,617 Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases 2003 PODS 4.1945683e-05
12,796 Magic Factoring of Closure Programs (Extended Abstract) 1995 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
365 On the Power of Magic 1987 PODS 0.00025585898
445 The Magic of Duplicates and Aggregates 1990 VLDB 0.0002294367
1,185 Data Independent Recursion in Deductive Databases 1986 PODS 0.00013445831
1,423 Magic is Relevant 1990 SIGMOD 0.00012054867
Previous Page 1 / 1 Next

Semantically Similar Papers