Reflective Relational Machines

Abstract We propose a model of database programming with reflection (dynamic generation of queries within the host programming language), called the reflective relational machine , and characterize the power of this machine in terms of known complexity classes. In particular, the polynomial time restriction of the reflective relational machine is shown to express PSPACE, and to correspond precisely to uniform circuits of polynomial depth and exponential size. This provides an alternative, logic based formulation of the uniform circuit model, which may be more convenient for problems naturally formulated in logic terms, and establishes that reflection allows for more “intense” parallelism, which is not attainable otherwise (unless P=PSPACE). We also explore the power of the reflective relational machine subject to restrictions on the number of variables used, emphasizing the case of sublinear bounds.

[1]  Harvey M. Friedman,et al.  Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[2]  R. L. Goodstein,et al.  Logic Colloquium '69 , 1972 .

[3]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[4]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[5]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[6]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[8]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[9]  Ashok K. Chandra.  Programming primitives for database languages , 1981, POPL '81.

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

[11]  Bruno Poizat.  Deux Ou Trois Choses Que je Sais de Ln , 1982, J. Symb. Log..

[12]  Neil Immerman.  Languages which capture complexity classes , 1983, STOC '83.

[13]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[14]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

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

[16]  Phokion G. Kolaitis,et al.  The decision problem for the probabilities of higher-order properties , 1987, STOC.

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

[18]  Daniel Leivant.  Monotonic use of space and computational complexity over abstract structures , 1989 .

[19]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[20]  Daniel Leivant,et al.  Descriptive Characterizations of Computational Complexity , 1989, J. Comput. Syst. Sci..

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

[22]  Phokion G. Kolaitis,et al.  0-1 laws for infinitary logics , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[23]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[24]  Peter van Emde Boas,et al.  Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[25]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[26]  Phokion G. Kolaitis,et al.  0-1 Laws for Infinitary Logics (Preliminary Report) , 1990, LICS 1990.

[27]  P. Boas.  Machine models and simulations , 1991 .

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

[29]  Kenneth A. Ross.  Relations with relation names as arguments: algebra and calculus , 1992, PODS '92.

[30]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[31]  David J. DeWitt,et al.  Parallel database systems: the future of high performance database systems , 1992, CACM.

[32]  François Bancilhon,et al.  Building an Object-Oriented Database System, The Story of O2 , 1992 .

[33]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[34]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[35]  Serge Abiteboul,et al.  Computing with Infinitary Logic , 1995, Theor. Comput. Sci..

[36]  Gottfried Vossen,et al.  Reflective Programming in the Relational Algebra , 1996, J. Comput. Syst. Sci..

[37]  Serge Abiteboul,et al.  Fixpoint logics, relational machines, and computational complexity , 1997, JACM.

[38]  A. Selman,et al.  Complexity theory retrospective II , 1998 .