Optimal Route Query Based on Forward Search and Backward Search

Given a set of spatial points DS, each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point, and covers a user-specified set of categories. The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. This paper has focused on a special case where the query contains the total order of all categories to be visited.

Provided by: The International Journal of Innovative Research in Computer and Communication Engineering Topic: Big Data Date Added: Mar 2014 Format: PDF

Find By Topic