 The prioritized R-tree is essentially a hybrid between a k-dimensional tree and a r-tree in that it defines a given object's N-dimensional bounding volume (called Minimum Bounding Rectangles - MBR) as a point in N-dimensions, represented by the ordered pair of the rectangles.The term "prioritized" arrives from the introduction of four priority-leaves that represents the most extreme values of each dimensions, included in every branch of the tree.Before answering a window-query by traversing the sub-branches, the prioritized R-tree first checks for overlap in its priority nodes.