Article

Free access

The complexity of ordering subgoals

Authors:

Jeffrey D. Ullman,

Moshe Y. VardiAuthors Info & Claims

PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 74 - 81

https://doi.org/10.1145/308386.308417

Published: 01 March 1988 Publication History

PDF eReader

Abstract

Selection of an appropriate order for the evaluation of subgoals in a logical rule frequently is essential for efficiency. We formulate the problem as one of feasible subgoal orders and show that the question is inherently exponential in time. The proof is by reduction from linear-space alternating Turing machine recognition, which appears to be far easier, in this case, than the more obvious reduction from exponential-time (ordinary) Turing machines

References

[1]

Bancdhon, F, D Miner, Y Saglv, and J D Ullman {1986} "Magic sets and other strange ways to implement loglc programs," Proc Fifth ACM Symposium on Prmczples of Database Systems, pp 1-15

Digital Library

Google Scholar

[2]

Chandra, A K, D C Korea, and L,I Stoekmeyer {1981} "Alternation," 3 ACM 28 1, pp 114-133

Digital Library

Google Scholar

[3]

Cook, S A {1974} "An observation on time-storage trade off," J Computer and System Sciences 9 3, pp 308-316

Google Scholar

[4]

Morns, K {1988} "An Mgonthm for ordering subgolas m NAILv', thin proceedings

Google Scholar

[5]

Morns, K, J F Naughton, Y Saralya, J D Ullman, and A Van Gelder {1987} "Overview of the NAILt system," unpublished memorandum, Dept of CS, Stanford Umv, to appear m Database Engineering

Google Scholar

[6]

Sacca, D and C Zamolo {1987} "Implementatlon of recursive querms for a data language based on pure Horn loglc," Proc Fourth Intl Con/" on Loglc Programming, pp 104-135, MIT Press,Cambridge

Google Scholar

[7]

Shaplro, E {1984} "Alternatlon and the computatlonal complexity of loglc programs," J Logw Programming 1 1, pp 19-33

Digital Library

Google Scholar

[8]

Ullman, J D {1985} "Implementatlon of loglcM query languages for databases," A CM Trans on Database Systems 10 3, pp 289-321

Digital Library

Google Scholar

Cited By

View all

Deutsch ALudäscher BNash A(2007)Rewriting queries using views with access patterns under integrity constraintsTheoretical Computer Science10.1016/j.tcs.2006.11.008371:3(200-226)Online publication date: 25-Feb-2007
https://dl.acm.org/doi/10.1016/j.tcs.2006.11.008
Debray S(2005)On the complexity of dataflow analysis of logic programsAutomata, Languages and Programming10.1007/3-540-55719-9_100(509-520)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55719-9_100
Nash ALudäscher B(2004)Processing Unions of Conjunctive Queries with Negation under Limited Access PatternsAdvances in Database Technology - EDBT 200410.1007/978-3-540-24741-8_25(422-440)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24741-8_25
Show More Cited By

Recommendations

An ordering on subgoals for planning

Subgoal ordering is a type of control information that has received much attention in AI planning community. In this paper we formulate precisely a subgoal ordering in the situation calculus. We show how information about this subgoal ordering can be ...
Ordering problem subgoals
IJCAI'89: Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Most past research work on problem subgoal ordering are of a heuristic nature and very little attempt has been made to reveal the inherent relationship between subgoal ordering constraints and problem operator schemata. As a result, subgoal ordering ...
The Landscape of Communication Complexity Classes

We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between $${\mathsf{P}}$$P and $${\mathsf{PSPACE}}$$PSPACE, short of proving lower bounds ...

Comments

Information & Contributors

Information

Published In

PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

March 1988

352 pages

ISBN:0897912632

DOI:10.1145/308386

Chairmen:
Chris Edmondson-Yurkanan
Univ. of Texas at Austin, Austin
,
Mihalis Yannakakis
AT&T Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS05

Sponsor:

SIGMOD/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
297
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)12

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Deutsch ALudäscher BNash A(2007)Rewriting queries using views with access patterns under integrity constraintsTheoretical Computer Science10.1016/j.tcs.2006.11.008371:3(200-226)Online publication date: 25-Feb-2007
https://dl.acm.org/doi/10.1016/j.tcs.2006.11.008
Debray S(2005)On the complexity of dataflow analysis of logic programsAutomata, Languages and Programming10.1007/3-540-55719-9_100(509-520)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55719-9_100
Nash ALudäscher B(2004)Processing Unions of Conjunctive Queries with Negation under Limited Access PatternsAdvances in Database Technology - EDBT 200410.1007/978-3-540-24741-8_25(422-440)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24741-8_25
Yerneni RLi CUllman JGarcia-Molina H(1999)Optimizing Large Join Queries in Mediation SystemsDatabase Theory — ICDT’9910.1007/3-540-49257-7_22(348-364)Online publication date: 15-Jan-1999
https://doi.org/10.1007/3-540-49257-7_22
Hinkelmann KHintze H(1997)State-saving transformations for efficient bottom-upAnnals of Mathematics and Artificial Intelligence10.1023/A:101894071344620:1-4(335-356)Online publication date: 9-Jan-1997
https://dl.acm.org/doi/10.1023/A%3A1018940713446
Han J(1988)Selection of Processing Strategies for Different Recursive QueriesProceedings of the Third International Conference on Data and Knowledge Bases10.1016/B978-1-4832-1313-2.50011-1(59-68)Online publication date: 1988
https://doi.org/10.1016/B978-1-4832-1313-2.50011-1

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

An ordering on subgoals for planning

Ordering problem subgoals

The Landscape of Communication Complexity Classes

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

An ordering on subgoals for planning

Ordering problem subgoals

The Landscape of Communication Complexity Classes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations