An Exploration Approach To Progress The Rank Privacy In Data Collection

A hierarchical clustering strategy is proposed to bolster more pursuit semantics and furthermore to take care of the demand for quick ciphertext seek inside a major information condition. The proposed various hierarchical approach clusters the archives in light of the base importance limit, and after that parcels the subsequent groups into sub-clusters until the requirement on the most extreme size of clusters is come to. In the inquiry stage, this approach can achieve a direct computational many-sided quality against an exponential size increment of report gathering. Keeping in mind the end goal to check the legitimacy of indexed lists, a structure called least hash sub-tree is composed in this work