KOLQ in a Road Network

Optimal location querying (OLQ) in road networks is important for various applications. Existing work assumes no labels for servers and that a client only visits the nearest server. These assumptions are not realistic and it renders the existing work not useful in many cases. In this paper, we introduce the KOLQ problem which considers the k nearest servers of clients and labeled servers. We also proposed algorithms for the problem. Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.