Authors : K. Bhargavi and M.R. Narasinga Rao
Abstract: Many search engines are used to search everything from anywhere; this system is used to fast nearest acquaintance search using keyword. Existing works mainly focus on finding top-k Nearest Neighbors, where each bulge has to match the whole querying keywords. It does not consider the frequency of data objects in the spatial space. Also, these approach are low adequate for incremental query. But in contracted system, for example when there is search for nearest restaurant, rather of considering all the restaurants, a nearest acquaintance query would ask for the restaurant that is closest among those whose menus contain spicy, whiskey all at the same time, solution to such queries is based on the IR2-tree but IR2-tree having some drawbacks. Efficiency of IR2-tree badly is jolt because of some drawbacks in it. The solution for overcoming this problem should be searched. The dimensional inverted index is the technique which will be the solution for this problem.
K. Bhargavi and M.R. Narasinga Rao, 2016. A Fast Spatial and Temporal Quering Keywords. Asian Journal of Information Technology, 15: 3924-3926.