%0 Journal Article
%T An Improved Optimizing Method for Multi-join Queries<br>一种改进的多连接查询优化方法
%A ZHONG Wu
%A HU Shou-ren
%A <br>钟　武
%A 胡守仁
%J 软件学报
%D 1998
%I 
%X M. S. Chen has put forward heuristics GMC and GMR, which are used to produce a join bushy tree with less total cost. On the basis of his work, the paper gives an improved algorithm with complexity of O(n2), by means of analysing relationship between the order of join operations and computing costs. The algorithm can reduce more total cost of a join bushy tree than GMC and GMR, which benefits from the following: the operation order of two arbitrary adjacent internal nodes (join operations) is optimum.
%K Relational database
%K multi-join queries
%K query optimization
%K parallel execution
%K executinon dependency<br>关系数据库
%K 多元连接查询
%K 查询优化
%K 并行执行
%K 执行依赖.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=1DF974B554D9C6BC&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=0B39A22176CE99FB&sid=F122871CC7EC92DC&eid=1F199509C0B6C4D6&journal_id=1000-9825&journal_name=软件学报&referenced_num=7&reference_num=6