关键词: 移动对象索引, BX树, Hilbert曲线, 秩

Abstract: A SelfAdaptive BX-tree (SABX) was presented for indexing the current and future position of moving objects. Taking account of the different density of moving objects in reality, SABX-tree utilized the technology of temporal partitioning and spacefilling curves to calculate the objects’ position, then a supplemented Hash index was introduced to store and index the forest of BX-trees. Besides, the insertion，deletion, update methods and range query algorithm were developed for SABX-tree. Experimental results show that SABX-tree’s dynamic update and query performances outperform those of BX-tree and traditional TPRtree.

Key words: moving objects Index, BX-tree, Hilbert curve, order