Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure
Summary: Proves that in the Abiteboul–Beeri complex-object algebra with the powerset operator, any algorithm evaluating transitive closure must use exponential space. Concludes powerset is inherently intractable for implementing fixpoint/TC queries, giving a strong lower bound. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dan Suciu
- 2. Jan Paredaens
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,808 | Normalizing Incomplete Databases | 1995 | PODS | 5.1725247e-05 |
| 12,837 | Tutorial: Languages for Collection Types | 1994 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,153 | Normal Forms and Conservative Properties for Query Languages over Collection Types | 1993 | PODS | 9.1328224e-05 |
| 2,646 | Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions | 1988 | PODS | 8.3749421e-05 |
| 5,765 | A Query Language for NC | 1994 | PODS | 6.1598109e-05 |
Previous
Page 1 / 1
Next