An Improved Optimizing Method for Multi-join Queries
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

钟 武,胡守仁.一种改进的多连接查询优化方法.软件学报,1998,9(2):125-128

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 09,1996
  • Revised:March 03,1997
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063