Projection and Multi-Scale Hashing approach for Engineered Datasets

T. Swathi


Catchphrase based hunt in content rich multi-dimensional datasets encourages numerous novel applications and devices. In this paper, we consider objects that are labeled with watchwords and are inserted in a vector space. For these datasets, we examine inquiries that request the most secure gatherings of focuses fulfilling a given arrangement of watchwords. We propose a novel strategy called ProMiSH (Projection and Multi Scale Hashing) that utilizations irregular projection and hash-based file structures, and accomplishes high adaptability and speedup. We show a correct and an inexact variant of the calculation. Our test comes about on genuine and engineered datasets demonstrate that ProMiSH has up to 60 times of speedup over cutting edge tree-based strategies.

Full Text:


Copyright (c) 2018 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


EduPedia Publications Pvt Ltd, D-351, Prem Nagar-2, Suleman Nagar, Kirari, Nagloi, New Delhi PIN-Code 110086, India Through Phone Call us now: +919958037887 or +919557022047

All published Articles are Open Access at

Paper submission: or


Mobile:                  +919557022047 & +919958037887


Journals Maintained and Hosted by

EduPedia Publications (P) Ltd in Association with Other Institutional Partners

Pen2Print and IJR are registered trademark of the Edupedia Publications Pvt Ltd.