
- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup
- Algorithm
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- DSA - Greedy Algorithms
- DSA - Divide and Conquer
- DSA - Dynamic Programming
- Data Structures
- DSA - Data Structure Basics
- DSA - Array Data Structure
- Stack & Queue
- DSA - Stack
- DSA - Expression Parsing
- DSA - Queue
- Searching Techniques
- DSA - Linear Search
- DSA - Binary Search
- DSA - Interpolation Search
- DSA - Hash Table
- Sorting Techniques
- DSA - Sorting Algorithms
- DSA - Bubble Sort
- DSA - Insertion Sort
- DSA - Selection Sort
- DSA - Merge Sort
- DSA - Shell Sort
- DSA - Quick Sort
- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal
- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Spanning Tree
- DSA - Heap
- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion
R-trees in Data Structure
Here we will see the R-Trees data structure. The R-Trees are used to store special data indexes in an efficient manner. This structure is very useful to hold special data queries and storages. This R-trees has some real life applications. These are like below −
Indexing multidimensional information
Handling game data
Hold geospatial coordinates
Implementation of virtual maps
One example of R-Tree is like below.
Corresponding R-tree is like below −
Properties of R-Trees
R-Trees are made of with single root, internal and leaf nodes
The root has a pointer to the largest region in the special domain
The parent nodes will hold child nodes where child nodes completely overlap the region of parent nodes
Leaf nodes hold data about MBR to the current object
MBR-Minimum bounding region is the minimum boundary box parameter surrounding the region under consideration
Difference between Quad-trees
Quad Tree | R-Tree |
Tiling level optimization is required | R-Tree do not require any optimization |
Quad-tree can be formed on B-tree | R-tree does not follow the structure of B-tree |
Spatial Index creation is faster | Spatial Index creation is slower |
Nearest neighbor querying is slower, but the Window querying is faster. | Nearest neighbor querying is faster, but the Window querying is slower. |
- Related Articles
- Huffman Trees in Data Structure
- Splay trees in Data Structure
- Solid Trees in Data Structure
- Range Trees in Data Structure
- BSP Trees in Data Structure
- Interval Trees in Data Structure
- Segment Trees in Data Structure
- Tournament Trees, Winner Trees and Loser Trees in Data Structure
- Optimal Lopsided Trees in Data Structure
- Threaded Binary Trees in Data Structure
- Red-Black Trees in Data Structure
- Comparison of Search Trees in Data Structure
- Dynamic Finger Search Trees in Data Structure
- Level Linked (2,4)-Trees in Data Structure
- Randomized Finger Search Trees in Data Structure
