Search in R-Trees To find data items intersecting a given query point/region,do the following,starting from the root node: If the node is a leaf node,output the data items whose keys intersect the given query point/region. Else,for each child of the current node whose bounding box intersects the query point/region,recursively search the child B BB, BB2 BB3 A B CD E F GH I D 8 Database System Concepts-7th Edition 24.23 @Silberschatz,Korth and SudarshanDatabase System Concepts - 7 24.23 ©Silberschatz, Korth and Sudarshan th Edition Search in R-Trees ▪ To find data items intersecting a given query point/region, do the following, starting from the root node: • If the node is a leaf node, output the data items whose keys intersect the given query point/region. • Else, for each child of the current node whose bounding box intersects the query point/region, recursively search the child