一种以空间换时间的快速查找算法的设计与应用  

The Design and Application of Search Algorithms Based on Trading Space for Time

作　　者：王力军[1,2] 何友全[1] 

机构地区：[1]重庆交通大学,重庆400074 [2]重庆华恒电子有限公司,重庆400060

出　　处：《重庆科技学院学报（自然科学版）》2009年第3期132-134,共3页Journal of Chongqing University of Science and Technology：Natural Sciences Edition

基　　金：重庆市教委基金项目(0634167)

摘　　要：针对数据结构中三种静态查找算法使用条件或效率的限制,结合项目中遇到的具体问题,提出了一种以空间换时间的替代算法。解决了查找耗时的效率难题,满足了交互软件需快速响应的要求。阐述了该算法的设计原理和应用背景。从时间和空间的角度比较了该算法与其他算法的优缺点,得出该算法更适合解决本文的问题。In light of the restrictions of working conditions and efficiency in the data structure about three static search algorithms below, the article proposes the search algorithms of space for time, which is also with the specific issue encountered in the project. It solves the time-consuming search problem, and also satisfies the requirement that interactive software need quickly respond to. Simultaneously, this article elaborates on the principle of algorithm design and the application background. Compared with advantages and disadvantages of the algorithm and others from the time and space, the conclusion is that the algorithm is better suited to resolve the issue.

关 键 词：算法 呼叫跟踪 信令 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]