%0 Journal Article
%T AN ALGORITHIM FOR SOLVING MINIMAL COVERS OF QUERY LOSSLESS JOIN ON DATABASE<br>数据库查询无损联结的求解算法及应用
%A Wang Lancheng
%A <br>王兰成
%J 现代图书情报技术
%D 1995
%I 
%X 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.
%K 数据库
%K 查询无损联结
%K 算法
%K 检验
%K 关系数据库
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=B5EDD921F3D863E289B22F36E70174A7007B5F5E43D63598017D41BB67247657&cid=E46382710BF131B2&jid=24AADBCD0D5373C73F37F78D10E2F717&aid=9B5B6C76A4EFDE3CF32820A08A7ACF00&yid=BBCD5003575B2B5F&vid=708DD6B15D2464E8&iid=B31275AF3241DB2D&sid=A04140E723CB732E&eid=EA389574707BDED3&journal_id=1003-3513&journal_name=现代图书情报技术&referenced_num=0&reference_num=0