Converting nested algebra expressions into flat algebra expressions

Authors:
Jan Paredaens;Dirk Van Gucht
Affiliations:
Univ. of Antwerp, Antwerp, Belgium;Indiana Univ., Bloomington
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1992

Citing 37
Cited 18

The relational model with relation-valued attributes

Information Systems
Non first normal form relations: An algebra allowing data restructuring

Journal of Computer and System Sciences
A calculus for complex objects

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A logic-programming/object-oriented cocktail

ACM SIGMOD Record
Theoretical foundation of algebraic optimization utilizing unnormalized relations

Proceedings on International conference on database theory
A DBMS prototype to support extended NF2 relations: an integrated view on flat tables and hierarchies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A database language for sets, lists and tables

Information Systems
Sets and negation in a logic data base language (LDL1)

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SQL/NF: a query language for ¬ 1NF relational databases

Information Systems
Extending relational algebra and relational calculus with set-valued attributes and aggregate functions

ACM Transactions on Database Systems (TODS)
Architecture and implementation of the Darmstadt database kernel system

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The Verso algebra or how to answer queries with fewer joins

Journal of Computer and System Sciences
Extended algebra and calculus for nested relational databases

ACM Transactions on Database Systems (TODS)
The powerset algebra as a result of adding programming constructs to the nested relational algebra

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
On the complexity of queries in the logical data model

Lecture notes in computer science on ICDT '88
A logical language for data and knowledge bases

A logical language for data and knowledge bases
The structure of the relational database model

The structure of the relational database model
Advanced information management (AIM): research in extended nested relations

Data Engineering
The data model and query language of LauRel

Data Engineering
A recursive algebra and query optimization for nested relations

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A uniform approach toward handling atomic and structured information in the nested relational database model

Journal of the ACM (JACM)
Logic programming with sets

Journal of Computer and System Sciences
The powerset algebra as a natural tool to handle nested database relations

Journal of Computer and System Sciences
On the expressive power of database queries with intermediate types

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A storage system for complex objects

OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
Principles of Database Systems

Principles of Database Systems
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Remarks on the algebra of non first normal form relations

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The DASDBS Project: Objectives, Experiences, and Future Prospects

IEEE Transactions on Knowledge and Data Engineering
The Many Faces of Query Monotonicity

EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Non First Normal Form Relations and Recursive Queries: An SQL-Based Approach

Proceedings of the Third International Conference on Data Engineering
Operations and the Properties on Non-First-Normal-Form Relational Databases

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Designing A Generalized NF2 Model with an SQL-Type Language Interface

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Supporting Flat Relations by a Nested Relational Kernel

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Implementation for Nested Relational Databases

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
On Line Processing of Compacted Relations

VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A Query Algebra for Object-Oriented Databases

A Query Algebra for Object-Oriented Databases

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
Comprehension syntax

ACM SIGMOD Record
Tutorial: languages for collection types

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New techniques for studying set languages, bag languages and aggregate functions

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A query language for NC

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure

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
Incremental computation of nested relational query expressions

ACM Transactions on Database Systems (TODS)
Deciding containment for queries with complex objects (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Typed query languages for databases containing queries

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Expressive power of SQL

Theoretical Computer Science - Database theory
Algebraic equivalences of nested relational operators

Information Systems
From complete to incomplete information and back

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
On the expressiveness of implicit provenance in query and update languages

ACM Transactions on Database Systems (TODS)
Positive higher-order queries

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
CRIUS: user-friendly database design

Proceedings of the VLDB Endowment
Foundations of rule-based query answering

RW'07 Proceedings of the Third international summer school conference on Reasoning Web

Quantified Score

Hi-index	0.00

Visualization

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.