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

Autor:	P. V. Fedotovsky, G. A. Erokhin, K. E. Cherednik, K. K. Smirnov, G. A. Chernishev
Jazyk:	English<br />Russian
Rok vydání:	2018
Předmět:	r-дерево b+-дерево индексирование многомерное индексирование лексикографический порядок эксперименты postgresql Electronic computers. Computer science QA75.5-76.95
Zdroj:	Труды Института системного программирования РАН, Vol 26, Iss 4, Pp 73-90 (2018)
Druh dokumentu:	article
ISSN:	2079-8156 2220-6426
DOI:	10.15514/ISPRAS-2014-26(4)-6
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/2c8ceeacf60245a2b2bfee5475faef60 Zobrazit plný text záznamu View record in DOAJ