Customisible POI

We present a unied framework for dealing with exact point-of-interest (POI) queries
in dynamic continental road networks within interactive applications. We show that partition-
based algorithms developed for point-to-point shortest path computations can be naturally
extended to handle augmented queries such as nding the closest restaurant or the best post
ofce to stop on the way home, always ranking Point-Of-Interest (POI) according to a user-
dened cost function. Our solution allows different trade-offs between indexing effort (time
and space) and query time. Our most exible variant allows the road network to change
frequently (to account for trafc information or personalized cost functions) and the set of
POIs to be specied at query time. Even in this fully dynamic scenario, our solution is fast
enough for interactive applications on continental road networks. It also provides notification
for the nearest location ie; This feature allows the user to give his taste/something which
he/she needs to identify during a journey. This application will provide notifications about
locations according to users particular interest during the journey.

1.USER MODULE

Gives Point-Of-Interest queries.

Pre-set locations.

2.ADMIN MODULE

Notifications for Pre-set locations.

Builds a database for the locations

QUERY PROCESSING MODULE

Initially keywords are extracted from the query.

Locations are identified based on the keywords.

NOTIFICATION MODULE

Pre-set locations are processed every time.

When the user is present within this range, notifications are provided