ABSTRACT

With the recent explosive growth of the amount of data content and information on the Internet, it has become increasingly difficult for users to find and maximize the utilization of the information found in the internet. Traditional web search engines often return hundreds or thousands of results for a particular search, which is time consuming .In order to overcome these problems, we have described the implementation and design of the PALM Algorithm (PREPROCESSED APRIORI FOR LOGICAL MATCHING) in mining information data from the World Wide Web. The PALMALGORITHM provides us with a very efficient and simple way for finding related patterns while maneuvering through the internet. The PALM-ALGORITHM is implemented in two steps. The first step includes a Map-Reducing Algorithm which is used to traverse and analyze all the items of a large database and preprocess them using a variable called MINIMUM THRESHOLD SUPPORT to find the INITIAL CANDIDATE SET(C) AND LARGEITEM SET (L). The second step includes a pre-processing algorithm to find both the CANDIDATE(C) and LARGEITEM SET (L) for the further scans.