A Relational Data Language with Simplified Binary Relation Handling Capability.
Yahiko Kambayashi, Katsumi Tanaka, Shuzo Yajima:
A Relational Data Language with Simplified Binary Relation Handling Capability.
VLDB 1977: 338-350@inproceedings{DBLP:conf/vldb/KambayashiTY77,
author = {Yahiko Kambayashi and
Katsumi Tanaka and
Shuzo Yajima},
title = {A Relational Data Language with Simplified Binary Relation Handling
Capability},
booktitle = {Proceedings of the Third International Conference on Very Large
Data Bases, October 6-8, 1977, Tokyo, Japan},
publisher = {IEEE Computer Society},
year = {1977},
pages = {338-350},
ee = {db/conf/vldb/KambayashiTY77.html},
crossref = {DBLP:conf/vldb/77},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
In order to develop a general purpose research informatlon system, we have introduced a new relational
data language RLB (Relational data Language with simplified Binary relation handling capability), which
can handle bibliographic data as well as data handled by ordinary data base systems. RLB is based on
relational calculus introduced by Codd, but allows queries to be written in relatively high level
expressions by defining and using proper binary relations over a set of n-ary relations. The
characteristics of this language are as follows: (1) Binary relations between attributes or compound
attributes can be defined and used to formulate queries; (2) Familiar operations for binary relations
such as a concatenation, a closure operation, Boolean operations and comparison operators are provided
to simplify queries; (3) Binary relations are classified into several types by their corresponding
graphs. This classification can be used for checking storage operations such as updating, insertion and
deletion, as well as for selecting efficient physical storage structures; (4) Dependencies between
attributes are also regarded as binary relations and thus, they are classified for the same objectives
described in (3). In this classification, functional dependencies, multivalued dependencies and
set - set dependencies are contained; (5) It can provide several facilities similar to mapping
oriented languages (for example, SEQUEL) or network model based languages (for example, LSL).
Furthermore, an output system for binary relations between domain compatible attributes is also
described, which produces a tree expansion of the given graph.
Copyright © 1977 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Proceedings of the Third International Conference on Very Large Data Bases, October 6-8, 1977, Tokyo, Japan.
IEEE Computer Society 1977
Contents
References
- [ARIS7611]
- ...
- [ASTRC7510]
- Morton M. Astrahan, Donald D. Chamberlin:
Implementation of a Structured English Query Language.
Commun. ACM 18(10): 580-588(1975)
- [BERN7612]
- Philip A. Bernstein:
Synthesizing Third Normal Form Relations from Functional Dependencies.
ACM Trans. Database Syst. 1(4): 277-298(1976)
- [CODD7006]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)
- [CODD7111D]
- E. F. Codd:
A Database Sublanguage Founded on the Relational Calculus.
SIGFIDET Workshop 1971: 35-68
- [CHAMA7606]
- ...
- [DATE74]
- ...
- [DEO-74]
- ...
- [FAGI7607]
- Ronald Fagin:
Multivalued Dependencies and a New Normal Form for Relational Databases.
ACM Trans. Database Syst. 2(3): 262-278(1977)
- [MART75]
- ...
- [SENK7501]
- ...
- [STONW7609]
- Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held:
The Design and Implementation of INGRES.
ACM Trans. Database Syst. 1(3): 189-222(1976)
- [TSIC7606]
- Dennis Tsichritzis:
LSL: A Link and Selector Language.
SIGMOD Conference 1976: 123-133
- [UEMU7701]
- ...
- [YAJIK7701]
- ...
- [ARIS7611]
- ...
Copyright © Tue Mar 16 02:21:55 2010
by Michael Ley (ley@uni-trier.de)