Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{143196,
        author = {Bhoomika Panchal and Vinit Kumar Gupta},
        title = {A Survey Paper on Variants of R-tree Data Structure},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {2},
        number = {7},
        pages = {543-547},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=143196},
        abstract = {R-tree is one of the two basic index structures for spatial databases with various variants evolved of it. Depends upon the applications requirement individual or combination of variants is utilize to achieve performance. Various performance optimization parameters are index structure, query support, data type support, etc. Overlapping is major disadvantage of R-tree which degrades search performance. Though here we present  variant of R-tree which will reduces the search complexity.},
        keywords = {R-tree, variants, index structure, search complexity, query performance, overlapping, Minimum bounding rectangles (MBRs)},
        month = {},
        }