A Group Based Approach for Path Queries in Road Networks

摘要: The advancement of mobile technologies and map-based applications enables a user to access wide variety location-based services that range from information queries navigation systems. Due the popularity among users, service provider often requires answer large number simultaneous (or contemporary) queries. Thus, processing efficiently on spatial networks (i.e., road networks) have become an important research area in recent years. In this paper, we focus path find shortest between source destination user. particular, address problem finding paths for networks. Traditional systems consider one query at time are not suitable many due high computational cost overhead. We propose efficient group based approach provides practical solution with reduced cost. key concept our is share common travel then compute group. Experimental results show effectiveness efficiency approach.