Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-11T00:10:31.343Z Has data issue: false hasContentIssue false
  • English
  • Français

Adaptive linear list reorganization under a generalized query system

Part of: Theory of data

Published online by Cambridge University Press:  14 July 2016

R. S. Valiveti ,
B. J. Oommen  and
J. R. Zgierski
R. S. Valiveti*
Affiliation:
Carleton University
B. J. Oommen*
Affiliation:
Carleton University
J. R. Zgierski*
Affiliation:
Carleton University
*
∗Postal address: School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6.
∗Postal address: School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6.
∗Postal address: School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the problem of reorganizing a linear list, when the individual queries consist of accesses to a subset of the elements stored, as opposed to the individual elements themselves. In this paper, which to our knowledge represents the first reported result in this model of query processing, we first propose a simple model for a query generator which emits set queries. Subsequently, we present extensions to the classical move-to-front (MTF) and transposition (TR) rules under this generalized query generation mechanism and analyze their performance.

Keywords

QUERY PROCESSINGMOVE-TO-FRONT RULETRANSPOSITION RULE

MSC classification

Primary: 68P05: Data structures
Secondary: 68P10: Searching and sorting 68P20: Information storage and retrieval
Type
Research Papers
Information
Journal of Applied Probability , Volume 32 , Issue 3 , September 1995 , pp. 793 - 804
Copyright
Copyright © Applied Probability Trust 1995 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

A preliminary version of some of the results contained in this paper were presented at Fundamentals of Computation Theory, FCT'91, Berlin.

The work of the first author was supported by a postgraduate award from the Natural Sciences and Engineering Research Council (NSERC) of Canada, as well as a postgraduate award, from Bell-Northern Research. The work of the second author was supported by NSERC of Canada. The work of the third author was supported by an NSERC summer grant.

References

[1] Bentley, J. L. and Mcgeoch, C. C. (1985) Amortized analyses of self-organizing sequential search techniques. Commun. ACM 28, 404–411.Google Scholar
[2] Burville, P. J. and Kingman, J. F. C. (1973) On a model for storage and search. J. Appl. Prob. 10, 697–701.Google Scholar
[3] Chung, F. R. K., Hajela, D. J. and Seymour, P. D. (1988) Self-organizing sequential search and Hilbert's inequalities. J. Computer Syst. Sci. 36, 148–157.CrossRefGoogle Scholar
[4] Hendricks, K. N. (1976) An account of self-organizing systems. SIAM J. Computing 5, 715–723.Google Scholar
[5] Hester, J. H. and Hirschberg, D. S. (1985) Self-organizing linear search. ACM Computing Surveys 17, 295–311.Google Scholar
[6] Knuth, D. E. (1973) The Art of Computer Programming: Vol. 3. Sorting and Searching. AddisonWesley, Reading, MA.Google Scholar
[7] Lam, K., Leung, M. and Siu, M. K. (1984) Self-organizing files with dependent accesses. J. Appl. Prob. 21, 343–359.CrossRefGoogle Scholar
[8] Rivest, R. L. (1976) On self-organizing sequential search heuristics. Commun. ACM 19, 63–67.Google Scholar
[9] Valiveti, R. S., Oommen, B. J. and Zgierski, J. R. (1990) Adaptive linear list reorganization under a generalized query system. Tech. Rep. SCS-TR-181, School of Computer Science, Carleton University, Ottawa.Google Scholar