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

Description complète

Détails bibliographiques

Auteurs principaux:	P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev
Format:	Artigo
Langue:	Inglês
Publié:	Russian Academy of Sciences, Ivannikov Institute for System Programming 2018-10-01
Collection:	Труды Института системного программирования РАН
Sujets:	r-дерево b+-дерево индексирование многомерное индексирование лексикографический порядок эксперименты postgresql
Accès en ligne:	https://ispranproceedings.elpub.ru/jour/article/view/828
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!