中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
An efficient multiway merging algorithm

文献类型:期刊论文

作者Zhao, LJ; Liu, ZY; Gao, QS
刊名SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES
出版日期1998-10-01
卷号41期号:5页码:543-551
关键词algorithm sorting merging parallel processing
ISSN号1006-9321
英文摘要Most traditional merging algorithms and merging-based sorting algorithms are based on 2-sorters. A new k-way merging algorithm is proposed. The aim of this algorithm is to merge k sorted lists, with m keys of each, into one, where k can be any integer. The merging process uses only k sorters instead of 2 sorters. Thus, K-sorters is the primary operation of our algorithm. The time needed to merge k sorted lists is (21 + ([log (m/k)])t(k), where t(k) is the time to sort k keys.
WOS研究方向Engineering ; Materials Science
语种英语
WOS记录号WOS:000076531900013
出版者SCIENCE PRESS
源URL[http://119.78.100.204/handle/2XEOYT63/13267]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhao, LJ
作者单位1.Chinese Acad Sci, Inst Comp Technol, Beijing 100080, Peoples R China
2.Univ Sci & Technol Beijing, Dept Comp Sci, Beijing 100083, Peoples R China
推荐引用方式
GB/T 7714
Zhao, LJ,Liu, ZY,Gao, QS. An efficient multiway merging algorithm[J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES,1998,41(5):543-551.
APA Zhao, LJ,Liu, ZY,&Gao, QS.(1998).An efficient multiway merging algorithm.SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES,41(5),543-551.
MLA Zhao, LJ,et al."An efficient multiway merging algorithm".SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES 41.5(1998):543-551.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。