DBScholar

Back to papers

Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions

Summary: Nested algebra with the nest operator has no extra expressiveness over ordinary relational algebra for queries with flat inputs and flat outputs. Implications: transitive closure remains inexpressible; powerset (not nest) yields strictly more power; provide rewritings to maximize flat operators. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
812
Venue
PODS
Year
1988
Pagerank
8.240179e-05
Overall Rank
2,701 | 81.48%
DOI
10.1145/308386.308402

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{paredaens_pods88,
        address = {New York, NY, USA},
        series = {{PODS} '88},
        title = {{Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions}},
        url = {https://dl.acm.org/doi/10.1145/308386.308402},
        doi = {10.1145/308386.308402},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Paredaens, Jan and Van Gucht, Dirk},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers