approach for combining different sources of evidence into a single rank for search
engines. It was a Genetic Programming based approach and the quality of the final
ranking was achieved better results as per the user satisfaction. Few years ago,
Hong et al. [12] have proposed a robust system of extracting information for search
engines using fast heuristic techniques. They have proposed a template that detects
the structure of the data records and then aligns them into data items, which leads to
simplifying the search engine information retrieval mechanism.
Several works show the importance of guiding the learners in acquiring information
resources as well as the difficulty on recommending Web resources for learners.
Zimmer [13] has discussed a multidisciplinary prospective on Web search engines in a
handbook of Internet research. It would be interesting to provide Web search func-
tionalities in learning environments. In another important work, Ozcan et al. [14]have
proposed nonuniform result page models with varying numbers of results for navi-
gational queries. Due to various reasons such as hardware/network failures, excessive
query load, lack of matching documents, or service contract limitations, a search
engine may fail to serve a query. In this kind of scenarios, where the backend search
system is unable to generate answers to queries, an approximate answer can be gen-
erated by exploiting the previously computed query results available in the result cache
of the search engine. Cambazoglu and team [15] have been explored a cache-based
query processing mechanism for search engines. Few researchers have been carried
out on collaborative decentralized approach [16], temporal information handling [17],
etc. by the Web researchers. Recently, Fuentes-Lorenzo et al. [18]haveproposeda
mechanism for handling ambiguous or synonym queries. In another work, Prates et al.
[19] have shown that contextual information significantly improves Web search
results. Furthermore, Killoran [20] has illustrated an approach that increases the vis-
ibility of Websites using search engine optimization techniques. We know there is an
eternal bond between human and technologies those are improving every day.
However, we have given an idea of some important works on search engine. In Fig. 1,
we have proposed a basic overview of a Web search engine.
A Web search engine mainly searches for the documents in the WWW.
Designing a new Web search engine has become an important topic in current
research of distributive computer science. Broadly, Web search engine components
are divided into two parts such as (a) Online components and (b) Offline compo-
nents. Online components are executed in the runtime and offline components are
executed while building Web search engine resources.
In Fig. 1, we have shown the various components of a Web search engine. The
working principle of offline components looks like Web crawler [21, 22], which
crawls the Web-pages and creates a Web-page reposi tory. Here we have considered
domain-specific crawler [23, 24], hence the downloaded Web-pages also support a
particular domain. We have identified the domain by using Ontology and Syntable.
According to Gruber [25] Ontology is a specification of a conceptualization.
Formally, Ontology [26, 27] is a set of domain related key information, which is
kept in an organized way based on thei r importance. Syntable [28, 29] is one type of
table which contains synonyms of all Ontology terms in a table. For each Ontology,
we have generated a separate Syntable [30], which leads to produce more accurate
Introduction 3