Abstract A Cloud may be seen as flexible computing infrastructure comprising of many nodes that support several concurrent end users. To fully harness the power of the Cloud, efficient data query processing has to be ascertained. This work provides extra functionalities on cloud data query processing, a method called, Hybrid Tree Fast Similarity Query (HT-FSQS) Search is presented. The Hybrid Tree structure used in HT-FSQS consists of E-tree and R+ tree for balancing the load and performing similarity search. In addition, we articulate performance optimization mechanisms for our method by indexing quasi data objects to improve the quality of similarity search using R+ tree mechanism. Fast Similarity Query Search indexing build cloud data streams for handling different types of user queries and produce the result with lesser computational time. Fast Similarity Query Search uses inter-intra bin pruning technique, where it resolves the data more similar to user query. E- R+ tree FSQ method branch and bound search eliminates certain bins from consideration, speeding up the indexing operation. The experiment results demonstrate that the Hybrid Tree Fast Similarity Query (HT-FSQS) Search achieve significant performance gains in terms of computation time, quality of similarity search and load balance factor in comparison with non-indexing approaches.

References

[1] Brindha T. and Shaji R., “An Instance Communication Channel Key Organizer Model for Enhancing Security in Cloud Computing,” The International Arab Journal of Information Technology, vol. 13, no. 5, pp. 509-516, 2016.

[2] Carbunar B. and Tripunitara M., “Payments for Outsourced Computations,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 2, pp. 313-320, 2012.

[3] Dastjerdi A. and Buyya R., “Compatibility- Aware Cloud Service Composition under Fuzzy Preferences of Users,” IEEE Transactions on 0 0.05 0.1 0.15 0.2 0.25 0.3 2468101214 Load Balance Factor (%) Client Requests (R) HT-FSQSMKQEHEI (4)  ( * ) /HRLBF Client t Client R R R Tree Based Fast Similarity Query Search Indexing on Outsourced Cloud Data Streams 877 Cloud Computing, vol. 2, no. 1, pp. 1-13, 2014.

[4] Korpar M., Šošić M., Blažeka D., and Šikić M., “SW# Db: GPU-Accelerated Exact Sequence Similarity Database Search,” PloS one, vol. 10, no. 12, pp. 1-14, 2015.

[5] Li H., Liu D., Dai Y., Luan T., and Shen X., “Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage,” IEEE Transactions on Emerging Topics in Computing, vol. 3, no. 1, pp. 127-138, 2015.

[6] Li K., Mu Y., Li K., and Min G., “Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 11, pp. 2211-2219, 2013.

[7] Li R., Xu Z., Kang W., Yow K., and Xu C., “Efficient Multi-Keyword Ranked Query Over Encrypted Data in Cloud Computing,” Future Generation Computer Systems, vol. 30, pp. 179- 190, 2014.

[8] Ma X., Wang Y., and Pei X., “A Scalable and Reliable Matching Service for Content-Based Publish/Subscribe Systems,” IEEE Transactions on Cloud Computing, vol. 3, no. 1, pp. 1-13, 2015.

[9] Munadi K., Arnia F., Syaryadhi M., Fujiyoshi M., and Kiya H., “A Secure Online Image Trading System for Untrusted Cloud Environments,” SpringerPlus, vol. 4, no. 1, pp. 270-277, 2015.

[10] Peng N., Luo G., Qin K., and Chen A., “Query- Biased Preview over Outsourced and Encrypted Data,” The Scientific World Journal, vol. 2013, pp. 1-13, 2013.

[11] Peng Z., Cui D., Zuo J., and Lin W., “Research on Cloud Computing Resources Provisioning Based on Reinforcement Learning,” Mathematical Problems in Engineering, vol. 2015, pp. 1-12, 2015.

[12] Ren W., Zeng L., Liu R., and Cheng C., “F2AC: a Lightweight, Fine-Grained, and Flexible Access Control Scheme for File Storage in Mobile Cloud Computing,” Mobile Information Systems, vol. 2016, pp. 1-9, 2016.

[13] Shu J., Sun X., Zhou L., and Wang J., “Efficient Keyword Search Scheme in Encrypted Cloud Computing Environment,” International Journal of Grid and Distributed Computing, vol. 7, no. 5, pp. 65-76, 2014.

[14] Tang X., Alabduljalil M., Jin X., and Yang T., “Load Balancing for Partition-Based Similarity Search,” in Proceedings of the 37th international ACM SIGIR Conference on Research and Development in Information Retrieval, Gold Coast, pp. 193-202, 2014.

[15] Wang C., Cao N., Ren K., and Lou W., “Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 8, pp. 1467-1479, 2012.

[16] Wang P. and Ravishankar C., “Secure and Efficient Range Queries on Outsourced Databases using Rp-trees,” in Proceedings of the 29th International Conference on Data Engineering, Brisbane, pp. 314-325, 2013.

[17] Xia Z., Zhu Y., Xingming S., and Wang J., “A Similarity Search Scheme over Encrypted Cloud Images Based on Secure Transformation,” International Journal of Future Generation Communication and Networking, vol. 6, no. 6, pp. 71-80, 2013.

[18] Xiang J., Zhou Z., Shu L., Liu C., and Wang Q., “MR*-Tree: Novel Indexing and Retrieving Mechanism for Spatial Objects in Mobile PowerPoint Pages,” International Journal of Distributed Sensor Networks, vol. 11, no. 10, pp. 1-11, 2015.

[19] Yiu M., Assent I., Jensen C., and Kalnis P., “Outsourced Similarity Search on Metric Data Assets,” IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 2, pp. 338-352, 2012.

[20] Yun X., Wu G., Zhang G., Li K., and Wang S., “Fastraq: A Fast Approach to Range-Aggregate Queries in Big Data Environments,” IEEE Transactions on Cloud Computing, vol. 3, no. 2, pp. 206-218, 2015.

[21] Zhou A. and He B., “Transformation-based Monetary Cost Optimizations for Workflows in The Cloud,” IEEE Transactions on Cloud Computing, vol. 2, no. 1, pp. 85-98, 2014. 878 The International Arab Journal of Information Technology, Vol. 16, No. 5, September 2019 Balamurugan Balasubramanian received his MCA degree from St. Joseph’s College, Trichy during 2007 and currently a research scholar in Bharathiar University, Coimbatore, India. His research interest includes parallel and distributed computing, and network. Kamalraj Durai received his MCA degree from St. Joseph’s College, Trichy during 2007 and currently a research scholar in Bharathiar University, Coimbatore, India. His research interest includes parallel and distributed computing, and database. Jegadeeswari Sathyanarayanan received her M.Sc Computer Science degree from Kanchi Mamunivar Centre for Post Graduate Studies, Puducherry during 2005 and currently a research scholar in Bharathiar University, Coimbatore, India. Her research interest includes parallel and distributed computing, and network. Sugumaran Muthukumarasamy received his M.Sc degree in mathematics from University of Madras during 1986 and M.Tech degree in computer science and data processing from Indian Institute of Technology, Kharagpur, India in 1991, and obtained his Ph.D from Anna University, Chennai in 2008. He is currently working as Professor of Computer Science and Engineering at Pondicherry Engineering College, India. His areas of interests are theoretical computer science, analysis of algorithms, parallel and distributed computing, and Spatial- Temporal data.