Modification of index access methods, based on R-trees
This article is devoted to modification of index access methods, based on R-trees, in DBMS. The improvement is directed on search acceleration with index usage; it is based on adding special information into index structure. Using of this information make it possible to optimize search process considerably. The modification consist of three stages. The internal structure of search tree is changed at the each modification stage. Performance test results confirm the modification efficiency. This improvement of R-trees will implement in PosgreSQL DBMS. The implemented approach can be applied in any DBMS.