摘要
对时空索引的技术要求进行了说明 ,分析了目前的时空索引方法及其局限性 ,提出了基于最小限定盒的时空索引结构———STB树 ,并对其运算算法进行了描述。
Real_world objects are inherently spatially and temporally referenced.As a result,indices that efficiently support queries on the spatio_temporal extents of objects are needed.In contrast,the past indexing researches have made progress in largely separate spatial and temporal streams.This paper is focused on deriving efficient access methods for spatio_temporal objects in GIS.In this paper we extend the well_known R_tree method to handle spatio_temporal object.The resulting access method,termed (spatio_temporal box)STB_tree,differs from the R_tree in that it stores additional information in the entries.The structure and the algorithm of STB_tree are proposed in detail.
出处
《武汉大学学报(信息科学版)》
EI
CSCD
北大核心
2003年第1期51-54,共4页
Geomatics and Information Science of Wuhan University