C.

P Ramya [18] :Since it is necessary to store data on different storage devices

so to have privacy and security. It is desirable to encrypt the data before sto
ring them. Since data is stored in a third party storage device in encrypted for
m it is very difficult to search data in its encrypted form. Thus making the ret
rieval process is difficult in large scale databases. In this paper we study and
compare different techniques for key word search on encrypted data and we study
and analyze their efficiency and security provided by them.

Nikita B. Zambare, Swati Manekar[19]: Searching for Keywords is an impulsive pro

cedure for searching useful and relevant data from various sources like document
s, graphs, relational databases, texts etc. The Uncertain Graph Data are widely
used in real life applications. Uncertain Graphs pervasively exist in real appli
cations, where data frequently exhibit uncertainties. Because of presence of unc
ertainty, it is a critical task for keyword searching on Uncertain Graph Data. S
ometimes Keyword Searching phenomenon provides improper underlying results. Tech
niques discussed in this paper help to cover all these issues. Effective results
are provided with the employed methods. This survey is done to decide which key
word searching technique is appropriate to derive the perfect results. These tec
hniques prove to be very invoking to non-expert users in real applications.

D. Kamini, M. Suresh, S. Neduncheliyan[20]: Cloud computing becomes more effecti

ve and prevalent on basis of economy. Data owners outsource their data to cloud
which contain more sensitive information. To provide security and privacy, such
sensitive data usually have to be encrypted before outsourcing. It also becomes
challenge to search over encrypted data. Here we consider that a large number of
data users and document files in cloud and there must be a search service that
allows multiple keyword queries and generates ranked results of retrieved files.
In this paper, we propose a multi-keyword search scheme that not only enable do
cument keyword search but also supports linear, gram based and semantic searches
. We construct a special tree-based index structure and propose a fuzzy Search S
erver that creates wild card based fuzzy keyword Set which overcome KGA (Keyword
Guessing Attack) and provide efficient multi-keyword ranked search. KNN algorit
hm is used to encrypt the index and query. It also uses the relevance score calc
ulation for ranking the documents. Majority of computing work is done on the ser
ver side and all operations performed only on cipher text and hence there is no
information leakage thus ensuring data security.

A. Nagamalli, S. Sagar Krishna, B. KeerthiPriya[21]: Encryption of data is of ut

most importance for secure transmission. Traditional keyword search techniques d
ownloading all the data and decrypting locally is clearly impractical, due to th
e huge amount of bandwidth cost in cloud scale systems. This paper presents a me
thodology for encrypting the data for limited reserved strings that are stored i
n Counting Bloom Filters (CBF). CBF is a small array of element addresses that a
re connected to the array through a hashing mechanism. Counting bloom filter is
used for increasing the speed of the set membership tests. If the string is a me
mber of counting bloom filter it is encrypted using Data Encryption Standard, el
se the string is transmitted without encryption. This reduces the effective time
for encryption and increases security.

Shima Tabibian, Ahmad Akbari, Babak Nasersharif[22]: Keyword spotting systems ca

n be divided into two main groups: HMM-based and discriminative-based systems. S
ome of these systems apply a phonetic search algorithm to the sequence of recogn
ized phones to find position of target keyword in a set of speech utterances. Th
us, they need a fast and accurate phonetic search algorithm to find the position
of the target keyword. In this paper, we propose a hierarchical search algorith
m. In each level of hierarchy, some segments of input speech will be ignored due
 to their low probability of being target keyword. This tends to a smaller searc
h space and so faster search and lower computational complexity in comparison wi
th the Viterbi algorithm which is usually used in keyword spotting applications
as a phonetic search algorithm. We apply the proposed search method to the class
ification part of the discriminative keyword spotter introduced in our previous
works. The experimental results indicate that the hierarchical search algorithm
is 100 times faster than the modified Viterbi algorithm when it is used in the d
iscriminative keyword spotting system. On the other hand, FOM of the discriminat
ive keyword spotting system using the proposed hierarchical search algorithms de
graded about 2 % in comparison to the case that this system uses a modified vers
ion of Viterbi algorithm.

Zhaoteng Song, Xinhuai Tang[23]: Web Service classification becomes more essenti
al with the increasing number of Web Services. The current practical approach fo
r management and discovery is based on keyword search techniques. In this paper,
we present an approach based on semantic reasoning and ontology techniques in o
rder to organize web services automatically and accurately. And we will verify o
ur approach by comparing with METEOR-S's classification results.

Haizhou Fu, HyeongSik Kim, Kemafor Anyanwu[24]: Recent keyword search techniques
on Semantic Web are moving away from shallow, information retrieval-style appro
aches that merely find keyword matches towards more interpretive approaches that a
ttempt to induce structure from keyword queries. The process of query interpreta
tion is usually guided by structures in data, and schema and is often supported
by a graph exploration procedure. However, graph exploration-based interpretive
techniques are impractical for multi-tenant scenarios for large databases becaus
e separate expensive graph exploration states need to be maintained for differen
t user queries. This leads to significant memory overhead in situations of large
numbers of concurrent requests. This limitation could negatively impact the pos
sibility of achieving the ultimate goal of personalizing search. In this paper,
we propose a lightweight interpretation approach that employs indexing to improv
e throughput and concurrency with much less memory overhead. It is also more ame
nable to distributed or partitioned execution. The approach is implemented in a
system called SKI and an experimental evaluation of SKI's performance on the DBPed
ia and Billion Triple Challenge datasets shows orders-of-magnitude performance i
mprovement over existing techniques.

Zhangjie Fu, Xingming Sun, Nigel Linge[25]: In recent years, consumer-centric cl

oud computing paradigm has emerged as the development of smart electronic device
s combined with the emerging cloud computing technologies. A variety of cloud se
rvices are delivered to the consumers with the premise that an effective and eff
icient cloud search service is achieved. For consumers, they want to find the mo
st relevant products or data, which is highly desirable in the "pay-as-you use"
cloud computing paradigm. As sensitive data (such as photo albums, emails, perso
nal health records, financial records, etc.) are encrypted before outsourcing to
cloud, traditional keyword search techniques are useless. Meanwhile, existing s
earch approaches over encrypted cloud data support only exact or fuzzy keyword s
earch, but not semantics-based multi-keyword ranked search. Therefore, how to en
able an effective searchable system with support of ranked search remains a very
challenging problem. This paper proposes an effective approach to solve the pro
blem of multi-keyword ranked search over encrypted cloud data supporting synonym
queries. The main contribution of this paper is summarized in two aspects: mult
i-keyword ranked search to achieve more accurate search results and synonym-base
d search to support synonym queries. Extensive experiments on real-world dataset
were performed to validate the approach, showing that the proposed solution is
very effective and efficient for multikeyword ranked searching in a cloud enviro
nment.
Amol N. Jamgade, Shivkumar J. Karale[26]: Information retrieval system is taking
an important role in current search engine which performs searching operation b
ased on keywords which results in enormous amount of data available to the user,
from which user cannot figure out the essential and most important information.
This limitation may be overcome by a new web architecture known as semantic web
which overcome the limitation of keyword based search technique called conceptu
al or semantic search technique. Natural language processing technique is mostly
implemented in QA system for asking user's question and several steps are also
followed for conversion of questions to query form for getting an exact answer.
In conceptual search, search engine interprets the meaning of user's query and t
he relation among the concepts that documents contains with respect to a particu
lar domain that produces specific answers instead of giving list of answers. In
this paper, we proposed ontology based semantic information retrieval system and
Jena semantic web framework in which, user enters an input query which is parse
d by Standford Parser then triplet extraction algorithm is used. To all input qu
ery, SPARQL query is formed and then it is fired on the knowledge base (Ontology
) that finds appropriate RDF triples in knowledge base and retrieve the relevant
information using Jena framework.

M. SaravanaPriya, M. JananiSankari[27]: This paper focuses on work done in Confe

rence Domain. The overall objective of our project is to create and maintain the
information in Conference domain by introducing semantic technologies. This pap
er analyzes the limitations in keyword based search techniques and the need for
semantic based intelligent information retrieval for Conference domain. The Sema
ntic web is an evolution of current WWW and aims to establish meaning of data su
ch that it can be shared and reused via machine readable operations. The crux of
the Semantic Web is in semantic representation and reasoning of data using onto
logies and its retrieval. In this paper, we emphasis more about Protege tool and a
n architecture based on the tool and its addressing issues are presented. We use
d the Protege tool for deploying a convenient mechanism in order to create and edi
t ontology for conference domain system. Search activities carried out by system
and meaningful results are extracted and performances are evaluated.