A Survey Paper on Variants of R-tree Data Structure

A Survey Paper on Variants of R-tree Data Structure
Author(s):
Bhoomika Panchal, Vinit Kumar Gupta
Keywords:
R-tree, variants, index structure, search complexity, query performance, overlapping, Minimum bounding rectangles (MBRs)
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.
Article Details
Unique Paper ID: 143196 Publication Volume & Issue: Volume 2, Issue 7 Page(s): 543 - 547
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org