Advanced move-to-front for list access problem

Abstract

In the context of linear search, list accessing problem is a well known research problem. Unsorted linear list of distinct elements and a request sequence are the input to the list accessing problem where access operation is to be performed on each request on an element of the list. The main objective of list accessing algorithm is to minimize the access cost while processing a request sequence on the list. We have named our algorithm as Advanced Move-To-Front (AMTF) in which new list is updated each time based on the frequency count of accessed element's position in the list. In our paper we have compared Advanced MTF cost with MTF (Move to Front) cost of the accessed elements in the given request sequence and we have found that in most of the data sets, Advanced MTF cost is less as compared to MTF cost.