移动对象索引ST-tree  

ST-tree: An Index for Moving Objects

作　　者：叶小平[1] 陈瑞鑫[1] 周旋珍 陈鹏[1] 

机构地区：[1]华南师范大学计算机学院,广州510631

出　　处：《华南师范大学学报（自然科学版）》2014年第3期44-48,共5页Journal of South China Normal University(Natural Science Edition)

基　　金：国家自然科学基金项目(60970044;61272067);广东省自然科学基金项目(91510275010000054;s2011010003409)

摘　　要：研究了一种基于时空"对称"和"统一"处理的索引模式ST-tree.首先,根据路网移动对象特征,以空间间隔和时间期间组成的时空矩形为技术处理单元,讨论了一般区间元素集合上基于下右优先遍历序列的结构关系;其次,将时空矩形数据集合映射为空间间隔集合和时间期间集合,应用区间结构关系建立了路网移动对象数据集合数据结构;另外,由此研究了基于历史信息的移动对象索引ST-tree,它具有"一次一集合"的数据操作模式;最后,采用常规用例数据设计了基本仿真,通过与现有基本工作比较评估表明了ST-tree的可行性与有效性.A novel index method which deals with the factors of“time”and“space”equally and uniformly is proposed. Firstly,it regards the temporal-spatial rectangle as the basic technical unit which consists of spatial interval and temporal period and studies the structural relationship for the set composed of the interval elements. Secondly,it maps the set of spatial-temporal rectangle into the sets of intervals and periods respectively and the data structure on them are constructed by the down-right first traversing. Thirdly,it puts forward the index schema,denoted as ST-tree,to deal with the historical information of moving objects data and completes querying with the module of“one time,one set”. In addition,simulations are carried out which compare ST-tree with some corresponding existing works and results indicate the feasibility and efficiency of ST-index.

关 键 词：区间集合数据结构 下右优先遍历 移动对象数据索引 数据查询模式 

分 类 号：TP311.132[自动化与计算机技术—计算机软件与理论]