Skip to main content
SpringerLink
Log in

2-level r-tree index based on spatial grids and Hilbert R-tree

  • Published:
Geo-spatial Information Science

Abstract

Multi-level spatial index techniques are always used in large spatial databases. After a general survey of R-tree relevant techniques, this paper presents a novel 2-level index structure, which is based on the schemas of spatial grids, Hilbert R-tree and common R-tree. This structure is named H2R-tree, and it is specifically suitable for the indexing highly skewed, distributed, and large spatial database. Algorithms and a sample are given subsequently.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Guttman A (1984) R-trees: a dynamic index structure for spatial searching[C]. ACM SIGMOD conference, Boston, USA

  2. Sellis T, Roussopoulos N, Faloutsos C (1987) R+-tree: a dynamic index for multi-dimensional objects [C]. The 13th VLDB Conference, Athens, Greece

  3. Beckmann N, Kriegel H P, Schneider R, et al. (1990) The R+-tree: an efficient and robust access method for points and rectangles[C]. The ACM SIGMOD Conference, Atlantic City, USA

  4. Kamel I, Faloutsos C (1994) Hilbert R-tree: an improved R-tree using fractals[C]. The 20th VLDB Conference, Santiago. USA

  5. Roussopoulos N, Leifker D (1985) Direct spatial search on pictorial databases using packed R-trees [C]. ACM SIGMOD Conference, Austin, USA

  6. Kamel I, Faloutsos C (1993) On packing R-trees [C]. The 2nd CIKM Conferene, Washington DC, USA

  7. Leutenegger S, Edgington J M, Lopez M A (1997) STR: a simple and efficient algorithm for R-tree packing[C]. The 13th IEEE ICDE Conference, Birmingham, England

  8. Chen Li, Choubey R, Rundensteier E (1998) Bulkinsertions into R-trees using the small-tree-large-tree approach[C]. The 6th ACM GIS Conference, Washington DC, USA

  9. Choubey R, Chen Li, Rundensteiner E (1999) GBI-a generalized R-tree bulk-insertion strategy[C]. The 6th SSD Conference, Hong Kong, China

  10. Guo Jing, Guo Wei, Hu Zhiyong (2003) QR-tree: an efficient spatial index structure of GIS with very large spatial database[J].Geomatics and Information Science of Wuhan University, 28(3): 306–310 (in Chinese)

    Google Scholar 

  11. Faloutsos C, Roseman S (1989) Fractals for secondary key retrieval[C]. The 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, USA

  12. Arge L, Hinrichs K H, Vahrenhold J, et al. (2002) Efficient bulk operations on dynamic R-trees [J].Algorithmica, 33 (1): 104–128

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing Institute of Command and Technology of Equipment, 1 Jingjia Road, Huairou District, 101416, Beijing, China

    Guo Jing

Authors
  1. Guo Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liu Guangjun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong Xurong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guo Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Jing, G., Guangjun, L., Xurong, D. et al. 2-level r-tree index based on spatial grids and Hilbert R-tree. Geo-spat. Inf. Sci. 9, 135–141 (2006). https://doi.org/10.1007/BF02826939

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02826939

Key words

CLC Number

Search

Navigation