(algorithm)
Definition: A heuristic that moves the target of a search to the root of the search tree so it is found faster next time.
Aggregate parent (I am a part of or used in ...)
splay tree.
See also move-to-front heuristic.
Note: This technique speeds up search performance only if the target item is likely to be searched for again soon.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 February 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "move-to-root heuristic", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 February 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/movetoroot.html