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)
Incoming Non-self Citations Over Time
Authors
- 1. Guizhen Yang (SRI International)
- 2. Michael Kifer (State University of New York at Stony Brook)
- 3. Vinay K. Chaudhri (SRI International)
BibTeX Citation
@inproceedings{yang_pods06,
address = {New York, NY, USA},
series = {{PODS} '06},
title = {{Efficiently Ordering Subgoals with Access Constraints [Extended Abstract]}},
url = {https://dl.acm.org/doi/10.1145/1142351.1142378},
doi = {10.1145/1142351.1142378},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Yang, Guizhen and Kifer, Michael and Chaudhri, Vinay K.},
year = {2006}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,867 | Optimization of Multi-Domain Queries on the Web | 2008 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 117 | Querying Heterogeneous Information Sources Using Source Descriptions | 1996 | VLDB | 0.00031630695 |
| 301 | Answering Queries Using Templates With Binding Patterns (Extended Abstract) | 1995 | PODS | 0.00021682744 |
| 1,332 | An Algorithm For Ordering Subgoals In Nail! | 1988 | PODS | 0.00010998392 |
| 2,567 | Computing Capabilities of Mediators | 1999 | SIGMOD | 8.2882658e-05 |
| 2,790 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 8.0100392e-05 |
| 3,640 | The Complexity Of Ordering Subgoals | 1988 | PODS | 7.1439794e-05 |
| 4,638 | Capability Based Mediation in TSIMMIS | 1998 | SIGMOD | 6.4920463e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,365 | Size Bound-Adorned Datalog | 2026 | PODS |
| 2 | 301 | Answering Queries Using Templates With Binding Patterns (Extended Abstract) | 1995 | PODS |
| 3 | 869 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD |
| 4 | 6,429 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS |
| 5 | 1,660 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 6 | 8,136 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 7 | 6,131 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD |
| 8 | 2,790 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS |
| 9 | 2,923 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS |
| 10 | 6,741 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |