Skip to main content
SpringerLink
Log in

Bulk-Loading xBR\(^+\)-trees

  • Conference paper
  • First Online:
Model and Data Engineering (MEDI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9893))

Included in the following conference series:

Abstract

Spatial indexes are important in spatial databases for efficient execution of queries involving spatial constraints. The xBR\(^+\)-tree is a balanced disk-resident quadtree-based index structure for point data, which is very efficient for processing such queries. Bulk-loading refers to the process of creating an index from scratch as a whole, when the dataset to be indexed is available beforehand, instead of creating (loading) the index gradually, when the dataset items are available one-by-one. In this paper, we present an algorithm for bulk-loading xBR\(^+\)-trees for big datasets residing on disk, using a limited amount of RAM. Moreover, using real and artificial datasets of various cardinalities, we present an experimental comparison of this algorithm vs. the algorithm loading items one-by-one, regarding performance (I/O and execution time) and the characteristics of the xBR\(^+\)-trees created. We also present experimental results regarding the efficiency of bulk-loaded xBR\(^+\)-trees vs. xBR\(^+\)-trees where items are loaded one-by-one for query processing.

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 EPUB and 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

Notes

  1. 1.

    Retrieved from http://spatialhadoop.cs.umn.edu/datasets.html.

  2. 2.

    Due to space limitations, results for particular datasets are presented for some queries, only.

  3. 3.

    http://spatialhadoop.cs.umn.edu/.

References

  1. Shekhar, S., Chawla, S.: Spatial Databases - A Tour. Prentice Hall, Upper Saddle River (2003)

    Google Scholar 

  2. Van den Bercken, J., Seeger, B.: An evaluation of generic bulk loading techniques. In: VLDB Conference, pp. 461–470 (2001)

    Google Scholar 

  3. Roumelis, G., Vassilakopoulos, M., Loukopoulos, T., Corral, A., Manolopoulos, Y.: The xBR\(^+\)-tree: an efficient access method for points. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9261, pp. 43–58. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  4. Roumelis, G., Vassilakopoulos, M., Corral, A.: Performance comparison of xBR-trees and R*-trees for single dataset spatial queries. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 228–242. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322–331 (1990)

    Google Scholar 

  6. Arge, L., Hinrichs, K.H., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithmica 33(1), 104–128 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Van den Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: VLDB Conference, pp. 406–415 (1997)

    Google Scholar 

  8. Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed R-trees. In: SIGMOD Conference, pp. 17–31 (1985)

    Google Scholar 

  9. Kamel, I., Faloutsos, C.: On packing R-trees. In: CIKM Conference, pp. 490–499 (1993)

    Google Scholar 

  10. Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: STR: a simple and efficient algorithm for R-Tree packing. In: ICDE Conference, pp. 497–506 (1997)

    Google Scholar 

  11. Achakeev, D., Seeger, B., Widmayer, P.: Sort-based query-adaptive loading of R-trees. In: CIKM Conference, pp. 2080–2084 (2012)

    Google Scholar 

  12. Achakeev, D., Schmidt, M., Seeger, B.: Sort-based parallel loading of R-trees. In: BigSpatial Workshop, pp. 62–70 (2012)

    Google Scholar 

  13. Van den Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: VLDB Conference, pp. 406–415 (1997)

    Google Scholar 

  14. Ciaccia, P., Patella, M.: Bulk loading the M-tree. In: Australian Database Conference, pp. 15–26 (1998)

    Google Scholar 

  15. Berchtold, S., Böhm, C., Kriegel, H.-P.: Improving the query performance of high-dimensional index structures by bulk load operations. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 216–230. Springer, Heidelberg (1998)

    Google Scholar 

  16. Hjaltason, G.R., Samet, H., Sussmann, Y.J.: Speeding up bulk-loading of quadtrees. In: ACM GIS Conference, pp. 50–53 (1997)

    Google Scholar 

  17. Hjaltason, G.R., Samet, H.: Improved bulk-loading algorithms for quadtrees. In: ACM GIS Conference, pp. 110–115 (1999)

    Google Scholar 

  18. Hjaltason, G.R., Samet, H.: Speeding up construction of PMR quadtree-based spatial indexes. VLDB J. 11(2), 109–137 (2002)

    Article  Google Scholar 

  19. Vassilakopoulos, M., Manolopoulos, Y.: External balanced regular (x-BR) trees: new structures for very large spatial databases. In: Advances in Informatics: Selected Papers of the 7th Panhellenic Conference on Informatics. World Scientific Publishing Co., pp. 324–333 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece

    George Roumelis & Yannis Manolopoulos

  2. Department of Electrical and Computer Engineering, University of Thessaly, Volos, Greece

    Michael Vassilakopoulos

  3. Department of Informatics, University of Almeria, Almeria, Spain

    Antonio Corral

Authors
  1. George Roumelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Vassilakopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Corral
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Vassilakopoulos .

Editor information

Editors and Affiliations

  1. LIAS/ISAE-ENSMA , Futuroscope Chasseneuil, France

    Ladjel Bellatreche

  2. Department of Information Systems and Computation, Universitat Politècnica de València, Valencia, Spain

    Óscar Pastor

  3. University of Almería , Almería, Spain

    Jesús M. Almendros Jiménez

  4. IRIT / ENSEIHT , Toulouse, France

    Yamine Aït-Ameur

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Roumelis, G., Vassilakopoulos, M., Corral, A., Manolopoulos, Y. (2016). Bulk-Loading xBR\(^+\)-trees. In: Bellatreche, L., Pastor, Ó., Almendros Jiménez, J., Aït-Ameur, Y. (eds) Model and Data Engineering. MEDI 2016. Lecture Notes in Computer Science(), vol 9893. Springer, Cham. https://doi.org/10.1007/978-3-319-45547-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45547-1_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45546-4

  • Online ISBN: 978-3-319-45547-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation