You are on page 1of 18

FUZZY KEY WORD SEARCH IN CLOUD COMPUTING

Under the Esteemed Guidance of T.Arunasri Department of Informational Technology Padmasri Dr B V Raju Institute of Technology By

E.Deepika B.Haripriya K.Vaishnavi

(09211A1210) (09211A1214) (09211A1258)

INTRODUCTION

Fuzzy Search or Search engine is a software program that searches for sites based on the words that you designate as search terms. Search engines look through their own databases of information in order to find what it is that you are looking for.

Search engine is the popular term for an Information Retrieval (IR) system.

HOW DO FUZZY SEARCH ENGINE WORKS

PROBLEM IDENTIFICATION

Searches for the web pages of a person with a given name constitute a notable fraction of queries to Web search engines. Provides only for Namesake purpose Many dynamically generated sites are not indexable by search engines; this phenomenon is known as the invisible web. Results are not properly ordered

Tricks are used while producing results which causes pollution leading to unnecessary links

PROVIDING SOLUTION FOR THE PROBLEM


To explore new mechanism for constructing To design efficient and effective fuzzy search

To validate the security of the proposed scheme.


Developing web Search based on association

Using of word variants or stemming technology

EXISTING AND PROPOSED SYSTEMS


Existing system:
This straightforward approach apparently provides fuzzy
keyword search over the encrypted files while achieving search privacy using the technique of secure trapdoors. However, this approaches serious efficiency disadvantages.

Proposed system:
The simple enumeration method in constructing fuzzy keyword sets would introduce large storage complexities, which greatly affect the usability.

SYSTEM ARCHITECTURE

WILDCARD BASED TECHNIQUE


we proposed to use a wildcard to denote edit operations at the same position. The wildcard-based fuzzy set edits distance to solve the problems.

GRAM - BASED TECHNIQUE


Another efficient technique for constructing fuzzy set is based on grams. The gram of a string is a substring that can be used as a signature for efficient approximate search.

SYMBOL BASED TIRE TRAVERSE SEARCH SCHEME


To enhance the search efficiency, we now propose a symbolbased tire-traverse search scheme, where a multi-way tree is constructed for storing the fuzzy keyword set over a finite symbol set.

TECHNIQUE USED
String Matching Algorithm:

Tries to find a place where one or several strings (also called patterns) are found a larger string or text.

Provides a collection of different algorithms for computation of the exact string matching problem. Each function computes a list of all starting positions of occurrences of the pattern in the string.

NUMBER OF MODULES

Document processor Query processor Search and Matching function Ranking Capability

Summarizing and Presenting documents.

HARD WARE REQUIREMENTS


System Hard Disk : Pentium IV 2.4 GHz. : 40 GB.

Floppy Drive : 1.44 Mb. Monitor Mouse : 15 VGA Colour. : Logitech.

Ram

: 512 Mb.

SOFTWARE REQUIREMENTS
Software Requirements:
Operating system Coding Language Database : Windows XP or 7. : ASP. Net with C#. : SQL server.

References:

Google, http://www.google.com. Practical techniques for searches on encrypted data in Proc. of IEEE Symposium on Security and Privacy00

CONCLUSION

Search engine plays important role in accessing the content over the internet, it fetches the pages requested by the user. It made the internet and accessing the information just a click away. The need for better search engines only increases Security should also provided while searching