Laddar…
Academic Journal
To sort or not to sort: the evaluation of R-Tree and B+-Tree in transactional environment with ordered result requirement
P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev
Труды Института системного программирования РАН, Vol 26, Iss 4, Pp 73-90 (2018)
Sparad:
| Titel | To sort or not to sort: the evaluation of R-Tree and B+-Tree in transactional environment with ordered result requirement |
|---|---|
| Författarna | P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev |
| Utgivningsår |
2018
|
| Källa |
Труды Института системного программирования РАН, Vol 26, Iss 4, Pp 73-90 (2018)
|
| Beskrivning |
In this paper we consider multidimensional indexing with the additional constraint of lexicographical ordering. In order to deal with this problem we discuss two well-known tree data structures: R-tree and B-tree. We study the problem in the transactional environment with read committed isolation level. To evaluate these approaches we had implemented these structures (modified GiST ensures concurrency) and provide extensive experiments.
|
| Dokumenttyp |
article
|
| Språk |
English
Russian |
| Information om utgivare |
Ivannikov Institute for System Programming of the Russian Academy of Sciences, 2018.
|
| Ämnestermer | |
