期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：3
出版社：S.S. Mishra
摘要：In Real-time world problems need fast algorithm with minimum error. Now days there are many applications are use for searching results on web. There are many algorithms which are used for the searching the results. Pattern matching method is one of them. In web application people deals with the different types of data, for example text searching, image searching, audio searching and Video searching. Every search engine uses different search algorithms for handling different types of data. Full search algorithm increases the pattern matching process. This paper will discuss about complexity, efficiency and techniques used by the algorithms relates with different. This paper proposes an analysis and comparison of different algorithms for full search equivalent pattern matching like complexity, efficiency and techniques. Which algorithm is best for which type of data
