Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure

The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm is naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space. This proves that in general the powerset is an intractable operator for implementing fixpoint queries.

[1]  Gabriel M. Kuper,et al.  On the Complexity of Queries in the Logical Data Model , 1993, Theor. Comput. Sci..

[2]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

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

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

[7]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

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

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

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

[11]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[12]  Joel W. Robbin,et al.  Mathematical logic: a first course , 1969 .

[13]  Jianwen Su,et al.  On the expressive power of database queries with intermediate types , 1988, PODS '88.

[14]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.

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

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

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

[18]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[19]  Dan Suciu,et al.  A Query Language for NC , 1994, LCC.

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

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