A Query Language for NC

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 ACk, k≥ 1. We also give corresponding results for complex objects.

[1]  Neil Immerman,et al.  Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[2]  Dan Suciu,et al.  A query language for NC , 1994, PODS '94.

[3]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[4]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[5]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[6]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[7]  Val Tannen,et al.  Logical and Computational Aspects of Programming with Sets/Bags/Lists , 1991, ICALP.

[8]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Limsoon Wong,et al.  Aggregate Functions, Conservative Extensions, and Linear Orders , 1993, DBPL.

[10]  Limsoon Wong,et al.  Normal forms and conservative properties for query languages over collection types , 1993, PODS.

[11]  Claude Laflamme,et al.  An Algebra and a Logic for NC¹ , 1990, Inf. Comput..

[12]  Patrick Valduriez,et al.  FAD, a Powerful and Simple Database Language , 1987, VLDB.

[13]  Dan Suciu,et al.  Fixpoints and Bounded Fixpoints for Complex Objects , 1993 .

[14]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[15]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[16]  Dan Suciu.  Bounded Fixpoints for Complex Objects , 1993 .

[17]  Neil Immerman,et al.  The expressiveness of a family of finite set languages , 1991, PODS '91.

[18]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, PODS '91.

[19]  Limsoon Wong,et al.  Naturally Embedded Query Languages , 1992, ICDT.

[20]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[21]  Silvio Micali,et al.  Advances in Computing Research: The Theory of Databases , 1986 .

[22]  Victor Vianu,et al.  Expressiveness and Complexity of Restricted Languages for Complex Objects , 1991, DBPL.

[23]  Neil Immerman,et al.  Expressibility as a complexity measure: results and directions , 1987, SCT.

[24]  Peter Buneman,et al.  Database programming in Machiavelli—a polymorphic language with static type inference , 1989, SIGMOD '89.

[25]  Patrick C. Fischer,et al.  Nested Relational Structures , 1986, Adv. Comput. Res..

[26]  A. Dawar,et al.  Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..

[27]  P. Clote.  Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC , 1990 .

[28]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[29]  Peter Buneman,et al.  Structural Recursion as a Query Language , 1992, DBPL.

[30]  Dirk Van Gucht,et al.  Possibilities and limitations of using flat operators in nested algebra expressions , 1988, PODS '88.

[31]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[32]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[33]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[34]  Victor Vianu,et al.  The Power of Methods With Parallel Semantics , 1991, VLDB.

[35]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[36]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..