A detailed description of top-k spatial preference queries and the schema of their execution will be presented. Then, it discusses existing R-tree based top-k spatial preference queries' execution algorithms and the optimization methods they utilize. Moreover, the paper presents a new optimization technique and an algorithm capable of utilizing it together with other methods. Finally, an analysis of proposed method's efficiency is presented.