Applying Multi Property Tree for Multi Keyword Rank Searching and Dynamic Update in Cloud
Pawan Kumar Tanwar1, Ajay Khunteta2, Vishal Goar3
1Pawan Kumar Tanwar, Research Scholar, Assistant Professor, Department of Computer Science, Poornima University Jaipur & Govt. Engineering, College, Bikaner (Rajasthan), India.
2Dr. Ajay Khunteta, Professor, Department of Computer Science, Poornima University Jaipur (Rajasthan), India.
3Vishal Goar, Assistant Professor, Department of Computer Application, Govt. Engineering, College, Bikaner (Rajasthan), India.
Manuscript received on 20 September 2019 | Revised Manuscript received on 06 October 2019 | Manuscript Published on 11 October 2019 | PP: 574-578 | Volume-8 Issue-2S10 September 2019 | Retrieval Number: B11000982S1019/2019©BEIESP | DOI: 10.35940/ijrte.B1100.0982S1019
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Various types of data structures are used for keyword searching like binary tee, KBB tree, inverted tree, inverted index, Multi Property Tree (MPT). These data structures are used for searching keywords in cloud space after getting instructions from data user. On the basis of MPT data structure the authors have introduced a search scheme called MPTsearch algorithm. Experiments show that the proposed scheme performs better than linear search. It also achieves lower time consumption and computing overhead for queries and trapdoor formation. Moreover this scheme not only fulfills the searching part but also plays vital role in dynamic update (insertion and deletion) of data provided by the data owner.
Keywords: Multi Property Tree, MPT Search Algorithm, Dynamic Update.
Scope of the Article: Cloud Computing