期刊文献+

O(N)时空复杂度排序器的设计

Design of a Sorting Unit with Space-time Complexity O(N)
下载PDF
导出
摘要 用特别设计的自动检索电路与一般存储器一起构成一个独立的硬件排序单元.其时间、空间复杂度均是O(N).它既可以作为主CPU的协处理器。 An independent hardware sorting unit is formed with a specially designed automatic re-trieval circuit and a few general-purpose memories. Each byte of the is written suc-cessively in the sorting unit with the corresponding mark bits. The bytes are then read outfrom the priority encoder circuit so that the sorting for tuples will be completed from thelowest to the highest byte of the
出处 《华中理工大学学报》 CSCD 北大核心 1994年第6期119-123,共5页 Journal of Huazhong University of Science and Technology
基金 国家自然科学基金 湖北省自然科学基金
关键词 排序器 时空复杂度 数据库机 in turn. If the number of tuples to be sorted is nand that of bytes of the Keywords for each tuple is m,then the sorting time complexity willbe 2nm or 2N(N=nm),or O(N).The main hardware of the sorting unit is the general-pur-pose RAMs, in which there are
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部