PROJECT SYNOPSIS 2014

Department of Computer Science and Engineering

Hindustan College of Science and Technology, Mathura

Page 1

TITLE: Organizing User Search History

TEAM:
Team Members:
No.
Roll No.
Student Name Mobile No. Email
1.
2811314
Mirnal Saini 9716529730 Mirnalsaini93@gmail.com
2.









PROJECT SUMMARY:
1. Functional Features
Registration and Log in
Query Group
Search history
Dynamic Query Grouping
Dynamic formulation of graph

2.
Technologies to be
used
Java, java script, Html,Oracle10g




PROJECT SYNOPSIS 2014


Department of Computer Science and Engineering
Hindustan College of Science and Technology, Mathura

Page 2
INTRODUCTION
However, the primary means of accessing information online is still through
keyword queries to a search engine. A complex task such as travel arrangement has to
be broken down into a number of co-dependent steps over a period of time. For
instance, a user may first search on possible destinations, timeline, events, etc. After
deciding when and where to go, the user may then search for the most suitable
arrangements for air tickets, rental cars, lodging, meals, etc. Each step requires one or
more queries, and each query results in one or more clicks on relevant pages.
One important step towards enabling services and features that can help users
during their complex search quests online is the capability to identify and group related
queries together. Recently, some of the major search engines have introduced a new
Search History feature, which allows users to track their online searches by
recording their queries and click, Bing search engine on February of 2010. This history
includes a sequence of four queries displayed in reverse chronological order together
with their corresponding clicks.
In addition to viewing their search history, users can manipulate it by manually
editing and organizing related queries and clicks into groups, or by sharing them with
their friends. While these features are helpful, the manual efforts involved can be
disruptive and will be untenable as the search history gets longer over time.




PROJECT SYNOPSIS 2014


Department of Computer Science and Engineering
Hindustan College of Science and Technology, Mathura

Page 3
OBJECTIVE

Its main objective is to minimize the user effort in searching by creating dynamic query
groups and further merging of related dynamic groups and to have graphical know how about the
searches for individual user and even for all users which is updated dynamically.
MODULES

Registration:
New user registers them by creating new accounts.
The act of enrolling.
This module can be used to allow administrator to create and implement a policy to
allow visitors to register as users.
Log in:
A login or logon refers to the credentials required to obtain access to a computer
system or other restricted area.
Only registered user can access the application.
After login registered user redirect to application. Every registered user have its own
unique ID and PASSWORD.
Query Group:
Our approach makes use of search logs in order to determine the relevance between
query groups more effectively
In fact, the search history of a large number of users contains signals regarding query
relevance, such as which queries tend to be issued closely together (query
reformulations), and which queries tend to lead to clicks on similar URLs (query clicks).
Search history:
We study the problem of organizing a users search history into a set of query groups in
an automated and dynamic fashion.
Each query group is a collection of queries by the same user that are relevant to each
other around a common informational need.
These query groups are dynamically updated as the user issues new queries, and new
query groups may be created over time.




PROJECT SYNOPSIS 2014


Department of Computer Science and Engineering
Hindustan College of Science and Technology, Mathura

Page 4
Dynamic Query Grouping:
One approach to the identification of query groups is to first treat every query in a users
history as a singleton query group, and then merge these singleton query groups in an
iterative fashion.
Dynamic formulation of graph:
No sooner did the click is made on search of any query from an individual users
account then a dynamic updation is reflected in the already existing graph of that
individual user and change is simultaneously reflected to the already existing graph of
search hit of overall users.


SYSTEM REQUIRMENTS


Hardware Configuration:-
1. Processor : Pentium IV or above
2. Speed : 1.1 GHz
3. RAM : 256 MB(min)
4. Hard Disk : 20 GB (min)


Software Configuration:-
1. Operating System : Windows95/98/2000/XP/7
2. Programming Language : JAVA 6.0 or above
3. Front End : Java Server Pages
4. Web Server : Apache Tomcat 5.5
5. Database : Oracle10g
6. Database Connectivity : JDBC.