TY - JOUR

T1 - The study of multidimensional R-Tree-based index scalability in multicore environment

AU - Smirnov, K.

AU - Chernishev, G.

AU - Fedotovsky, P.

AU - Erokhin, G.

AU - Cherednik, K.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-662-46823-4_22

DO - 10.1007/978-3-662-46823-4_22

M3 - Article

VL - 8974

SP - 266

EP - 272

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -