spatial access method


Definition: A data structure to search for lines, polygons, etc.

Also known as SAM.

Specialization (... is a kind of me.)
cell tree, extended k-d tree, GBD-tree, multilayer grid file, D-tree, P-tree, R-file, R+-tree, R*-tree, R-tree, skd-tree.

See also point access method, space ordering method.

Note: After [GG98]. Point access methods may not support region, overlap, enclosure, etc. searches very well.

Author: PEB

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

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

Entry modified 6 October 2008.
HTML page formatted Fri Mar 25 16:20:35 2011.

Cite this as:
Paul E. Black, "spatial access method", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 6 October 2008. (accessed TODAY) Available from:

to NIST home page