Skip to main content
SpringerLink
Log in

QR*-Tree: A New Hybird Spatial Database Index Structure

  • Chapter
  • First Online:
Recent Advances in Computer Science and Information Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 126))

Abstract

With the development of spatial information technology, it becomes more and more important to organize and use spatial data. However traditional database index structure in the organization and management of spatial data appeared to be inadequate. This paper presents a new hybrid spatial database index structure, QR*-tree, which is better performance to R*-tree in insertion, deletion, particularly in searching.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Conf. on Management of Data, pp. 47–57 (1984)

    Google Scholar 

  2. Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-tree: a dynamic index for multi-dimensional objects. In: Proc. 13th Intl. Conf. on Very Large Data Bases (VLDB), pp. 507–518 (1987)

    Google Scholar 

  3. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD Conf. on Management of Data, pp. 322–331 (1990)

    Google Scholar 

  4. Samet, H.: The design and analysis of spatial data structures. Addison Wesley (1989)

    Google Scholar 

  5. Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: an index structure for high-dimensional data. In: Proc. 22nd Intl. Conf. on Very Large Data Bases (VLDB), pp. 28–39 (1996)

    Google Scholar 

  6. Katayama, N., Satoh, S.: The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proc. ACM SIGMOD Conf. on Management of Data, pp. 369–380 (1997)

    Google Scholar 

  7. Qiu, J.-H., Tang, X.-B., Huang, H.-G.: An Index Structure Based Quad-tree and R*-tree—QR*-tree. Computer Application, 124–126 (2003) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Technology, DaLian Neusoft Institute of Information, Dalian, China

    Jianhua Qiu, Quan Guo & Yaohua Xiong

Authors
  1. Jianhua Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yaohua Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianhua Qiu .

Editor information

Editors and Affiliations

  1. , College of Communication Engineering, Jilin University, Room 313, Building No.1, Changchun, Nanhu Avenue 5372, Jilin, 130012, China, People's Republic

    Zhihong Qian

  2. , Department of Electrical Engineering, The University of Mississippi, Anderson Hall 314, Mississippi, 38677, Mississippi, USA

    Lei Cao

  3. , Department of Electrical and Computer En, Naval Postgraduate School, Rm. 452 Spanagel Bldg. 232, Dyer Road 833, Monterey, 93943-5121, California, USA

    Weilian Su

  4. , Faculty of Computing, London Metropolitan University, Holloway Road 166-220, London, N7 8DB, United Kingdom

    Tingkai Wang

  5. , College of Software, Changchun University of Science and Tech, Changchun, Jilin, 130022, China, People's Republic

    Huamin Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Qiu, J., Guo, Q., Xiong, Y. (2012). QR*-Tree: A New Hybird Spatial Database Index Structure. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25766-7_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25766-7_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25765-0

  • Online ISBN: 978-3-642-25766-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation