• Gilla saiteja
• Dr. R. Jegadeesan
• Bommella supraja
• Kandukuri sushma
• Kuragayala sushma

The advances in positioning techniques and location-based services, it is currently very common for roads networks to get textual content on the tops. The previous work identifies the optimal path that covers a series of query keywords have been studied in recent years. However, in many practical scenarios, the optimal path may not always be desirable. For example, a complete routing query is issued by providing some evidence that describes the spatial context between PoIs along road, where the result can be far from optimal. Therefore, in this paper, we investigate the search problem by an idea-based list (CRS), which allows the user to provide evidence of keywords and spatial relationships. First, propose a greedy algorithm and a dynamic programming algorithm as standards. To improve efficiency, developed a branch-and-bound algorithm that eliminates unnecessary vertices in query processing. In order to quickly locate nominee, deployed an AB-tree that stores both the distance and keyword information in tree structure. To further reduce the index size, construct a PB-tree by utilizing the virtue of 2-hop label index to pin point the nominee. Broad experiments are conducted and verify the superiority of our algorithms and index structures.

Spatial keyword queries, clue, Point-of-Interest, travel route search, query processing.

"EFFICIENT CLUE-BASED ROUTE SEARCH ON ROAD NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.97-101, March-2019, Available :http://www.jetir.org/papers/JETIRAU06015.pdf

"EFFICIENT CLUE-BASED ROUTE SEARCH ON ROAD NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp97-101, March-2019, Available at : http://www.jetir.org/papers/JETIRAU06015.pdf