计算机科学 ›› 2015, Vol. 42 ›› Issue (1): 206-209.doi: 10.11896/j.issn.1002-137X.2015.01.046

• 软件与数据库技术 • 上一篇    下一篇

M-相点数据索引SPindex

陈瑛,陈钊滢,叶小平   

  1. 广州商学院计算机系 广州511363,华南师范大学计算机学院 广州510631,华南师范大学计算机学院 广州510631
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(60673135,60373081),国家自然科学基金重点项目(60736020),广东自然科学基金(9151027501000054,s2011010003409)资助

SPindex:Spatial Index Based on M-phase Points

CHEN Ying, CHEN Zhao-ying and YE Xiao-ping   

  • Online:2018-11-14 Published:2018-11-14

摘要: 空间数据索引是空间数据管理的关键技术,其性能决定空间数据库的使用效率。由于可将时间维度转化为空间维度处理,空间数据索引在时空数据库和移动对象数据库管理方面有广泛的应用。因此研究空间数据索引具有理论意义和应用价值。现有空间索引多是基于R-树技术,为快速有效地访问海量空间数据,提出一种基于空间相点分析的空间数据索引方法SPindex。首先,将空间区域所对应的最小外接矩形(MBR)集合与相平面中相点集合建立对应;其次,通过相点关系对相应MBR进行相互位置分析,进而提出一种基于相点的空间数据结构MROB;以此为基础,提出一种新的基于M-相点分析的空间数据索引SPindex;最后,通过与常规索引进行实验,评估表明了该工作的可行性与有效性。

关键词: 相平面与M-相点,MROB数据结构,SPindex,仿真评估

Abstract: Spatial data indexing plays a critical role in spatial data management,and its performance determines the efficiency of spatial database directly.By transforming spatial-temporal issues into pure spatial ones,spatial index can be widely used in spatial-temporal and moving object databases.Therefore it is meaningful and necessary to study the spatial data index.Most of the current spatial indexes are based on R-tree,however,in order to access massive spatial data quickly and efficiently,this paper proposed a novel spatial index SPindex based on the analysis of phrase-points.Firstly,we built a congruent relationship between the MBRs of spatial regions and phase points in phase plane.Secondly,though analyzing the positions of MBRs by the characteristics of the corresponding phase points,we proposed spatial data structure about phase points named MROB.Then a new spatial data indexing SPindex based on analysis of M-phase points was put forward.Finally,we designed experiments to test the performance of SPindex and results show that SPindex is feasible and efficient.

Key words: Phase plane and M-phase points,Data structure of MROB,SPindex,Simulation and evaluation

[1] 郭薇,郭菁,胡志勇.空间数据库索引技术[M].上海:上海交通大学出版社,2006
[2] Bentley J L.Multidimensional Binary Search Trees used for Associative searching[J].Communication of the ACM,1975,18(9):509-517
[3] Bentley J L.Multidimensional Binary Search Trees in Database Application[J].IEEE Transactions on Software Engineering,1979,5(4):333-340
[4] Robinson J T.The K-D-B-tree:a search structure for large multidimensional dynamic indexes[C]∥Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data.New York:ACM,1981:10-18
[5] Lomet D D B,Salzberg B.The HB-Tree:A Multiattribute Indexing Method with Good Guaranteed Performance[J].ACM Trans Database Syst,1990,15(4):625-658
[6] Samet H.The Quadtree and Related Hierarchical Data Struc-tures[J].ACM Comput Surv,1984,16(2):187-260
[7] Guttman A I.R - Trees:A Dynamic Index Structure for Spatial Searching[C]∥SIGMOD Conference.1984:47-57
[8] 叶小平,郭欢,汤庸,等.基于相点分析的移动数据索引技术[J].计算机学报,2011,34(2):256-274
[9] 叶小平,陈瑞鑫,周旋珍,等.移动对象索引ST-tree[J].华南师范大学学报:自然科学版,2014,46(3):44-48
[10] 叶小平,汤庸,林衍崇,等.时态拟序数据结构研究及应用[J].软件学报,2014,25(11):2587-2601

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!