700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Research Article Open Access
Many search modules area unit won’t to search something from anywhere; this method is employed to quick nearest neighbour search exploitation keyword. Existing work usually specialise in finding top-k Nearest Neighbours.It doesn't take into account the density of knowledge objects within the spatial area. Conjointly these strategies area unit low efficient for progressive question. however in meant system, for instance once there's seek for nearest eating place, rather than considering all the hotels, a nearest neighbour question would elicit the eating place that's, nearest among those whose menus contain spicy, hard liquor all at constant time, resolution to such queries is predicated on the IR2-tree, however IR2-tree having some drawbacks. IR2-tree contains Signature file due to its conservative nature may lead to some search result that only contains single keyword result Efficiency of IR2-tree badly is wedged attributable to some drawbacks in it. Thespatial inverted index is that the technique which is able to be the answer for this drawback.
To read the full article Peer-reviewed Article PDF
Author(s): Ashitosh N. Mete, Hari Pansare, Vinayak Satam, Ramnath Banerjee
Nearest Neighbor Search, Keyword Search, Spatial Index, Adaptive, Advanced Computing Architectures, Bioinformatics and Computational Biology