User Priority Based Search on Organizing User Search Histories with Security

Presently, users are facing many complicated and complex task-oriented goals on the search engine. Those are managing finances, making travel arrangements or any other planning and purchases. To reduce this problem, usually break down the tasks into a few codependent steps and issuing multiple queries, and which store repeatedly over a long period of time, whatever the user search in the search engine, that information search engines keep track of their queries and clicks while search in the search engine or online. In this paper we become skilled at the complexity of organizing user's historical queries into in an active and expected manner. Automatic identifying query groups are compassionate for the number of different search engines, deals with applications. Those are result status, query suggestions, query alterations. In this we are proposing security for the related query groups. When we work in the single or any organization, security will provides the security for the user's data or information in the search engine or any data base. Keywords - User history, search history, query clustering, query reformulation, click graph, task recognition, security. In this paper we study the problem of organizing a user's search history into a set of query groups in an automated and dynamic fashion. Every query group is a group of queries by the similar user that are related to each other. And the user searched for new query groups may be created over time. In particular, we develop an online query grouping method over the query fusion graph that combines a probabilistic query reformulation graph(3), which captures the relationship between queries frequently issued together by the user's, and query click graph, which captures the relationship between queries and clicks on similar URLs.