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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "external memory data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/externalMemoryDataStr.html