To sort or not to sort: the evaluation of R-Tree and B+-Tree in transactional environment with ordered result requirement

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

Full description

Bibliographic Details
Published in:Труды Института системного программирования РАН
Main Authors: P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev
Format: Article
Language:English
Published: Russian Academy of Sciences, Ivannikov Institute for System Programming 2018-10-01
Subjects:
r-дерево
b+-дерево
индексирование
многомерное индексирование
лексикографический порядок
эксперименты
postgresql
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/828
Description
Summary: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.
ISSN:2079-8156
2220-6426

Similar Items