Please wait a minute...
New Technology of Library and Information Service  1995, Vol. 11 Issue (6): 20-23    DOI: 10.11925/infotech.1003-3513.1995.06.04
article Current Issue | Archive | Adv Search |
AN ALGORITHIM FOR SOLVING MINIMAL COVERS OF QUERY LOSSLESS JOIN ON DATABASE
Wang Lancheng
(Airforce Political Univ ersity, Shanghai)
Download:
Export: BibTeX | EndNote (RIS)      
Abstract  

The question of solving minimal covers of query lossless join about any normal form has been researched. The algorithims of the verify of query lossless join, the solution of minimal covers of query lossless join based on divided relations and the algorithim of the verify,have been introduced and confirmed.

Received: 17 April 1995      Published: 25 December 1995
Corresponding Authors: Wang Lancheng   
About author:: Wang Lancheng

Cite this article:

Wang Lancheng. AN ALGORITHIM FOR SOLVING MINIMAL COVERS OF QUERY LOSSLESS JOIN ON DATABASE. New Technology of Library and Information Service, 1995, 11(6): 20-23.

URL:

https://manu44.magtech.com.cn/Jwk_infotech_wk3/EN/10.11925/infotech.1003-3513.1995.06.04     OR     https://manu44.magtech.com.cn/Jwk_infotech_wk3/EN/Y1995/V11/I6/20

1 Aho A.V.,Beeri C.Ullman J.D.The theory of joins in relational databases,ACM Trans.on DBS,1979.4(3).297-314
2 Kambayashi Y.An efficientalgorithm for processing multirelation querise in relational databases,ER78:01,Kyoto Univ.,japan,1978
3 Ullman J.D.Principle of database Systems,Computer science press,1980
4 Schenk K.L.Ullman J.D.Pinkert J.R.An algorithm for servicing multirelational queries,ACM SIGMOD,Inter.Symp.on Management of Data,1977,10-19

No related articles found!
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938   E-mail:jishu@mail.las.ac.cn