The development of a search engine &
comparison according to algorithms
(Concrete Mathematics 2003 Spring Term Project Proposal )
1. Team Member
Haebeom Lee
20032066
doldol@icu.ac.kr
Noseong Park
20032034
behack@icu.ac.kr
Sungsoo Kim
20032017
kss@icu.ac.kr
2. Project Introduction
Our team will compare the performance of the algorithms used in Information Retrieval
System. On the basis of that comparison we also make good search engine and
demonstrate it. Vector, set, logic,
boolean algebra, relational algebra are related with
this project. About some concepts we will briefly mention below.

Vector Model : There are two kinds of Information Retrieval Model – Vector
Model & Probability Model. In the short run model is the method for calculating
the similarity. Recently vector model is widely used. For example Empas,
Naver, Google. All of them are made using vector model.

Relational Algebra : Most of commercial Information Retrieval System support
Boolean search and Similarity search. In the Boolean search, there are some
tricks to speed up the search time. These tricks are based on Relational algebra
and Boolean Algebra.

Algorithms : String match algorithm, cosequential table sorting algorithm and so
on. Many algorithms and method are required for indexing and searching.
We will show the computation time of these various methods through demonstration and
analyze about their difference. The key of our project is the selection of algorithms and
design of the core search engine.