P-tree

(data structure)

Definition: (1) A spatial access method that defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel. Space is split by hierarchically nested polytopes (multidimensional boxes with nonrectangular sides). The R-tree is a special case that has no additional hyperplanes. (2) A spatial access method that splits space by hierarchically nested polytopes. The R-tree is a special case in which all polytopes are boxes.

Generalization (I am a kind of ...)
tree, spatial access method.

Specialization (... is a kind of me.)
R-tree.

Aggregate child (... is a part of or used in me.)
polytope.

Note: (2) by Jagadish after [GG98].

Author: PEB

Implementation

Implementations of P-tree (1) insert (C and Pascal), delete max (C and Pascal), and head (C and Pascal)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "P-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/ptree.html