On Query Transformation for Non-First-Normal-Form Relational Databases
スポンサーリンク
概要
- 論文の詳細を見る
Simple extended tuple relational calculus is proposed for non-first-normal-form (NF2) relational databases, as a way of facilitating the understanding of query representation. In order to allow NF2 queries over first-normal-form (1NF) relational databases, a query transformation algorithm is a1so proposed. This transforms a query for a nested relation into one for an unnested relation. Additionally, the equivalence of transformed queries is proved in the sense that SELECT and UNNEST are commutable. The proposed extended tuple relational calculus and query transformation algorithm can serve as a basis for the safe implementation of NF2 relations over 1NF relations.
- 一般社団法人情報処理学会の論文
- 1992-11-30