Leutenegger introduced a recursive sorting algorithm for preprocessing a batch of data to be inserted in  these data structures. One better performing version of this data structure imposes "forced reinsertion" on  nodes that have too many objects. Different pickSeeds approaches differentiate the quadratic and linear  splitting methods for inserting objects into full nodes in this data structure. One data structure whose name  implies that it is a variant of this structure is actually an adaptation of a B+-tree that chooses the insertion path  based on Hilbert values. Each node in this data structure devised by Antonin Guttman contains a list of objects with  their respective MBR. These data structures are useful in
Leutenegger introduced a recursive sorting algorithm for preprocessing a batch of data to be inserted in  these data structures. One better performing version of this data structure imposes "forced reinsertion" on  nodes that have too many objects. Different pickSeeds approaches differentiate the quadratic and linear  splitting methods for inserting objects into full nodes in this data structure. One data structure whose name  implies that it is a variant of this structure is actually an adaptation of a B+-tree that chooses the insertion path  based on Hilbert values. Each node in this data structure devised by Antonin Guttman contains a list of objects with  their respective MBR. These data structures are useful in GIS. For 10 points, name these trees that use quadrilaterals  and other shapes to store spatial information.
Leutenegger introduced a recursive sorting algorithm for preprocessing a batch of data to be inserted in  these data structures.
R tree