iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BF01762108
Parallel complexity of logical query programs | Algorithmica Skip to main content
Springer Nature Link
Log in

Parallel complexity of logical query programs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider the parallel time complexity of logic programs without function symbols, called logical query programs, or Datalog programs. We give a PRAM algorithm for computing the minimum model of a logical query program, and show that for programs with the “polynomial fringe property,” this algorithm runs in time that is logarithmic in the input size, assuming that concurrent writes are allowed if they are consistent. As a result, the “linear” and “piecewise linear” classes of logic programs are inN C. Then we examine several nonlinear classes in which the program has a single recursive rule that is an “elementary chain.” We show that certain nonlinear programs are related to GSM mappings of a balanced parentheses language, and that this relationship implies the “polynomial fringe property;” hence such programs are inN C Finally, we describe an approach for demonstrating that certain logical query programs are log space complete forP, and apply it to both elementary single rule programs and nonelementary programs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Afrati and C. H. Papadimitriou. The parallel complexity of simple chain queries. In6th ACM Symposium on Principles of Database Systems, pp. 210–213, 1987.

  2. A. V. Aho and J. D. Ullman. Universality of data retrieval languages. In6th ACM Symposium on Principles of Programming Languages, pp. 110–120, 1979.

  3. K. R. Apt and M. H. Van Emden. Contributions to the theory of logic programming.J. Assoc. Comput. Math.,29(3):841–862, 1982.

    MATH  Google Scholar 

  4. M. J. Atallah and S. E. Hambrusch. Solving tree problems on a mesh-connected processor array. In26th FOCS, pp. 222–231, 1985.

  5. A. Chandra and D. Harel. Structure and complexity of relational queries.J. Comput. System Sci.,25(1):99–128, 1982.

    Article  MATH  Google Scholar 

  6. S. A. Cook. An observation on time-storage trade-off.J. Comput. System Sci.,9(3):308–316, 1974.

    MATH  MathSciNet  Google Scholar 

  7. S. A. Cook. A taxonomy of problems with fast parallel algorithms.Inform. and Control,64(1):2–22, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. S. Cosmadakis and P. C. Kanellakis. Parallel evaluation of recursive rule queries. In5th ACM Symposium on Principles of Database Systems, pp. 280–293, 1986.

  9. S. Ginsburg and E. H. Spanier. Finite turn pushdown automata.SIAM J. Control,4(3):429–453, 1966.

    Article  MATH  MathSciNet  Google Scholar 

  10. S. A. Greibach. A note on undecidable properties of formal languages.Math Systems Theory,2(1):1–6, 1968.

    Article  MATH  MathSciNet  Google Scholar 

  11. S. A. Greibach. The hardest context-free language.SIAM J. Comput.,2(4):304–310, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. E. Hopcroft and J. D. Ullman.Introduction to Automata Theory, Languages, and Computation. Addision-Wesley, Reading, MA, 1979.

    Google Scholar 

  13. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time.Theor. Comput. Sci. 3(1):105–117, 1976.

    Article  MathSciNet  Google Scholar 

  14. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In26th FOCS, pp. 478–489, 1985.

  15. G. L. Miller, V. Ramachandran, and E. Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. InVLSI Algorithms and Architectures, pp. 236–245, Springer-Verlag, New York, 1986.

    Google Scholar 

  16. W. L. Ruzzo. Tree-size bounded alternation.J. Comput. System Sci.,21(2):218–235, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  17. E. Shapiro. Alternation and the computational complexity of logic programs.J. Logic Programming. 1(1):19–23, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits.SIAM J. Comput.,13(2):409–422, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. D. Ullman and A. Van Gelder. Parallel Complexity of Logical Query Programs. Technical Report STAN-CS-85-1089, Dept. of Computer Science, Stanford University, Stanford, CA, 1985 (short version presented at27th FOCS, 1986).

    Google Scholar 

  20. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation on polynomials using few processors.SIAM J. Comput.,12(4):641–644, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. H. Van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language.J. Assoc. Comput. Math.,23(4):733–742, 1976.

    MATH  Google Scholar 

  22. A. Van Gelder. Negation as failure using tight derivations for general logic programs. InProc. Third IEEE Symposium on Logic Programming, 1986 (preliminary version also presented in Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC, 1986).

  23. M. Vardi. Complexity of relational queries. In14th ACM Symposium on Theory of Computing, pp. 137–145, 1982.

  24. M. Y. Vardi. Querying logical databases. In4th PODS, pp. 57–65, 1985.

Download references

Author information

Author notes

  1. Allen Van Gelder

    Present address: Department of Computer Science, University of California, 95064, Santa Cruz, CA, USA

Authors and Affiliations

  1. Department of Computer Science, Stanford University, 94305, Stanford, CA, USA

    Jeffrey D. Ullman & Allen Van Gelder

Authors
  1. Jeffrey D. Ullman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Allen Van Gelder
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Jeffrey Scott Vitter.

Supported by NSF Grant IST-84-12791, a grant of IBM Corporation, and ONR contract N00014-85-C-0731.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ullman, J.D., Van Gelder, A. Parallel complexity of logical query programs. Algorithmica 3, 5–42 (1988). https://doi.org/10.1007/BF01762108

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762108

Key words

Search

Navigation