Example R-Tree The bounding box of a node is a minimum sized rectangle that contains all the rectangles/polygons associated with the node Bounding boxes of children of a node are allowed to overlap Rectangles being Indexed R-Tree B BB1 BB2 BB3 A BCDE F GHI Database System Concepts-7th Edition 24.22 @Silberschatz,Korth and SudarshanDatabase System Concepts - 7 24.22 ©Silberschatz, Korth and Sudarshan th Edition Example R-Tree ▪ The bounding box of a node is a minimum sized rectangle that contains all the rectangles/polygons associated with the node • Bounding boxes of children of a node are allowed to overlap Rectangles being Indexed R-Tree