关键词: 数据分发管理, 区域匹配, 区间树

Abstract: Data Distributed Management（DDM） is the effective method to reduce network redundant data, region matching algorithm is the key of data distributed management. The current variety of matching algorithms such as direct matching method, the grid method, sorting method are insufficient ideal because of the poor filtration or long time-consuming. Through the fully research of data filtering mechanism, the region matching algorithm based on interval-tree—ITBM is proposed, which is mapped range to an interval, uses the interval trees to  store the area range, through the direct operation of interval-tree to complete matching work. The results show that ITBM can greatly reduce the time of matching calculations, effectively save the cost of matching process of dynamic DDM.

Key words: data distributed management, region matching, interval-tree