Transposition achieves OPT$+O(1)$ in polynomial time for IID list update
The paper improves the expected cost of queries in a self-organizing list by proving that after a polynomial number of queries, the expected cost is at most OPT + O(1)
The paper improves on a previous result by showing that the expected cost of queries in a self-organizing list is at most OPT + O(1) after a polynomial number of queries, whereas the previous result had an expected cost of at most OPT + 1.
Before reading this…
Applications
- →Database query optimization
To understand this paper, make sure you know these concepts first:
- Markov chainsfind papers →
- expected cost minimizationfind papers →
Abstract
More Like ThisIn the classical list update problem, a set of items must be stored in a list-type structure, where accessing the $i$-th element costs $i$. Items will be queried in an IID manner according to some probability distribution $p$ on the items. We want to minimize the expected cost of each query. The optimal order is to place the items in decreasing order of probability $p_1 \geq p_2 \geq \cdots$ with expected cost $\mathsf{OPT} = \sum_j j p_j$, but the probability vector $p$ is generally unknown. Thus we use a self-organizing list following the transposition rule: an item is transposed 1 position forward whenever it is queried. Coester (2026) proved that, at stationarity measure for the transposition rule, the expected cost of a query is at most $\mathsf{OPT} + 1$. However, this Markov chain may have arbitrarily slow mixing time. We prove that, for arbitrary $p$ and arbitrary initial orderings $σ$, after polynomially many queries in the number of items, the expected cost of a query is at most $\mathsf{OPT} + O(1)$.