摘要
在移动计算中,减少移动客户端的平均访问时间是一个重要的研究方向。为减少移动客户端的平均访问时间,在Huffman树索引技术的基础上提出深度优先的数据组织方式。在平均访问时间、调谐时间以及额外开销方面对常用的广度优先策略与深度优先策略进行分析与比较,表明深度优先策略的数据组织方式能进一步提高移动数据广播的性能。
Average access time reducing is an important issue in mobile environment. In order to reduce the average access time, in this paper, we propose Breadth- First- Search data organization based on Huffman index technique. At the same time, we evaluate the Breadth- First- Search data organization with the Depth- First- Search data organization in average access time, tuning time and additional space. Result shows the Depth - First - Search data organization better performance than the Breadth - First - Search data organization.
出处
《计算技术与自动化》
2008年第4期128-131,共4页
Computing Technology and Automation
关键词
移动计算
索引
存取时间
广度优先
深度优先
mobile computing
index
access time
Breadth - First - Search
Depth- First- Search
