Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (7): 89-93.

Previous Articles     Next Articles

Research on cache replacement strategy for space vector data of multi-layer

WU Jiagao1, ZHANG Xi1, ZHUANG Songjie1, ZOU Zhiqiang1, HU Bin2   

  1. 1.Institute of Computer Technology, College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
    2.Key Laboratory of Virtual Geographic Environment, MOE, Nanjing Normal University, Nanjing 210046, China
  • Online:2014-04-01 Published:2014-04-25

面向多图层的空间矢量数据缓存更新策略研究

吴家皋1,张  曦1,庄嵩杰1,邹志强1,胡  斌2   

  1. 1.南京邮电大学 计算机学院 计算机技术研究所,南京 210003
    2.南京师范大学 虚拟地理环境教育部重点实验室,南京 210046

Abstract: In order to promote the performance of P2P spatial indexing network on vector data,a caching mechanism is introduced into the existing hybrid P2P spatial indexing network.And a novel cache replacement strategy for space vector data of multi-layer is proposed.In allusion to the multi-layer characteristics of the spatial vector data,the layer priority and query frequency are considered,which make full use of the cache space.Furthermore,the cache replacement is abstracted as a mathematical model of the 0/1 knapsack problem and solved by genetic algorithms.The simulation experiments indicate that this strategy can increase the caching hit ratio and improve the indexing efficiency effectively.

Key words: indexing network, cache replacement, multi-layer, 0/1 knapsack problem, genetic algorithms

摘要: 为提高P2P空间矢量数据索引网络的性能,在已有混合结构P2P空间索引网络的基础上,引入缓存机制,并提出了一种新的面向多图层的空间矢量数据缓存更新策略。该策略针对空间矢量数据多图层特性,综合考虑图层优先级以及查询频率对于缓存更新的影响,合理地利用了缓存空间。同时,将缓存更新抽象成0/1背包问题的数学模型,采用遗传算法对其优化求解。仿真结果表明该缓存更新策略可以增加缓存命中率,提高空间索引效率。

关键词: 索引网络, 缓存更新, 多图层, 0/1背包问题, 遗传算法