1. PHASE 1 - PRESENTATION Presented By - Karthik Kannambadi Sridhar
- Ramakrishnan Sathyavageeswaran
- Vaidehi Jariwala
A KWIC BASED SEARCH ENGINE

2. Introduction
CyberMiner is a Web Search Engine, mimicking the behavior of popular search engines like Google, Bing and Yahoo.
The web-links to be searched are part of a local database, and depending on the search keywords, the corresponding entries are shown to the user, from within the indexed database.

3. Next questions…. What? – Functional Requirements How? – ADT/OOP
Why? – why ADT?

4. What? Build a search engine based on KWIC system. Phase 1 Phase 2
Build KWIC system in J2EE
Use in-memory for storing KWIC indices
Provide web based interface for the User
Phase 2
Retrieving the stored indices and reporting the search results
Use Database for permanent storage of indices
Provide search capabilities
Display algorithm processing alongside

5. Key Word In Context - KWIC
A KWIC index is formed by sorting and aligning the words within an article title to allow each word in titles to be searchable alphabetically in the index.
The input module takes in the user input (Sting of words).
Circular Shifter then repeatedly removes the first word and appends it at the end of the line, creating (n-1) entries for each line. Each of those lines are added to the database
Alphabetizer then sorts all of the stored lines, in alphabetical order, so that the database is easily searchable for the stored keywords.
An output medium presents the corresponding entries onto the User through a User Interface.

6. How? Master Control Input Output Output medium Input medium
addNewLine()()
doCircularShift()
CircularShifter
getLineString()
doAlphabetize()
Alphabetizer
setWord()
getLine()
getWord()
setLine()
setLine()
getLine()
getLineString()
setLine()
getLine()
Processing Call
GUI event
Line Storage

7. KWIC System – Object Oriented Architecture

8. Why Object Oriented (or) Abstract Data Type?
This style gives strong support to modifiability and scalability, which are the prime
Modifiability:
Change in processing algorithm
If we change processing in one algorithm then it will not affect others.
Change in Data representation
Scalability:
There is no constraint on number of lines processed and stored in Database.

9. Screenshot(s)
User friendliness and intuitiveness

10. Thank you..