## Self-Organizing Linear Search (1985)

Venue: | ACM Computing Surveys |

Citations: | 29 - 3 self |

### BibTeX

@ARTICLE{Hester85self-organizinglinear,

author = {J. H. Hester and D. S. Hirschberg},

title = {Self-Organizing Linear Search},

journal = {ACM Computing Surveys},

year = {1985},

volume = {17},

pages = {295--311}

}

### Years of Citing Articles

### OpenURL

### Abstract

this article. Two examples of simple permutation algorithms are move-to-front, which moves the accessed record to the front of the list, shifting all records previously ahead of it back one position; and transpose, which merely exchanges the accessed record with the one immediately ahead of it in the list. These will be described in more detail later. Knuth [1973] describes several search methods that are usually more efficient than linear search. Bentley and McGeoch [1985] justify the use of self-organizing linear search in the following three contexts:

### Citations

729 |
Tarjan. Amortized efficiency of list update and paging rules
- Sleator, E
- 1985
(Show Context)
Citation Context ...4.5, Table 4.3. 3.3. Worst Case The worst case cost of move-to-front has been shown by many [Burville and Kingman 1973; Knuth 1973; Hendricks 1976; Rivest 1976; Bitner 1979; Bentley and McGeoch 1985; =-=Sleator and Tarjan 1985-=-] to be no more than twice that of the optimal static ordering. The worst case cost of move-to-front, when there is no locality and the accessed record is always at the end of the list, is approximate... |

71 |
On self-organizing sequential search heuristics
- Rivest
- 1976
(Show Context)
Citation Context ...reases the costs of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [McCabe 1965; Burville and Kingman 1973; Knuth 1973; Hendricks 1976; =-=Rivest 1976-=-; Bitner 1979] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this value if the time to permute the records were included. Hendricks [1972]... |

41 |
Amortized analyses of self-organizing sequential search heuristics
- Bentley, McGeoch
- 1985
(Show Context)
Citation Context ...s is supported in Section 4.5, Table 4.3. 3.3. Worst Case The worst case cost of move-to-front has been shown by many [Burville and Kingman 1973; Knuth 1973; Hendricks 1976; Rivest 1976; Bitner 1979; =-=Bentley and McGeoch 1985-=-; Sleator and Tarjan 1985] to be no more than twice that of the optimal static ordering. The worst case cost of move-to-front, when there is no locality and the accessed record is always at the end of... |

39 |
On Serial Files with Relocatable Records
- McCabe
- 1965
(Show Context)
Citation Context ...ability is accessed, it is moved all the way to the front, which increases the costs of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [=-=McCabe 1965-=-; Burville and Kingman 1973; Knuth 1973; Hendricks 1976; Rivest 1976; Bitner 1979] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this valu... |

36 |
Heuristics that dynamically organize data structures
- Bitner
- 1979
(Show Context)
Citation Context ...sts of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [McCabe 1965; Burville and Kingman 1973; Knuth 1973; Hendricks 1976; Rivest 1976; =-=Bitner 1979-=-] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this value if the time to permute the records were included. Hendricks [1972] applies Mark... |

29 | Exegesis of self-organizing linear search - Gonnet, Munro, et al. - 1981 |

19 | Self-organizing sequential search and Hilbertâ€™s inequalities - Chung, Hajela, et al. - 1988 |

16 | The stationary distribution of an interesting Markov chains - Hendricks - 1972 |

13 | Optimal list order under partial memory constraints - Kan, Ross - 1980 |

12 |
On a model for storage and
- Burville, Kingman
- 1973
(Show Context)
Citation Context ...cessed, it is moved all the way to the front, which increases the costs of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [McCabe 1965; =-=Burville and Kingman 1973-=-; Knuth 1973; Hendricks 1976; Rivest 1976; Bitner 1979] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this value if the time to permute th... |

10 |
An Account of Self-Organizing Systems
- Hendricks
- 1976
(Show Context)
Citation Context ...front, which increases the costs of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [McCabe 1965; Burville and Kingman 1973; Knuth 1973; =-=Hendricks 1976-=-; Rivest 1976; Bitner 1979] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this value if the time to permute the records were included. Hen... |

9 | A counterexample to a conjecture on optimal list ordering - Andqrson, Nash, et al. |

6 | Simulations of Dynamic Sequential Search Algorithms - TENENBAUM - 1978 |

3 | An Extension of a Theorem Concerning an Interesting Markov Chain - Hendricks - 1973 |

1 | Self-Organizing Heuristics for Implicit Data Structures - Frederickson - 1984 |

1 | Self-Organizing Search Lists Using Probabilistic Back-Pointers - Hester, Hirschberg - 1985 |

1 |
A "Self-Organizing" File. The Art of
- Knuth
- 1973
(Show Context)
Citation Context ... way to the front, which increases the costs of future accesses to many other records. The asymptotic cost for a general ae has been shown by several analyses [McCabe 1965; Burville and Kingman 1973; =-=Knuth 1973-=-; Hendricks 1976; Rivest 1976; Bitner 1979] to be: 1 + 2 X 1ijn P i P j P i + P j This cost includes only the search time; it could be as much as twice this value if the time to permute the records we... |

1 | On the Use of Smoothsort and Stochastic Move-to-front Operations for Optimal List Organization - Oommen - 1984 |