Navigation and schema transformations for producing nested relations from networks

Mizuho Iwaihara, Tetsuya Furukawa, Yahiko Kambayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages181-190
Number of pages10
ISBN (Print)0818621389
Publication statusPublished - 1991 Apr
Externally publishedYes
EventProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
Duration: 1991 Apr 81991 Apr 12

Other

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

Fingerprint

Navigation
Display devices

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Iwaihara, M., Furukawa, T., & Kambayashi, Y. (1991). Navigation and schema transformations for producing nested relations from networks. In Proceedings - International Conference on Data Engineering (pp. 181-190). Piscataway, NJ, United States: Publ by IEEE.

Navigation and schema transformations for producing nested relations from networks. / Iwaihara, Mizuho; Furukawa, Tetsuya; Kambayashi, Yahiko.

Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. p. 181-190.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Iwaihara, M, Furukawa, T & Kambayashi, Y 1991, Navigation and schema transformations for producing nested relations from networks. in Proceedings - International Conference on Data Engineering. Publ by IEEE, Piscataway, NJ, United States, pp. 181-190, Proceedings of the 7th International Conference on Data Engineering, Kobe, Jpn, 91/4/8.
Iwaihara M, Furukawa T, Kambayashi Y. Navigation and schema transformations for producing nested relations from networks. In Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 181-190
Iwaihara, Mizuho ; Furukawa, Tetsuya ; Kambayashi, Yahiko. / Navigation and schema transformations for producing nested relations from networks. Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 181-190
@inproceedings{a13ec5194bc84ca6905d79204807d8ff,
title = "Navigation and schema transformations for producing nested relations from networks",
abstract = "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.",
author = "Mizuho Iwaihara and Tetsuya Furukawa and Yahiko Kambayashi",
year = "1991",
month = "4",
language = "English",
isbn = "0818621389",
pages = "181--190",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Navigation and schema transformations for producing nested relations from networks

AU - Iwaihara, Mizuho

AU - Furukawa, Tetsuya

AU - Kambayashi, Yahiko

PY - 1991/4

Y1 - 1991/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026140288&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026140288&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026140288

SN - 0818621389

SP - 181

EP - 190

BT - Proceedings - International Conference on Data Engineering

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -