Skip to main content
SpringerLink
Log in

Hierarchical Data Structures for Accessing Spatial Data

  • Conference paper
Signal Processing and Multimedia (MulGraB 2010, SIP 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 123))

  • 1049 Accesses

Abstract

Spatial data is data related to space .In various application fields like GIS, multimedia information systems, etc., there is a need to store and manage these data. Some data structures used for the spatial access methods are R tree and its extensions where objects could be approximated by their minimum bounding rectangles and Quad tree based structures where space is subdivided according to certain rules. Also another structure KD Tree is used for organizing points in a k dimensional space. In this paper we have described an algorithm for insertion of points in a Quad tree based structure, known as PR Quad Tree. Another data structure called K-D Tree is also described and the insertion procedure is defined. Then the comparison between the two structures is drawn.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Bentley, J.L.: Multidimensional binary search trees used for associated searching. Comm. Of the ACM 18, 509–517 (1975)

    Article  MATH  Google Scholar 

  2. Moore, A.W.: An introductory tutorial on KD trees. Technical Report No. 209, Computer Laboratory, University of Cambridge (1991)

    Google Scholar 

  3. Overmars, M.H., van Leeuwen, J.: Dynamic Multi-Dimensional data structures based on Quad and KD tress. Acta Informatica 17, 267–285 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Güting, R.H.: An Introduction to Spatial Database Systems. The VLDB Journal — The International Journal on Very Large Data Bases 3(4), 357–399 (1994)

    Article  Google Scholar 

  5. Samet, H.: The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys (CSUR) 16(2), 187–260 (1984)

    Article  MathSciNet  Google Scholar 

  6. Guttman: R-Trees: A Dynamic index structure for spatial searching. In: Proceedings ACM SIGMOD, pp. 47–57 (1984)

    Google Scholar 

  7. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R* Tree-An efficient and Robust Access Method for points & Rectangles. In: Proceedings ACM SIGMOD 1990 International Conference on management of data (1990)

    Google Scholar 

  8. Brinkhoff, T., Kriegel, H.P., Seeges, B.: Efficient Processing of spatial join using R-Trees. In: Proceedings ACM SIGMOD 1993 International Conference on Management (1993)

    Google Scholar 

  9. Chang, S.K., Jungert, E., Li, Y.: The Design of Pictorial Database based upon the theory of symbolic projections. In: Proceedings 1st International Symposium on large Spatial databases, Santa Barbara, USA, pp. 303–323 (1989)

    Google Scholar 

  10. Nardelli, E., Projetti, G.: Time & space efficient secondary memory representation of Quadtrees. Information System 22(1), 25–37 (1997)

    Article  Google Scholar 

  11. Papadopoulos, A.N., Manolopoulos, Y.: Nearest Neighbor search, A Database Perspective. Springer, Heidelberg (January 2005)

    MATH  Google Scholar 

  12. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)

    Google Scholar 

  13. Samet, H.: Applications of Spatial Data Structures. Addison-Wesley, Reading (1990)

    Google Scholar 

  14. Finkel, R.A., Bentley, J.L.: Quad Trees: A Datastructure for retrieval of composite keys (April 8, 1974)

    Google Scholar 

  15. Overmars, M.H., Van Leeuwen, J.: Multikey retrieval from K-d trees and QUAD-trees. In: International Conference on Management of Data, pp. 291–301 (1985)

    Google Scholar 

  16. RobInson, J.T.: The K-D-B-Tree A Search Structure for Large, Multidimensional Dynamic Indexes. In: 4CM-SIGMOD 1981 International, Conference 0” Management -o-f Data Association (1981)

    Google Scholar 

  17. Van Leeuwen, J., Overmars, M.H.: Stratified Balanced Search Trees. Acta, Informatica 18, 345–359 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  18. Chang, J.M., Fu, K.S.: Dynamic Clustering Techniques for Physical Database, Design. In: International Conference on Management of Data, pp. 188–199 (1980)

    Google Scholar 

  19. Friedman, J.H., Bentley, J.L., Finkel, R.A.: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Mathematical Software 3(3), 209–226 (1977)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heritage Institute of Technology, Kolkata, 700107, India

    Rituparna Samaddar, Sandip Samaddar & Tai-hoon Kim

  2. Department of Multimedia, Hannam University, Daejeon, Republic of Korea

    Debnath Bhattacharyya

Authors
  1. Rituparna Samaddar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandip Samaddar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tai-hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Debnath Bhattacharyya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hannam University, Daejeon, South Korea

    Tai-hoon Kim

  2. Indian Statistical Institute, Kolkata, India

    Sankar K. Pal

  3. Department of Computer and Information Science, University of Michigan – Dearborn, 4901 Evergreen Road, 48128, Dearborn, MI, USA

    William I. Grosky

  4. Florida International University, EC 2910, 10555 W. Flagler Street, 33174, Miami, FL, USA

    Niki Pissinou

  5. National Taipei University of Education, No.134, Sec. 2, Heping E. Rd., Da-an District, 106, Taipei City, Taiwan (R.O.C.)

    Timothy K. Shih

  6. University of Warsaw & Infobright Inc., Poland

    Dominik Ślęzak

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Samaddar, R., Samaddar, S., Kim, Th., Bhattacharyya, D. (2010). Hierarchical Data Structures for Accessing Spatial Data. In: Kim, Th., Pal, S.K., Grosky, W.I., Pissinou, N., Shih, T.K., Ślęzak, D. (eds) Signal Processing and Multimedia. MulGraB SIP 2010 2010. Communications in Computer and Information Science, vol 123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17641-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17641-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17640-1

  • Online ISBN: 978-3-642-17641-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation