Hi hackers,
I've implemented subj algorithm as PostgreSQL extension.
It looks like this realization is such as fast as R-Tree but sufficiently
more simple & compact.
Here (https://habrahabr.ru/post/319810/) or
here (
http://www.google.com/translate?hl=en&ie=UTF8&sl=auto&tl=en&u=https%3A%2F%2Fhabra
Hi hackers,
The low-level implementation of 3D Z-curve index
(https://github.com/bmuratshin/zcurve/tree/master)
is getting close to GiST R-Tree performance at
significantly lesser number of pages read from disk.
See attached figures,
times2 - average request execution time VS average points numbe
The algorithm for 2D is described in articles (in Russian)
https://habrahabr.ru/post/319810/ and
https://habrahabr.ru/post/319096/ .
Goggle-translator generates (IMHO) suitable for understanding text.
3D version article is not finished yet.
The data in figures are obtained in the following way:
1
