A Novel Spatial Index with a Hi gh－performance Spatial Join
-
摘要: 空间索引会极大地影响空间连接操作的效率 提出了一种基于双映射变换的分布式空间索引通过结合平面角变换和空间填充曲线的优点对二维空间进行两次维度变换使空间数据分片建立在一维的顺序存储队列基础上 在此基础上提出了一种空间拓扑连接算法并进行了算法的四叉树优化和处理效率实验对比了本文存储方法和传统R－tree存储在时效性和冗余度方面的效率 实验结果表明本文方法能支持高效的空间连接Abstract: Spatial indexing seriousl y impacts the efficienc y of spatial processing．In this papera new spatial index based on double transformation DT－indexis proposed．As a dimensional transformation the DT－index benefits from both hi gh and low dimensional mapping．The spatial objects are partitioned in se quential queuemore efficient than area partitioning．A spatial join al gorithm based on the DT－index is introduced and optimized with a quad－tree．The experimental results reveal that the proposed method improves the performance of spatial join processing in terms of redundanc y and speedup ratio through a comparison with the widel y－used R－tree method．
-
Keywords:
- DT－index /
- spatial index /
- spatial join /
- quad－tree optimization
-
计量
- 文章访问数: 900
- HTML全文浏览量: 39
- PDF下载量: 464
下载:
