Float number rank is a kind of tricky approach, sorting may be slower but acceptable. I also wonder if there is a bidirectional pointer approach of ranking items can be used in SQLite, so that each re-rank only changes a few pointers at the cost of some searching speed (basically it should have same sorting speed with float number rank method).