As the volume of data in the data center is experiencing a tremendous growth, so vendor of data prefers to outsource sensitive and important documents for the purpose of privacy conserving. The documents are stored in encrypted format so it is essential to develop efficient search cipher text technique. In the process of encryption relationship between document is concealed which leads to perform deterioration. In this paper, a quality hierarchical clustering (QHC) method is proposed to support searching mechanism and to meet fast searching within cloud environment. In this paper multi-keyword ranked search, hierarchical clustering index (MRSE-HCI) architecture is used. For search result verification, least hash subtree is used. The proposed method has several advantages over traditional method in document’s retrieval and rank privacy.

Ms. Shumaila Tajreen and Dr. G.S.S Rao (2017). Hierarchical Clustering Over Rank Keyword Search with Secure and Competent Outlook . International Journal of Computer Engineering In Research Trends, 4(10), 388-391. Retrieved from http://ijcert.org/ems/ijcert_papers/V4I1003.pdf

[1].  Dynamic Multi-Keyword Ranked Searchable Security Algorithm Using CRSA and B-Tree Prasanna B T#1, C B Akki*2 #Department of ISE, EPCET Associate Professor, Bengaluru, INDIA-560049 *Department of ISE, SJBIT Professor, Bengaluru, INDIA-560060 
[2].  Reusability of Search Index over Encrypted Cloud Data on Dynamic update Kavitha R1, R J Poovaraghan2 Student, M.Tech, SRM University, Chennai, India1 Assistant Professor (OG), Department of Computer Science, SRM University, Chennai, India2.
[3]. Dynamic Multi-keyword Top-k Ranked Search over Encrypted Cloud Data Xingming Sun, Xinhui Wang, Zhihua Xia, Zhangjie Fu and Tao Li Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science & Technology, Nanjing, 210044.
[4]. R. Ostrovsky, D. Boneh, G. Di Crescenzo, and G. Persiano, “Public key encryption with keyword search,” in Advances in Cryptology-Eurocrypt 2004, 2004, pp. 506–522.
[5]. R. Curtmola, J. Garay, S. Kamara and R. Ostrovsky “Searchable symmetric encryption: Improved definitions and efficient construc-tions”Proc. 13th ACM Conf. Comput. Commun. Secur., pp. 79-88, 2006.
[6]. G. Craig “Fully homomorphic encryption using ideal lattices”Proc. 41st Annu. ACM Symp. Theory Comput., vol. 9, pp. 169-178, 2009.
[7]. H. Pang, J. Shen and R. Krishnan ‘Privacy-preserving similarity-based text retrieval’ , ACM Trans. Internet Technol., vol. 10, no. 1, p. 39, Feb., 2010. 
[8]. Q.Wang et al, K. Ren, C.Wang, “Security challenges for the public cloud,” IEEE Internet Computing, 2012, vol. 16, no. 1, pp. 69–73.
[9]. S. Kamara, C. Papamanthou and T. Roeder “Dynamic searchable symmetric encryption”Proc. Conf. Comput. Commun. Secur., pp. 965-976, 2012.
[10]. S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu and M. Steiner “Outsourced symmetric private information retrieval”Proc. ACM SIGSAC Conf. Comput. Commun. Secur., pp. 875-888, Nov., 2013.
[11]. D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu and M. Steiner “Highly-scalable searchable symmetric encryption with support for Boolean que-ries”Proc. Adv. Cryptol,., pp. 353-373, 2013.
[12].  K. Ren, C. Wang, N. Cao, and W. Lou, “Enabling secure and efficient ranked keyword search over outsourced cloud data,” Parallel and Distributed Systems, IEEE Transactions on, 2012, vol. 23, no. 8, pp. 1467–1479.
[13]. S. Jarecki, D. Cash, J.Jaeger, C. Jutla, M. C. Rosu, and M.  Steiner, “Dynamic searchable encryption in very large databases: Data structures and implementation”, vol. 14, 2014,
[14]. R. X. Li, Z. Y. Xu, W. S. Kang, K. C. Yow and C. Z. Xu “Efficient Multi-keyword ranked query over encrypted data in cloud computing”Futur. Gener. Comp. Syst., vol. 30, pp. 179-190, Jan., 2014.
[15]. Chi Chen, Xiaojie Zhu, Peisong Shen “An Efficient Privacy-Preserving Ranked Keyword Search Method”, IEEE Transactions on Parallel and Distributed Systems, Vol. 27, No. 4, April 2016.  
[16] A.Raghavendra Praveen Kumar, K.Tarakesh, and U.Veeresh  ,” A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted.” International Journal of Computer Engineering in Research Trends., vol.2, no.12, pp. 1137-1141, 2015.
[17] Mr. Rahul Hon, and Mrs. N.Sujatha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 314-320, 2016.
[18] Kallem Rajender Reddy, and Y.Sunitha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.2, no.9, pp. 640-645, 2015.
[19] Vadla Jhansi Rani, and K.Samson Paul,” Secure Multi Keyword Dynamic Search Scheme Supporting Dynamic Update..” International Journal of Computer Engineering in Research Trends., vol.4, no.8, pp. 356-360, 2017.
[20] Mr. M. Veerabrahma Chary  and Mrs.N.Sujatha,” A Novel Additive Multi-Keyword Search for Multiple Data Owners in Cloud Computing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 308-313, 2016.