(data structure)
Definition: A data structure that is efficient even when accessing most of the data is very slow, such as, on a disk.
See also B-tree, external memory algorithm.
Note: See [Vitt01]. The external memory could be magnetic tape or even main memory if the cache is very fast.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:03 2006.
Cite this as:
Paul E. Black, "external memory data structure", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/externalMemoryDataStr.html
