DocumentCode
2614586
Title
Implicit joins in the structural data model
Author
Lee, Byung Suk ; Litwin, Witold ; Wiederhold, Gio
Author_Institution
Bellcore, Redbank, NJ, USA
fYear
1991
fDate
11-13 Sep 1991
Firstpage
357
Lastpage
364
Abstract
In general, writing a relational query involving many join predicates is cumbersome and prone to errors. One approach to resolving this problem is the implicit join method. This method derives the unspecified join predicates of an incompletely specified query from the semantic dependency-a set of the pairs of semantically dependent attributes-in the database schema. Although the implicit join method has some advantages over the universal relation approach, it frequently derives a complete query differently from what a user would do, and generates redundant subqueries. It is shown that using the structural model removes the problem of redundancy by making the semantic observation of the database schema possible, and provides a complete query that many users would prefer to that of the original implicit join method
Keywords
data structures; query languages; relational databases; database schema; implicit join method; join predicates; redundant subqueries; relational query; semantically dependent attributes; structural data model; Calculus; Data models; Electrostatic discharge; Natural languages; Navigation; Redundancy; Relational databases; Tree graphs; User interfaces; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International
Conference_Location
Tokyo
Print_ISBN
0-8186-2152-4
Type
conf
DOI
10.1109/CMPSAC.1991.170203
Filename
170203
Link To Document