(definition)
Definition: A data structure and associated algorithms primarily to search for points defined in multidimensional space.
Also known as PAM.
Specialization (... is a kind of me.)
EXCELL, grid file, hB-tree, twin grid file, two-level grid file, k-d tree, BSP-tree, quadtree, UB-tree, buddy tree, locality-sensitive hashing.
See also spatial access method, space ordering method.
Note: After [GG98].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 October 2008.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Paul E. Black, "point access method", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 October 2008. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/pointAccessMethod.html