The relational model with relation-valued attributes
Information Systems
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Languages that capture complexity classes
SIAM Journal on Computing
Expressibility and parallel complexity
SIAM Journal on Computing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
Converting nested algebra expressions into flat algebra expressions
ACM Transactions on Database Systems (TODS)
Normal forms and conservative properties for query languages over collection types
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of queries in the logical data model
ICDT Selected papers of the 4th international conference on Database theory
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Possibilities and limitations of using flat operators in nested algebra expressions
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polymorphic queries across sets, bags, and lists
ACM SIGPLAN Notices
Normalizing incomplete databases
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Perspectives on database theory
ACM SIGACT News
Query languages for bags: expressive power and complexity
ACM SIGACT News
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
Recursive Queries in Product Databases
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
| Hi-index | 0.00 |
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.