Database Paper Browser

Back to papers

Efficiently Ordering Subgoals with Access Constraints [Extended Abstract]

Summary: Proves subgoal ordering under binding-pattern/access constraints for nonrecursive Datalog is PSPACE-complete in program size, even in restricted cases. Presents a practical, asymptotically optimal planner running linear in query-plan size with extensions for nested grouping, distributed and first-order queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1390
Venue
PODS
Year
2006
Pagerank
4.427232e-05
Overall Rank
8,937 | 37.83%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,384 Optimization of Multi-Domain Queries on the Web 2008 VLDB 4.1945683e-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.

Rank Cited Paper Year Venue Pagerank
127 Querying Heterogeneous Information Sources Using Source Descriptions 1996 VLDB 0.00044642203
291 Answering Queries Using Templates With Binding Patterns (Extended Abstract) 1995 PODS 0.00028831632
729 An Algorithm For Ordering Subgoals In Nail! 1988 PODS 0.00017483521
2,187 The Complexity Of Ordering Subgoals 1988 PODS 9.3375092e-05
2,432 Computing Capabilities of Mediators 1999 SIGMOD 8.8290243e-05
3,065 Processing First-Order Queries under Limited Access Patterns 2004 PODS 7.6230903e-05
4,647 Capability Based Mediation in TSIMMIS 1998 SIGMOD 6.0249946e-05
Previous Page 1 / 1 Next

Semantically Similar Papers