This paper investigates the subject of usage of the R-Tree data structure as applied to the construction of software systems used for processing frequently changing geospatial data. It also illustrates emerging performance issues and proposes several approaches to resolve them. The experimentally calculated data for some of these approaches is presented here. As a result of the research, there have been implemented a number of algorithms of updating the R-Tree, which, in certain cases, are capable of increasing its performance.