ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. JIP
  2. Vol.15
  3. No.3

On Query Transformation for Non-First-Normal-Form Relational Databases

https://ipsj.ixsq.nii.ac.jp/records/59618
https://ipsj.ixsq.nii.ac.jp/records/59618
f5dfe9ea-cf7c-44e7-850c-29d4916b9308
名前 / ファイル ライセンス アクション
IPSJ-JIP1503006.pdf IPSJ-JIP1503006.pdf (1.0 MB)
Copyright (c) 1992 by the Information Processing Society of Japan
オープンアクセス
Item type JInfP(1)
公開日 1992-11-30
タイトル
タイトル On Query Transformation for Non-First-Normal-Form Relational Databases
タイトル
言語 en
タイトル On Query Transformation for Non-First-Normal-Form Relational Databases
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
C & C Systems Research Laboratories NEC Corporation
著者所属(英)
en
C & C Systems Research Laboratories, NEC Corporation
著者名 Kunitoshi, Tsuruoka

× Kunitoshi, Tsuruoka

Kunitoshi, Tsuruoka

Search repository
著者名(英) Kunitoshi, Tsuruoka

× Kunitoshi, Tsuruoka

en Kunitoshi, Tsuruoka

Search repository
論文抄録
内容記述タイプ Other
内容記述 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.
論文抄録(英)
内容記述タイプ Other
内容記述 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.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA00700121
書誌情報 Journal of Information Processing

巻 15, 号 3, p. 386-393, 発行日 1992-11-30
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-6652
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-22 03:29:51.990468
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3