New linear node splitting algorithm for R-trees-Reference-Cited by-同舟云学术

New linear node splitting algorithm for R-trees

Published:1997 Issue: Volume: Page:337-349
ISSN:0302-9743
Container-title:Advances in Spatial Databases
language:
Short-container-title:

Author:

Ang C. H.,Tan T. C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63238-7_38.pdf

Reference8 articles.

1. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger: The R *-tree: An efficient and robust access method for points and rectangles. Proc. of the SIGMOD Conference, Atlantic City, NJ. (May 1990) 322–331

2. D. Greene: An implementation and performance analysis of spatial data access methods. Proc. of the 5th International Conference on Data Engineering. (1989) 606–615

3. Antonin Guttman: R-tree: A Dynamic Index Structure for Spatial Searching. Proc. of the SIGMOD Conference, Boston. (June 1984) 47–57

4. Ibrahim Kamel and Christos Faloutsos: Hilbert R-tree: An improved R-tree Using Fractals. Proc. of the 20th VLDB Conference, Santiago, Chile. (May 1994) 500–508

5. Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1989)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficiently identifying closed roads by integrating and indexing open data;Journal of the Chinese Institute of Engineers;2021-06-17

2. Multi-Dimensional Indexes in DBMSs;Journal of Cases on Information Technology;2019-07

3. 3D Crisp Clustering of Geo-Urban Data;Encyclopedia of GIS;2017

4. R-Trees: A Dynamic Index Structure for Spatial Searching;Encyclopedia of GIS;2017

5. 3D Crisp Clustering of Geo-Urban Data;Encyclopedia of GIS;2015