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

Ausführliche Beschreibung

Bibliografische Detailangaben

Hauptverfasser:	P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev
Format:	Artigo
Sprache:	Inglês
Veröffentlicht:	Russian Academy of Sciences, Ivannikov Institute for System Programming 2018-10-01
Schriftenreihe:	Труды Института системного программирования РАН
Schlagworte:	r-дерево b+-дерево индексирование многомерное индексирование лексикографический порядок эксперименты postgresql
Online-Zugang:	https://ispranproceedings.elpub.ru/jour/article/view/828
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!