### Abstract

Nested relations generalize ordinary flat relations by allowing tuple values to be either atomic or set valued. The nested algebra is a generalization of the flat relational algebra to manipulate nested relations. In this paper we study the expressive power of the nested algebra relative to its operation on flat relational databases. We show that the flat relational algebra is rich enough to extract the same "flat information" from a flat database as the nested algebra does. Theoretically, this result implies that recursive queries such as the transitive closure of a binary relation cannot be expressed in the nested algebra. Practically, this result is relevant to (flat) relational query optimization.

Original language | English |
---|---|

Pages (from-to) | 65-93 |

Number of pages | 29 |

Journal | ACM Transactions on Database Systems |

Volume | 17 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1992 |

## Fingerprint Dive into the research topics of 'Converting nested algebra expressions into flat algebra expressions'. Together they form a unique fingerprint.

## Cite this

Paredaens, J., & Van Gucht, D. (1992). Converting nested algebra expressions into flat algebra expressions.

*ACM Transactions on Database Systems*,*17*(1), 65-93. https://doi.org/10.1145/128765.128768