Navigation and schema transformations for producing nested relations from networks

Mizuho Iwaihara*, Tetsuya Furukawa, Yahiko Kambayashi

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Efficient procedures for producing nested relations from networks are considered. Various types of nested relations are defined according to the interaction between the networks' and nested relations' schemas. Among these types, partitioned normal form (PNF) and accordant nested relations are shown to be produced by an extended navigation, called touch information display (TID) navigation, which requires time proportional to the number of tuples in the relation. It is demonstrated that a network can effectively produce a variety of nested relations by navigation. The efficiency of production is classified according to the interaction between the schemas of networks and targets. Non-PNF and/or non-accordant targets are generated using duplicate depletion. On the other hand, PNF and accordant targets can be generated using only navigation, which requires linear time in the number of tuples in the relation. Furthermore, for the cases on non-PNF and non-accordant targets, the TID method exploits the existence of links, so that the size of the region of the subrelation upon which deletion of duplicated values should be performed is limited.

本文言語English
ホスト出版物のタイトルProceedings - International Conference on Data Engineering
出版社Publ by IEEE
ページ181-190
ページ数10
ISBN(印刷版)0818621389
出版ステータスPublished - 1991 4 1
外部発表はい
イベントProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
継続期間: 1991 4 81991 4 12

出版物シリーズ

名前Proceedings - International Conference on Data Engineering

Other

OtherProceedings of the 7th International Conference on Data Engineering
CityKobe, Jpn
Period91/4/891/4/12

ASJC Scopus subject areas

  • ソフトウェア
  • 信号処理
  • 情報システム

フィンガープリント

「Navigation and schema transformations for producing nested relations from networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル