science

Self-organizing list

Self-organizing list is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Self-organizing list rather than just read about it. In short: 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.

Key takeaways

Self-organizing list belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Self-organizing list to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Self-organizing list from memory before moving on to harder problems.

Reference excerpt

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 The concept of self-organizing lists has its roots in the idea of activity organization of records in files stored on disks or tapes. One frequently cited discussion of self-organizing files and lists is that of Knuth. 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. 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. 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 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.

Citations

General and cited references Self Organization (PDF), 2004, archived from the original (PDF) on 2012-04-14, retrieved 2011-12-13 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

Worked examples

Example 1 — a first encounter with Self-organizing list

Start with the simplest possible case. Write down what Self-organizing list claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Self-organizing list before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Self-organizing list ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Self-organizing list

In research: Self-organizing list appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Self-organizing list in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Self-organizing list is common in secondary-school and first-year university syllabi. It links to neighbouring topics Linked lists, so understanding it makes those chapters shorter.
In everyday life: Look for Self-organizing list outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Self-organizing list” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Self-organizing list in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Self-organizing list means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Self-organizing list out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Self-organizing list in simple terms?

Why does Self-organizing list matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Self-organizing list?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Self-organizing list.