Skip to main content
SpringerLink
Log in

A query language for NC (extended abstract)

  • Conference paper
  • First Online:
Logic and Computational Complexity (LCC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 960))

Included in the following conference series:

  • 147 Accesses

Abstract

We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC-computable. At a finer level, we relate k nested uses of recursion exactly to AC k, k≥ 1. We also give corresponding results for complex objects.

The authors were partially supported by NSF Grant CCR-90-57570 and ONR Contract NOOO14-93-11284

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, M. Vardi, and V. Vianu. Fixpoint logics, relational machines, and computational complexity. In Structure and Complexity, 1992.

    Google Scholar 

  2. Serge Abiteboul and Catriel Beeri. On the power of languages for the manipulation of complex objects. In Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988. Also available as INRIA Technical Report 846.

    Google Scholar 

  3. Serge Abiteboul and Victor Vianu. Generic computation and its complexity. In Proceedings of 23rd ACM Symposium on the Theory of Computing, 1991.

    Google Scholar 

  4. F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. A powerful and simple database language. In Proceedings of 14th International Conference on Very Large Data Bases, pages 97–105, 1988.

    Google Scholar 

  5. David Mix Barrington, Neil Immerman, and Howard Straubing. On uniformity within NC 1. Journal of Computer and System Sciences, 41:274–306, 1990.

    Article  Google Scholar 

  6. V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In Proceedings of 3rd International Workshop on Database Programming Languages, Naphlion, Greece, pages 9–19. Morgan Kaufmann, August 1991. Also available as UPenn Technical Report MS-CIS-92-17.

    Google Scholar 

  7. V. Breazu-Tannen and R. Subrahmanyam. Logical and computational aspects of programming with Sets/Bags/Lists. In LNCS 510: Proceedings of 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991, pages 60–75. Springer Verlag, 1991.

    Google Scholar 

  8. Val Breazu-Tannen, Peter Buneman, and Limsoon Wong. Naturally embedded query languages. In J. Biskup and R. Hull, editors, LNCS 646: Proceedings of 4th International Conference on Database Theory, Berlin, Germany, October, 1992, pages 140–154. Springer-Verlag, October 1992. Available as UPenn Technical Report MS-CIS-92-47.

    Google Scholar 

  9. Jin-Yi Cai, Martin Furer, and Neil Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389–410, 1992.

    Article  Google Scholar 

  10. Ashok Chandra and David Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21(2):156–178, 1980.

    Article  Google Scholar 

  11. P. Clote. Sequential, machine-independent characterizations of the parallel complexity classes AlogTime, AC k, NCk, and NC. In Samuel R. Buss and Philip J. Scot, editors, Feasible Mathematics. Birkhäuser, Boston, 1990.

    Google Scholar 

  12. Kevin L. Compton and Claude Laftamme. An algebra and a logic for NC. Information and Computation, 87(1/2):240–262, 1990.

    Article  Google Scholar 

  13. S. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.

    Article  Google Scholar 

  14. Anuj Dawar, Steven Lindell, and Scott Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 1993. To appear. Available as UPenn Technical Report MS-CIS-91-97.

    Google Scholar 

  15. Stephane Grumbach and Victor Vianu. Expressiveness and complexity of restricted languages for complex objects. In Proceedings of 3rd International Workshop on Database Programming Languages, Naphlion, Greece, pages 191–202. Morgan Kaufmann, August 1991.

    Google Scholar 

  16. Stephane Grumbach and Victor Vianu. Tractable query languages for complex object databases. Technical Report 1573, INRIA, Rocquencourt BP 105, 78153 Le Chesnay, France, December 1991. Extended abstract appeared in PODS 91.

    Google Scholar 

  17. Y. Gurevich. Algebra of feasible functions. In Proceedings of 24th IEEE Symposium on Foundations of Computer Science, pages 210–214. IEEE Computer Society Press, 1983.

    Google Scholar 

  18. Neil Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.

    Article  Google Scholar 

  19. Neil Immerman. Expressibility as a complexity measure: Results and directions. In Proceedings of 2nd Conference on Structure in Complexity Theory, pages 194–202, 1987.

    Google Scholar 

  20. Neil Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.

    Article  Google Scholar 

  21. Neil Immerman. Expressibility and parallel complexity. SIAM Journal of Computing, 18:625–638, 1989.

    Google Scholar 

  22. Neil Immerman, Sushant Patnaik, and David Stemple. The expressiveness of a family of finite set languages. In Proceedings of 10th ACM Symposium on Principles of Database Systems, pages 37–52, 1991.

    Google Scholar 

  23. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.

    Google Scholar 

  24. A. Ohori, P. Buneman, and V. Breazu-Tannen. Database programming in Machiavelli, a polymorphic language with static type inference. In James Clifford, Bruce Lindsay, and David Maier, editors, Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 46–57, Portland, Oregon, June 1989.

    Google Scholar 

  25. Jan Paredaens and Dirk Van Gucht. Possibilities and limitations of using flat operators in nested algebra expressions. In Proceedings of 7th ACM Symposium on Principles of Database Systems,Austin, Texas, pages 29–38, 1988.

    Google Scholar 

  26. Jan Paredaens and Dirk Van Gucht. Converting nested relational algebra expressions into flat algebra expressions. ACM Transaction on Database Systems, 17(1):65–93, March 1992.

    Google Scholar 

  27. D. Stott Parker, Eric Simon, and Patrick Valduriez. SVP: A model capturing sets, streams, and parallelism. In Li-Yan Yuan, editor, Proceedings of 18th International Conference on Very Large Databases, Vancouver, August 1992, pages 115–126, San Mateo, California, August 1992. Morgan-Kaufmann.

    Google Scholar 

  28. H.-J. Schek and M. H. Scholl. The relational model with relation-valued attributes. Information Systems, 11(2):137–147, 1986.

    Article  Google Scholar 

  29. Dan Suciu. Fixpoints and bounded fixpoints for complex objects. In Catriel Beeri, Atsushi Ohori, and Dennis Shasha, editors, Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pages 263–281. Springer-Verlag, January 1994. See also UPenn Technical Report MS-CIS-93-32.

    Google Scholar 

  30. Dan Suciu and Val Breazu-Tannen. A query language for NC. In Proceedings of 13th ACM Symposium on Principles of Database Systems, pages 167–178, Minneapolis, Minnesota, May 1994. See also UPenn Technical Report MS-CIS-94-05.

    Google Scholar 

  31. S. J. Thomas and P. C. Fischer. Nested relational structures. In P. C. Kanellakis and F. P. Preparata, editors, Advances in Computing Research: The Theory of Databases, pages 269–307, London, England, 1986. JAI Press.

    Google Scholar 

  32. M. Y. Vardi. The complexity of relational query languages. In Proceedings of 14th ACM SIGACT Symposium on the Theory of Computing, pages 137–146, San Francisco, California, 1982.

    Google Scholar 

  33. Limsoon Wong. Normal forms and conservative properties for query languages over collection types. In Proceedings of 12th ACM Symposium on Principles of Database Systems, pages 26–36, Washington, D. C., May 1993. See also UPenn Technical Report MS-CIS-92-59.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pennsylvania, USA

    Dan Suciu & Val Breazu-Tannen

Authors
  1. Dan Suciu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Val Breazu-Tannen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Leivant

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suciu, D., Breazu-Tannen, V. (1995). A query language for NC (extended abstract). In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-60178-3_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60178-4

  • Online ISBN: 978-3-540-44720-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation