International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 175 - Number 3 |
Year of Publication: 2017 |
Authors: Kavitha Guda, Doolam Ramdarshan |
10.5120/ijca2017915478 |
Kavitha Guda, Doolam Ramdarshan . Nearest Keyword Multi-Dimensional Data by Index Hashing. International Journal of Computer Applications. 175, 3 ( Oct 2017), 13-15. DOI=10.5120/ijca2017915478
Catchphrase predicated look for in content prosperous multi-dimensional datasets encourages various novel applications and executes. In this paper, we consider objects that are marked with catchphrases and are embedded in a vector space. For these datasets, we ponder request that demand the most impervious aggregations of centers slaking a given course of action of watchwords. We propose a novel strategy called ProMiSH (Projection and Multi Scale Hashing) that uses self-confident projection and hash-predicated list structures, and achieves high flexibility and speedup. We present a right and an estimated variation of the count. Our exploratory results on sound and produced datasets show that ProMiSH has up to 60 times of speedup over front line tree-predicated frameworks.