Skip to Main Content
In this paper, A Novel algorithm for Search in Integrated Distributed Systems Database using data mining mechanism will provide. The proposed algorithm is an algorithm in refining the data, first surveyed the entire database and then put the subsidiary that creates. Subset obtained by comparing the proposed algorithm is evaluated and can be scheduled for input from customers before their desired information in the database is to make clear. The algorithm in a case study with two Eclat and FP-growth algorithms were compared, and compared to similar samples reduced schedule and final time to time went back to a more optimal duration of the matches to be the work using multiple simulation accurate and comprehensive review is placed until the final users to access and reduced levels of customer satisfaction in the creation and update the system response time can increase with time of application users combined users And according to the final time in search of productivity and performance database increases and eventually break the proposed algorithm helps us time to get final confirmation of candidate keys to be more efficient previous algorithms. And refining the data in the database with minimum transaction information in face search navigation to the proposed algorithm with more reliability is used.