Database Paper Browser

Back to papers

An Algorithm For Ordering Subgoals In Nail!

Summary: Polynomial-time algorithm for ordering subgoals to generate rule-goal graphs in NAIL! (polynomial when recursive predicate arity is bounded) to support ICODE generation. Always finds a rule-goal graph if one exists; implemented in Cprolog but may be suboptimal. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
818
Venue
PODS
Year
1988
Pagerank
0.00017483521
Overall Rank
729 | 94.94%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
127 Querying Heterogeneous Information Sources Using Source Descriptions 1996 VLDB 0.00044642203
870 Query Optimization in the Presence of Limited Access Patterns 1999 SIGMOD 0.00015771912
2,187 The Complexity Of Ordering Subgoals 1988 PODS 9.3375092e-05
2,492 Partial Results for Online Query Processing 2002 SIGMOD 8.6526489e-05
3,283 Magic Conditions 1990 PODS 7.280826e-05
6,957 Adding Magic to an Optimising Datalog Compiler 2008 SIGMOD 4.8859842e-05
8,937 Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] 2006 PODS 4.427232e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
16 MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) 1986 PODS 0.0010066783
2,187 The Complexity Of Ordering Subgoals 1988 PODS 9.3375092e-05
Previous Page 1 / 1 Next

Semantically Similar Papers