RKAP Tree An Efficient Multidimensional Region Searching Algorithm

Recent applications like location-based-provider and social-network-based should handle continuous spatial approximate key-word queries over geo-textual streaming data of enormous amount. The optimization of continuous query processing remains an huge difficulty and performance trouble of both location information and textual information must be equivalent for every arriving streaming data tuple is more serious for spatio-textual streaming data. For geo-textual streaming data the foremost current stage in the evolution of endless spatial-keyword query approaches normally inadequacy of both supports for approximate key-word matching and excessive-performance processing query data. Progressing to address this problem, We propose a completely precise Adaptive spatial-key-word Partition structure, namely AP-Tree, to successfully organize a large variety of queries, the improvement of AP-Tree is adaptable to the spatial and key-word distributions below the guide of a cost model.. Searching is predicated on the Rabin Karp fast string matching algorithm. It is also a hash based method and is functioning on massive pool of data, for achieving higher throughput and excessive efficiency performance enhancement compared to the sooner techniques.