We discuss the issue of searching the best K objects in more attributes for more users.Based on Fagin's algorithm we developed new methods solving the problem using B-tree and multifimensional B-tree.