Self-organizing list
 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. (January 2024) |
A self-organizing list is a list that reorders its elements based on some self-organizing heuristic to improve average access time. The aim of a self-organizing list is to improve efficiency of linear search by moving more frequently accessed items towards the head of the list. A self-organizing list achieves near constant time for element access in the best case. A self-organizing list uses a reorganizing algorithm to adapt to various query distributions at runtime.
History[edit]
The concept of self-organizing lists has its roots in the idea of activity organization of records in files stored on disks or tapes.[1] One frequently cited discussion of self-organizing files and lists is that of Knuth.[2] John McCabe gave the first algorithmic complexity analyses of the Move-to-Front (MTF) strategy where an item is moved to the front of the list after it is accessed.[3] He analyzed the average time needed for randomly ordered list to get in optimal order. The optimal ordering of a list is the one in which items are ordered in the list by the probability with which they will be needed, with the most accessed item first. The optimal ordering may not be known in advance, and may also change over time.
McCabe introduced the transposition strategy in which an accessed item is exchanged with the item in front of it in the list. He made the conjecture that in the average case, transposition worked at least as well as MTF in approaching the optimal ordering of records in the limit. This conjecture was later proved by Rivest.[4] McCabe also noted that with either the transposition or MTF heuristic, the optimal ordering of records would be approached even if the heuristic was only applied every Nth access, and that a value of N might be chosen that would reflect the relative cost of relocating records with the value of approaching the optimal ordering more quickly. Further improvements were made, and algorithms suggested by researchers including: Rivest, Tenenbaum and Nemes, Knuth, and Bentley and McGeoch (e.g. Worst-case analyses for self-organizing sequential search heuristics).
Applications[edit]
A self-organizing list uses a self-organising heuristic, an algorithm that modifies a data structure such as a linked list in response to use of the data structure.
Examples of self-organising heuristics include:
- Move-to-front (or 'Move to top') - places frequently used, or recently used, information is at the top so it can be found quickly, without having to traverse the whole list.
- Self-learning Frequency list (or 'Order by access frequency') - re-arranges a list of options in a GUI menu, so that the top ones are the options most commonly selected by the user.
- Re-insert at random position
- Move to back - used to organise a list of mirror servers, so that once a server has been used for downloading, it goes to the back of the queue, to discourage the user from selecting it again.
Notes[edit]
- ^ Becker, J.; Hayes, R.M. (1963), Information Storage and Retrieval: Tools, Elements, Theories, New York: Wiley
- ^ Knuth, Donald (1998), Sorting and Searching, The Art of Computer Programming, vol. 3 (Second ed.), Addison-Wesley, p. 402, ISBN 978-0-201-89685-5
- ^ McCabe, John (1965), "On Serial Files with Relocatable Records", Operations Research, 13 (4): 609–618, doi:10.1287/opre.13.4.609
- ^ Rivest, Ronald (1976), "On self-organizing sequential search heuristics", Communications of the ACM, 19 (2): 63–67, doi:10.1145/359997.360000, S2CID 498886
References[edit]
- Self Organization (PDF), 2004
- NIST DADS entry
- A Drozdek, Data Structures and Algorithms in Java Third edition
- Amer, Abdelrehman; B. John Oommen (2006), Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference, Lecture Notes in Computer Science, vol. 4007, doi:10.1007/11764298, ISBN 978-3-540-34597-8