Skip to main content
SpringerLink
Log in

The Study of Multidimensional R-Tree-Based Index Scalability in Multicore Environment

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8974))

  • 533 Accesses

Abstract

In this paper we consider the scalability issues of a classical data structure used for multidimensional indexing: the R-Tree. This data structure allows for an efficient retrieval of records in low-dimensional spaces and is de facto standard of the industry. Following the design guidelines of the GiST model we have implemented a prototype which supports concurrent (parallel) access and provides read committed isolation level. Using our prototype we study the impact of threads and cores on the performance of the system. In order to do this, we evaluate it in several scenarios which may occur during the course of DBMS operation.

This work is partially supported by Russian Foundation for Basic Research grant 12-07-31050.

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.

    http://web.archive.org/web/20120424201336/ http://wwwdb.inf.tu-dresden.de/sigmod2012contest/leaderboard/ last accessed: 26/04/2014.

References

  1. Beckmann, N., Seeger, B.: A revised R*-tree in comparison with related index structures. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, SIGMOD 2009, New York, NY, USA, pp. 799–812. ACM (2009)

    Google Scholar 

  2. Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and recovery in generalized search trees. SIGMOD Rec. 26(2), 62–72 (1997)

    Article  Google Scholar 

  3. Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proceedings of the 21th International Conference on Very Large Data Bases, VLDB 1995, San Francisco, CA, USA, pp. 562–573. Morgan Kaufmann Publishers Inc. (1995)

    Google Scholar 

  4. Smirnov, K., Chernishev, G., Fedotovsky, P., Erokhin, G., Cherednik, K.: R-tree re-evaluation effort: a report. Technical report (2014) http://www.math.spbu.ru/user/chernishev/papers/r-tree-scalability2014.pdf

  5. Papadopoulos, A.N., Corral, A., Nanopoulos, A., Theodoridis, Y.: R-Tree (and Family). In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 2453–2459. Springer, New York (2009). doi:10.1007/978-0-387-39940-9_300

    Google Scholar 

  6. Stonebraker, M., Madden, S., Abadi, D.J., Harizopoulos, S., Hachem, N., Helland, P.: The end of an architectural era: (it’s time for a complete rewrite). In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, pp. 1150–1160. VLDB Endowment (2007)

    Google Scholar 

  7. Harizopoulos, S., Abadi, D.J., Madden, S., Stonebraker, M.: Oltp through the looking glass, and what we found there. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, New York, NY, USA, pp. 981–992. ACM (2008)

    Google Scholar 

  8. Achtert, E., Goldhofer, S., Kriegel, H.P., Schubert, E., Zimek, A.: Evaluation of clusterings - metrics and visual support. In: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, ICDE 2012, Washington, DC, USA, pp. 1285–1288. IEEE Computer Society (2012)

    Google Scholar 

  9. Kornacker, M., Shah, M., Hellerstein, J.M.: AMDB: an access method debugging tool. SIGMOD Rec. 27(2), 570–571 (1998)

    Article  Google Scholar 

  10. Arge, L., Procopiuc, O., Vitter, J.S.: Implementing i/o-efficient data structures using TPIE. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 88–100. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. ACM SIGMOD Programming Contest 2012. http://wwwdb.inf.tu-dresden.de/sigmod2012contest/. Accessed: 9th November 2012

  12. Chernishev, G., Smirnov, K., Fedotovsky, P., Erokhin, G., Cherednik, K.: To sort or not to sort: the evaluation of R-tree and \({B}^+\)-tree in transactional environment with ordered result set requirement. In: SYRCoDIS, pp. 27–34 (2013)

    Google Scholar 

  13. Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47–57 (1984)

    Article  Google Scholar 

  14. Taniar, D., Leung, C.H.C., Rahayu, W., Goel, S.: High Performance Parallel Database Processing And Grid Databases. Wiley Publishing, New York (2008)

    Book  Google Scholar 

Download references

Acknowledgements

We would like to thank organizers of ACM SIGMOD Programming Contest’12 for providing a base for benchmark, data generator and unit tests. This work is partially supported by Russian Foundation for Basic Research grant 12-07-31050.

Author information

Authors and Affiliations

  1. Saint-Petersburg University, Saint Petersburg, Russia

    Kirill Smirnov, George Chernishev, Pavel Fedotovsky, George Erokhin & Kirill Cherednik

Authors
  1. Kirill Smirnov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Chernishev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pavel Fedotovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. George Erokhin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kirill Cherednik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Chernishev .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Manchester, Manchester, United Kingdom

    Andrei Voronkov

  2. A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia

    Irina Virbitskaite

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smirnov, K., Chernishev, G., Fedotovsky, P., Erokhin, G., Cherednik, K. (2015). The Study of Multidimensional R-Tree-Based Index Scalability in Multicore Environment. In: Voronkov, A., Virbitskaite, I. (eds) Perspectives of System Informatics. PSI 2014. Lecture Notes in Computer Science(), vol 8974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46823-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46823-4_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46822-7

  • Online ISBN: 978-3-662-46823-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation