基于分布式内存数据库的移动对象全时态索引  

Full-temporal Index of Moving Objects Based on Distributed Main Memory Database

作　　者：周翔宇[1] 程春玲[1] 杨雁莹[2] 

机构地区：[1]南京邮电大学计算机学院,南京210003 [2]南京森林警察学院信息技术系,南京210023

出　　处：《计算机科学》2016年第7期203-207,216,共6页Computer Science

基　　金：中央高校基本科研业务费专项资金项目(LGZD201502);国家自然科学基金(61373139;61403208)资助

摘　　要：针对现有移动索引仅对内存/磁盘两层结构进行优化,忽略了索引节点在内存中的缓存敏感性,提出一种基于分布式内存数据库的全时态索引结构DFTB^x树。该索引结构针对存储器Cache、内存和磁盘3层结构进行优化,根据Cache行、指令数量和TLB失配数等多个条件设计内存索引节点的大小。同时,根据磁盘数据页的大小设计历史数据迁移链节点的大小,使得Cache和内存能够一次读取索引节点和迁移链节点数据,避免多次读取数据带来的延迟。此外,构建历史数据迁移链,实现历史数据持久化,从而支持移动对象全时态索引。实验结果表明:与Bx树、Bdual树、TPR*树和STRIPES算法相比,DFTBx树具有较高的查询和更新效率。Due to the traditional index of moving objects ignores the cache-conscious of index nodes,only the two-layer memory/disk hierarchy is optimized. Thus, this paper proposed a novel full-temporal index structure named DFTBX-tree based on the distributed main memory database. The optimization of new index structure includes the Cache, the main memory and the hard disk. The size of index nodes is set according to many conditions such as Cache line, the number of instructions and the number of TLB mismatches. Meanwhile, the size of historical data migration nodes is designed a ccording to the size of the disk data pages. Therefore, the cache and the main memory can read the data of interior node or leaf node at a time, to avoid the delay caused by multiple data reads. Moreover, the full-temporal index of mo- ving objects is supported by historical data which is linked through a migration chain. Compared with other algorithms, the experiment shows that DFTBX-tree has higher efficiency in query and update operations.

关 键 词：分布式内存数据库 移动对象 全时态索引 三层结构 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]