A NOVEL KEYWORD COVER SEARCH USING APRIORI ALGORITHM

Abstract

Information in spatial information bases are associated with spatial coordinates. Text pertinency and spatial proximity are considered for retrieval. It is mundane that the objects in a spatial information base (e.g., hotels/restaurants/parks) are associated with keyword(s) to represent their businesses/accommodations/features. Recent works on spatial information is predicated on a set of objects. An approach is to retrieve m most proximate objects gratifying certain utilizer designated conditions. Most proximate keyword search (Keyword cover search) is to query objects, which together cover a set of query keywords and the inter-objects distance is minimum. In which keyword rating given by different users is additionally considered. A formidable number of spatial indicators have been aimed to help spatial information retrieval. In keyword cover search user’s current location is not designated. Location vigilant most proximate keyword search in spatial information can surmount this quandary by providing user’s current location as input and provide a path to such a location. Travelling distance is considered to engender a path, rather than Euclidean distance. Additionally the results retrieved in keyword cover search may not be always desirable to user’s cull. This critical drawback can be overcome by most proximate keyword search predicated on current location of utilizer.