A HIERARCHICAL SCHEME TO ACHIEVE FIND TIME AND OPERATION ON DOCUMENTS

N. Sainath, P. Srinivas Rao, Papishetty Niharika

Abstract


Many works were suggested in many types of threat to achieve various benefits for search for example single keyword search, multi-keyword rated search, and so forth.  Of individuals works, multi-keyword kinds of rated search is becoming more importance because of its realistic effectiveness.  We submit a great search method which draws on the tree above encoded cloud information, and it also manages multi-keyword search furthermore to dynamic process on selection of documents.  For acquiring of high search effectiveness, we produce a tree-based index structure and propose an formula using the index tree. The forecasted plan is called to provide multi-keyword query furthermore to a particular result ranking, in addition dynamic update above document collections. Due to important structure of tree-based index, forecasted search system will effectively get sub-straight line search serious amounts of manage the operation of deletion furthermore to insertion of documents.


Keywords


Multi-Keyword Ranked Search; Tree-Based Index; Sub-Linear Search; Encrypted Cloud Data; Documents; Result Ranking;

References


Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote encrypted data,” in Proceedings of the Third international conference on Applied Cryptography and Network Security. Springer-Verlag, 2005, pp. 442–455.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proceedings of the 13th ACM conference on Computer and communications security. ACM, 2006, pp. 79–88.

J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in INFOCOM, 2010 Proceedings IEEE. IEEE, 2010, pp. 1–5.

D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proceedings of the 4th conference on Theory of cryptography. Springer-Verlag, 2007, pp. 535–554.

B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267, 2011.

J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Advances in Cryptology–EUROCRYPT 2008. Springer, 2008, pp. 146–162.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2018, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.