Abstract—Searches of the entire World Wide Web using search engines such as Google, Bing, and Ask have become an extremely common way of locating information. Searches are usually keyword based, which has advantages and disadvantages. The challenge for the user is to come up with a set of search terms which is neither too large (making the search too specific and resulting in many false negatives) or too small (making the search too general and resulting in many false positives). The results retrieved by the search engines are in terms of millions of pages which would not all be useful the user. This paper gives a way of classification of the search results soth at the search results can be categorized so as to narrow the million numbers.
Index Terms—HTML, DHTML,
tag, Search Engine,Frame, Hyperlinks, Form, Transclusion, Browser, Frame-Bust, Frame-Bust Protection, IFrame, Hyper Unique1 * Asst. Professor, CE-IT, CITC (vishwasraval.it@charusat.ac.in)
** Asso. Professor, CE-IT, CITC (amitthakkar.it@charusat.ac.in)
*** Asso. Professor, CE-IT, CITC (amitganu@yahoo.com)
**** Dean, Faculty of Engineering & Technology (ypkosta@yahoo.com),(IEEE Member) (SCPM, Stanford University)
Charotar University of Science Technology (CHARUSAT), Education Campus, Changa – 388421, Ta – Petlad, Dist – Anand, Gujarat (INDIA)
Cite: Vishwas J Raval, Amit R Thakkar, Amit P Ganatra and Yogesh P Kosta, "Re-Search & Re-Classification Algorithm-An Adaptive Algorithm for Search Engines," International Journal of Computer Theory and Engineering vol. 2, no. 6, pp. 907-911, 2010.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
