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 level. To evaluate these approaches we had implemented these structures (modified GiST ensures concurrency) and provide extensive experiments.
Proceedings of the Institute for System Programming, vol. 26, issue 4, 2014, pp. 73-90.
ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).
DOI: 10.15514/ISPRAS-2014-26(4)-6Full text of the paper in pdf (in Russian) Back to the contents of the volume