A new variation of R-tree for indexing spatial data in GIS

被引：0

作者：

Chen, YK ^{[1
]}

Zhou, XT ^{[1
]}

Shi, TL ^{[1
]}

Feng, XM ^{[1
]}

机构：

[1] Chinese Acad Sci, Grad Sch, Coll Earh Sci, Beijing, Peoples R China

来源：

IGARSS 2004: IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM PROCEEDINGS, VOLS 1-7: SCIENCE FOR SOCIETY: EXPLORING AND MANAGING A CHANGING PLANET | 2004年

关键词：

R tree; mininum bound rectangle; relationship of containment; spatial query;

D O I：

暂无

中图分类号：

P [天文学、地球科学];

学科分类号：

07 ;

摘要：

R-tree, a dynamic indexing structure constructed with enclosing rectangle of spatial objects, is one of the most popular methods for accessing spatial database. The difference of those existing methods of R-tree mainly focuses on selecting the optimization criteria in building a tree. These existing methods are suitable for spatial objects that their enclosing rectangles are apart or overlapped with each other in space. However, in real world there is another fact that sometimes the enclosing rectangle of a spatial object will contain another's. In such case, a new data structure is created. And algorithms for inserting, splitting and adjusting are described in detail. Finally a test for this new algorithm is implemented as well.

引用

页码：2882 / 2885

页数：4

共 50 条

[21] 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
[22] The sort/sweep algorithm: A new method for R-tree based spatial joins
Gurret, C
Rigaux, P
12TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2000, : 153 - 165
[23] A New R-tree Spatial Index Based on Space Grid Coordinate Division
Li, Guobin
Tang, Jine
2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL I, 2010, : 736 - 739
[24] Indexing the current positions of moving objects using the lazy update R-tree
Kwon, D
Lee, S
Lee, S
MDM 2002: THIRD INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, PROCEEDINGS, 2002, : 113 - 120
[25] Comparative analysis of the efficiency of R-tree based indexing strategies for information retrieval
Wu, L
Bretschneider, T
IKE '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE ENGNINEERING, 2004, : 180 - 184
[26] An extended R-Tree indexing method using selective prefetching in main memory
Kang, Hong-Koo
Kim, Joung-Joon
Kim, Dong-Oh
Han, Ki-Joon
COMPUTATIONAL SCIENCE - ICCS 2007, PT 1, PROCEEDINGS, 2007, 4487 : 692 - +
[27] 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
[28] A brand-new node-choosing algorithm in R-tree spatial index
Gong, Jun
Ke, Shengnan
Bao, Shuming
GEOINFORMATICS 2007: GEOSPATIAL INFORMATION SCIENCE, PTS 1 AND 2, 2007, 6753
[29] 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 - +
[30] Boundary-based time partitioning with flattened R-tree for indexing ubiquitous objects
Jung, YC
Youn, HY
Lee, ES
MOBILE AD-HOC AND SENSOR NETWORKS, PROCEEDINGS, 2005, 3794 : 804 - 814

← 1 2 3 4 5 →