A relational database machine with large semiconductor disk and hardware relational algebra processor

1984 ◽  
Vol 2 (2) ◽  
pp. 131-155 ◽  
Author(s):  
Shigeki Shibayama ◽  
Takeo Kakuta ◽  
Nobuyoshi Miyazaki ◽  
Haruo Yokota ◽  
Kunio Murakami
1980 ◽  
Vol 3 (3) ◽  
pp. 363-377
Author(s):  
John Grant

In this paper we investigate the inclusion of incomplete information in the relational database model. This is done by allowing nonatomic entries, i.e. sets, as elements in the database. A nonatomic entry is interpreted as a set of possible elements, one of which is the correct one. We deal primarily with numerical entries where an allowed set is an interval, and character string entries. We discuss the various operations of the relational algebra as well as the notion of functional dependency for the database model.


1986 ◽  
pp. 85-126 ◽  
Author(s):  
M. Missikoff ◽  
S. Salza ◽  
M. Terranova

1993 ◽  
Vol 24 (9) ◽  
pp. 1-13
Author(s):  
Haruo Hayami ◽  
Tetsuji Satoh ◽  
Toshio Nakamura ◽  
Junichi Kuroiwa ◽  
Hideaki Takeda

1987 ◽  
Vol 2 (4) ◽  
pp. 265-275 ◽  
Author(s):  
Liming Meng ◽  
Xiaofei Xu ◽  
Huiyou Chang ◽  
Guangxi Chen ◽  
Mingzeng Hu ◽  
...  

Author(s):  
Alexey Senchenko

Currently, databases are widely used in almost all areas of human activity. For all variety of different types of databases the most common are relational (table) databases, mathematical model of which was proposed by E. Codd. From mathematical point of view, a relational database is a finite set of finite relations between different predefined sets of basic data. Table algebra introduced by V.N. Red’ko and D.B. Buy is based on Codd’s relational algebra and significantly improves it. It formed the theoretical foundation of modern database query language. Elements of the carrier of table algebra specify relational data structures, and signature operations are based on the basic table manipulations in relational algebra and SQL-like languages. One of the most actual tasks in relational and table algebras is the problem of equivalent transformation of expressions in order to minimize or reduce them to a standard form; it is one of the stages of query optimization, and can also significantly reduce the processing time of information in relational database management systems. For the decision of this problem the interrelations between the basic table operations are used. In the present, a significant number of such interrelations have been established, most of which for the general case are performed as inclusions. The author has found criteria for the transition of some such inclusions into equalities. These criteria are expressed in terms of the active domains of the tables and are natural. In this paper, the interrelations of the intersection and the union of tables with other signature operations of table algebras: difference, selection, projection, saturation, active complement, join, renaming of attributes are considered.


1991 ◽  
Vol 14 (1) ◽  
pp. 79-95 ◽  
Author(s):  
Yuan‐Der Liu ◽  
Keh‐Yih Su

Sign in / Sign up

Export Citation Format

Share Document