article

Free access

On self-organizing sequential search heuristics

Author:

Ronald RivestAuthors Info & Claims

Communications of the ACM, Volume 19, Issue 2

Pages 63 - 67

https://doi.org/10.1145/359997.360000

Published: 01 February 1976 Publication History

PDF eReader

Abstract

This paper examines a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that each element is searched for with a fixed probability independent of previous searches performed. The “move to front” and “transposition” heuristics are shown to be optimal to within a constant factor, and the transposition rule is shown to be the more efficient of the two. Empirical evidence suggests that transposition is in fact optimal for any distribution of search probabilities.

References

[1]

Burville, P.J., and Kingman, J.F.C., On a model for storage and search. J. Appl. Prob. 10 (1973), 697-701.

Crossref

Google Scholar

[2]

Franasek, P.A. and Wagner, T.J. Some distribution-free aspects of paging algorithm performance. J. ACM211 (Jan. 1974), 31-39.

Digital Library

Google Scholar

[3]

Hendricks, W.J. The stationary distribution of an interesting Markov chain. J. Appl. Prob. 9 (1972), 231-233.

Crossref

Google Scholar

[4]

Henricks, W.J. An extension of a theorem concerning an Interesting Markov chain. J. Appl. Prob. 10 (1973), 886-890.

Crossref

Google Scholar

[5]

Kemeny, J.G., and Snell, J.L. Finite Markov Chains. Van Nostrand, Princeton, N.J., 1960.

Google Scholar

[6]

Knuth, D.E. The Art of Computer Programmblg, Vol. 1, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

Digital Library

Google Scholar

[7]

McCabe, J. On serial files with relocatable records. Operations Res. 12 (July 1965), 609-618.

Digital Library

Google Scholar

[8]

Schay, G. Jr., and Dauer, F.W. A probabilistic model of a self-organizing file system. SlAM J. Appl. Math. 15 (1957), 874-888.

Crossref

Google Scholar

[9]

Yao, A. Personal communication.

Google Scholar

Cited By

View all

Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Subterfuge with Depth ChargeProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631550(134-143)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631550
Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Algorithmic Complexity Attacks with Resource BurningTheoretical Computer Science10.1016/j.tcs.2024.114762(114762)Online publication date: Aug-2024
https://doi.org/10.1016/j.tcs.2024.114762
Addanki VPacut MPourdamghani ARétvári GSchmid SVanerio J(2023)Self-Adjusting Partially Ordered ListsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228937(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228937
Show More Cited By

Recommendations

On self-organizing sequential search heuristics
SWAT '74: Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)

We examine a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that we search for each element with a fixed probability independent ...
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem

We introduce a heuristic for the Multi-Resource Generalized Assignment Problem (MRGAP) based on the concepts of Very Large-Scale Neighborhood Search and Variable Neighborhood Search. The heuristic is a simplified version of the Very Large-Scale Variable ...
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) consists of assigning n facilities to n locations to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 19, Issue 2

Feb. 1976

53 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/359997

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1976

Published in CACM Volume 19, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

174
Total Citations
View Citations
1,587
Total Downloads

Downloads (Last 12 months)136
Downloads (Last 6 weeks)22

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Subterfuge with Depth ChargeProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631550(134-143)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631550
Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Algorithmic Complexity Attacks with Resource BurningTheoretical Computer Science10.1016/j.tcs.2024.114762(114762)Online publication date: Aug-2024
https://doi.org/10.1016/j.tcs.2024.114762
Addanki VPacut MPourdamghani ARétvári GSchmid SVanerio J(2023)Self-Adjusting Partially Ordered ListsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228937(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228937
(2023)BibliographyEngineering a Compiler10.1016/B978-0-12-815412-0.00023-1(793-813)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00023-1
(2023)Data StructuresEngineering a Compiler10.1016/B978-0-12-815412-0.00022-X(769-791)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00022-X
Bisong OOommen B(2021)On utilizing the transitivity pursuit-enhanced object partitioning to optimize self-organizing lists-on-listsEvolving Systems10.1007/s12530-021-09378-1Online publication date: 13-Apr-2021
https://doi.org/10.1007/s12530-021-09378-1
Ghuge S(2020)Map and Trie based Compression Algorithm for Data Transmission2020 2nd International Conference on Innovative Mechanisms for Industry Applications (ICIMIA)10.1109/ICIMIA48430.2020.9074934(137-141)Online publication date: Mar-2020
https://doi.org/10.1109/ICIMIA48430.2020.9074934
Bisong OOommen B(2020)On utilizing an enhanced object partitioning scheme to optimize self-organizing lists-on-listsEvolving Systems10.1007/s12530-020-09327-4Online publication date: 12-Feb-2020
https://doi.org/10.1007/s12530-020-09327-4
Ekaba Bisong OJohn Oommen B(2020)Optimizing Self-organizing Lists-on-Lists Using Transitivity and Pursuit-Enhanced Object PartitioningArtificial Intelligence Applications and Innovations10.1007/978-3-030-49161-1_20(227-240)Online publication date: 29-May-2020
https://doi.org/10.1007/978-3-030-49161-1_20
Evans SRivest RStark P(2019)Leading the field: Fortune favors the bold in Thurstonian choice modelsBernoulli10.3150/17-BEJ93025:1Online publication date: 1-Feb-2019
https://doi.org/10.3150/17-BEJ930
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations