SEMANTIC CONSTRAINTS EXPRESSED BY NETWORK MODEL.

Yahiko Kambayashi, Tetsuya Furukawa

研究成果: 会議への寄与タイプ論文

抄録

In this paper semantic constraints expressed by network database model are summarized. In relational model functional dependencies and a join dependency can be expressed by a set of relations. Network model is different from relational model by the following reasons; (1) The basic structure is a DBTG set not a relation, (2) ordered set can be expressed directly, (3) to improve the efficiency of query processing, redundancy is permitted, (4) multiple paths between two attributes are permitted. Semantic constraints for a set of DBTG set types correspond to multivalued and join dependencies. Correspondence between Bachman diagrams and such dependencies are given. Problems of Lien's definitions of dependencies are pointed out and new definitions are given. Multiple paths which are used to improve efficiency of query processing are also summarized.

元の言語英語
ページ201-206
ページ数6
出版物ステータス出版済み - 12 1 1985

Fingerprint

Computer networks
Semantics
Mathematical models
Query processing
Redundancy

All Science Journal Classification (ASJC) codes

  • Engineering(all)

これを引用

SEMANTIC CONSTRAINTS EXPRESSED BY NETWORK MODEL. / Kambayashi, Yahiko; Furukawa, Tetsuya.

1985. 201-206.

研究成果: 会議への寄与タイプ論文

@conference{4cfd4486dab8482082ca3232a947c32b,
title = "SEMANTIC CONSTRAINTS EXPRESSED BY NETWORK MODEL.",
abstract = "In this paper semantic constraints expressed by network database model are summarized. In relational model functional dependencies and a join dependency can be expressed by a set of relations. Network model is different from relational model by the following reasons; (1) The basic structure is a DBTG set not a relation, (2) ordered set can be expressed directly, (3) to improve the efficiency of query processing, redundancy is permitted, (4) multiple paths between two attributes are permitted. Semantic constraints for a set of DBTG set types correspond to multivalued and join dependencies. Correspondence between Bachman diagrams and such dependencies are given. Problems of Lien's definitions of dependencies are pointed out and new definitions are given. Multiple paths which are used to improve efficiency of query processing are also summarized.",
author = "Yahiko Kambayashi and Tetsuya Furukawa",
year = "1985",
month = "12",
day = "1",
language = "English",
pages = "201--206",

}

TY - CONF

T1 - SEMANTIC CONSTRAINTS EXPRESSED BY NETWORK MODEL.

AU - Kambayashi, Yahiko

AU - Furukawa, Tetsuya

PY - 1985/12/1

Y1 - 1985/12/1

N2 - In this paper semantic constraints expressed by network database model are summarized. In relational model functional dependencies and a join dependency can be expressed by a set of relations. Network model is different from relational model by the following reasons; (1) The basic structure is a DBTG set not a relation, (2) ordered set can be expressed directly, (3) to improve the efficiency of query processing, redundancy is permitted, (4) multiple paths between two attributes are permitted. Semantic constraints for a set of DBTG set types correspond to multivalued and join dependencies. Correspondence between Bachman diagrams and such dependencies are given. Problems of Lien's definitions of dependencies are pointed out and new definitions are given. Multiple paths which are used to improve efficiency of query processing are also summarized.

AB - In this paper semantic constraints expressed by network database model are summarized. In relational model functional dependencies and a join dependency can be expressed by a set of relations. Network model is different from relational model by the following reasons; (1) The basic structure is a DBTG set not a relation, (2) ordered set can be expressed directly, (3) to improve the efficiency of query processing, redundancy is permitted, (4) multiple paths between two attributes are permitted. Semantic constraints for a set of DBTG set types correspond to multivalued and join dependencies. Correspondence between Bachman diagrams and such dependencies are given. Problems of Lien's definitions of dependencies are pointed out and new definitions are given. Multiple paths which are used to improve efficiency of query processing are also summarized.

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

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

M3 - Paper

AN - SCOPUS:0022279213

SP - 201

EP - 206

ER -