Providing R-Tree Support for MongoDB

被引:3
|
作者
Xiang, Longgang [1 ]
Shao, Xiaotian
Wang, Dehao
机构
[1] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
来源
XXIII ISPRS Congress, Commission IV | 2016年 / 41卷 / B4期
关键词
R-tree; Spatial index; MongoDB;
D O I
10.5194/isprsarchives-XLI-B4-545-2016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Supporting large amounts of spatial data is a significant characteristic of modern databases. However, unlike some mature relational databases, such as Oracle and PostgreSQL, most of current burgeoning NoSQL databases are not well designed for storing geospatial data, which is becoming increasingly important in various fields. In this paper, we propose a novel method to provide R-tree index, as well as corresponding spatial range query and nearest neighbour query functions, for MongoDB, one of the most prevalent NoSQL databases. First, after in-depth analysis of MongoDB's features, we devise an efficient tabular document structure which flattens R-tree index into MongoDB collections. Further, relevant mechanisms of R-tree operations are issued, and then we discuss in detail how to integrate R-tree into MongoDB. Finally, we present the experimental results which show that our proposed method out-performs the built-in spatial index of MongoDB. Our research will greatly facilitate big data management issues with MongoDB in a variety of geospatial information applications.
引用
收藏
页码:545 / 549
页数:5
相关论文
共 50 条
  • [21] Constructing the compact heart of an R-tree using a tree substitution
    Jullian, Yann
    ANNALES DE L INSTITUT FOURIER, 2011, 61 (03) : 851 - 904
  • [22] A design of parallel R-tree on cluster of workstations
    Lai, SH
    Zhu, FH
    Sun, YQ
    DATABASES IN NETWORKED INFORMATION SYSTEMS, PROCEEDINGS, 2001, 1966 : 119 - 133
  • [23] Enhanced Nearest Neighbour Search on the R-tree
    Cheung, King Lum
    Fu, Ada Wai-Chee
    SIGMOD Record (ACM Special Interest Group on Management of Data), 1998, 27 (03): : 16 - 21
  • [24] Cost model of R-tree and algorithmic optimization
    Chen, Haibo
    Wang, Shenkang
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2003, 15 (03): : 277 - 282
  • [25] A new enhancement to the R-tree node splitting
    Al-Badarneh, Amer F.
    Yaseen, Qussai
    Hmeidi, Ismail
    JOURNAL OF INFORMATION SCIENCE, 2010, 36 (01) : 3 - 18
  • [26] Branch grafting method for R-tree implementation
    Schreck, T
    Chen, Z
    JOURNAL OF SYSTEMS AND SOFTWARE, 2000, 53 (01) : 83 - 93
  • [27] The RD-tree -: Allowing data in interior nodes of the R-tree
    Nakorn, Tanin Na
    Chongstitvatana, Jarucj
    2006 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2006, : 378 - +
  • [28] Accelerating Spatial Join Aggregation with R-tree for MapReduce
    Yao, Chuang
    Chen, Luo
    Wu, Ye
    Shen, Jinxin
    2016 2ND INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS - COMPUTING TECHNOLOGY, INTELLIGENT TECHNOLOGY, INDUSTRIAL INFORMATION INTEGRATION (ICIICII), 2016, : 1 - 5
  • [29] A negative selection algorithm base on the self R-tree
    Wang, Kunpeng
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4, 2013, 411-414 : 2007 - 2012
  • [30] Perfect Hashing Base R-tree for Multiple Queries
    Patel, Parth
    Garg, Deepak
    SOUVENIR OF THE 2014 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2014, : 636 - 640