ﻣﻘﺎرﻧﺔ ﺑﯿﻦ ﺧﻮارزﻣﯿﺎت اﻟﺒﺤﺚ ﻓﻲ اﻟﻨﺼﻮص

Abstract

ص اﻟﺑﺣث Information ) ﺷﻬد ﻣﺟﺎل اﺳﺗرﺟﺎع اﻟﻣﻌﻠوﻣﺎت (ﺗطوارً ﻣﻠﺣوظﺎً ﻓﻲ Retrieval اﻟﻌﻘــود اﻷﺧﯾــرة وذﻟــك ﻧﺗﯾﺟــﺔ اﻟﻧﻣــو اﻟﻣﺿــطرد ﻟﻠﺷــﺑﻛﺔ اﻟﻌﻧﻛﺑوﺗﯾــﺔ وﺣﺎﺟــﺔ اﻟﻣﺳــﺗﺧدﻣﯾن اﻟﻣﺎﺳﺔ ﻟﻠﺑﺣث ﻓﻲ ذﻟك اﻟﻛم اﻟﻬﺎﺋل ﻣن اﻟﻣﻌﻠوﻣﺎت اﻟرﻗﻣﯾﺔ ، ﻟذا اﺻﺑﺢ ﻣن اﻟﺿرورة إﯾﺟﺎد أﻧظﻣﺔ اﺳﺗرﺟﺎع ﻣﻌﻠوﻣﺎت ﺗﺳﺎﻋد اﻟﻣﺳﺗﺧدﻣﯾن ﻓﻲ اﻟﺣﺻول ﻋﻠﻰ اﻟﻣﻌﻠوﻣﺔ اﻟﺗﻲ ﯾرﻏﺑون ﺑﻬﺎ ﻣن ﻫذا اﻟﻛم اﻟﻬﺎﺋل ﻣن اﻟﻧﺻوص ﺑﺎﻟﺳرﻋﺔ اﻟﻣطﻠوﺑﺔ . ﯾﻬدف ﻫذا اﻟﺑﺣث ﻹﯾﺟﺎد اﺳـرع واﻛﻔـﺄ ﺧوارزﻣﯾـﺎت ﻣطﺎﺑﻘـﺔ اﻟﻧﺻـوص اﻟﺗـﻲ ﯾﻣﻛـن ان ﺗﺳــﺗﺧدم ﻟﻠﺑﺣــث ﻓــﻲ ﻣﺣــرارت اﻟﻧﺻــوص وﻣﺣرﻛــﺎت اﻟﺑﺣــث ﻓــﻲ اﻻﻧﺗرﻧــت ، ﻣــن ﺧﻼل ﻣﻘﺎرﻧﺔ ﺧوارزﻣﯾﺎت ﻣطﺎﺑﻘﺔ اﻟﻧﺻوص اﻟﺗﻲ ﺗﻌﺗﻣد ﻋﻠﻰ اﺳﺗارﺗﯾﺟﯾﺔ ﻫﺟوم اﻟﻘـوة Divide & وﺗﻠـك اﻟﺗـﻲ ﺗﻌﺗﻣـد ﻋﻠـﻰ اﺳـﺗارﺗﯾﺟﯾﺔ ﻓـرق ﺗﺳـد Brute Force اﻟوﺣﺷـﯾﺔ ﻣﻣـــﺎ ﯾﺳـــﺎﻋد ﻓـــﻲ ﺗﻘﻠﯾـــل اﻟـــزﻣن اﻟﻣﺳـــﺗﻐرق ﻓـــﻲ اﻟﺑﺣـــث . ﺗﻣـــت اﻟﻣﻘﺎرﻧـــﺔ ، conquer ﺣـــروف (، ﺑﺄﺣﺟـــﺎم ٥ ، ٤، ٣) ﺑﺎﺳـــﺗﺧدام اطـــوال ﻣﺧﺗﻠﻔـــﺔ ﻟﻠـــﻧص اﻟﻣـــارد اﻟﺑﺣـــث ﻋﻧـــﻪ ﺻـــف (. ﺗـــم ﺑﻧـــﺎء ﻧظـــﺎم ١٦ ، ١٠ ﺑﯾﺎﻧـــﺎت ﻣﺗﻔﺎوﺗـــﺔ )ﻋـــدد ﺻـــﻔوف ﻗﺎﻋـــدة اﻟﺑﯾﺎﻧـــﺎت Naive ﻟﻠﻣﻘﺎرﻧـــﺔ ﺑـــﯾن ﺛـــﻼث ﻣـــن ﺧوارزﻣﯾـــﺎت ﻣطﺎﺑﻘـــﺔ اﻟﻧﺻـــوص ﻫـــﻲ ﺧوارزﻣﯾـــﺔ KMP و ﺧوارزﻣﯾـــﺔ Algorithm وﺗﻌﺗﻣـــدان ﻋﻠـــﻰ طرﯾﻘـــﺔ اﻟﺑﺣـــث Algorithm Boyer اﻟﺗﺗـﺎﺑﻌﻲ اﻟﺗـﻲ ﺗﺗﺑـﻊ اﺳـﺗارﺗﯾﺟﯾﺔ ﻫﺟـوم اﻟﻘـوة اﻟوﺣﺷـﯾﺔ وﺧوارزﻣﯾـﺔ -Moore ، واﻟﺗﻲ ﺗﺗﺗﺑﻊ طرﯾﻘﺔ اﻟﺑﺣث اﻟﺛﻧﺎﺋﻲ اﻟذي ﯾﻌﺗﻣد ﻋﻠﻰ اﺳﺗارﺗﯾﺟﯾﺔ ﻓّرق ﺗﺳد Algorithm وﻗﺎﻋــدة اﻟﺑﯾﺎﻧـــﺎت PHP ﺗــم ﺑﻧــﺎء اﻟﻧظــﺎم ﺑﺎﺳـــﺗﺧدام ﻟﻐــﺔ ، ﺗــم اﺳـــﺗﺧارج MySQL اﻟﺗﻘﺎرﯾر ﻣن اﻟﻧظﺎم وﺗم ﺗﺣﻠﯾل اﻟﺗﻘﺎرﯾر وﺟدت اﻟﺑﺎﺣﺛـﺔ أن اﻟﻣﻌـدل اﻟزﻣﻧـﻲ ﻟﺧوارزﻣﯾـﺔ ﻫـــو أﻗـــل ﻣﻌـــدل زﻣﻧـــﻲ ﻣﻣـــﺎ ﯾـــدل ﻋﻠـــﻰ ﺳـــرﻋﺔ اﻟﺧوارزﻣﯾـــﺔ ﻣﻘﺎرﻧـــﺔ Boyer Moore . ﻛﻣـﺎ وﺟـدت اﻟﺑﺎﺣﺛـﺔ أﻧـﻪ اذا ﻛﺎﻧـت اﻻﺑﺟدﯾـﺔ Naïve & KMP ﺑـﺎﻟﺧوارزﻣﯾﺗﯾن ﻻﻧﻬـــﺎ ﺗﺗﻣﯾـــز ﻋﻠـــﻰ ﺧوارزﻣﯾـــﺔ KMP ﻛﺑﯾـــرة ﺟـــداً ﻣـــن اﻻﻓﺿـــل اﺳـــﺗﺧدام ﺧوارزﻣﯾـــﺔ . ﺑﻌدم اﻋﺗﻣﺎدﻫﺎ ﻋﻠﻰ ﺣﺟم اﻻﺑﺟدﯾﺔ اﻟﻣﺳﺗﺧدﻣﺔ Boyer Moore 7 Abstract : The field of information retrieval (Information Retrieval) a remarkable development in recent decades as a result of the rapid growth of the network site and users need urgent to search the vast amount of digital information, which, so it became necessary to find Recovery Systems information to help users get the information they want from This vast amount of text quickly enough. This research aims to find the fastest and most efficient algorithms matching texts that can be used to search in text editors and search engines on the Internet, by comparing algorithms matching texts that rely on strategy attack brute force Brute Force and those that rely on a strategy of divide and conquer Divide & conquer, which helps to reduce the time it takes to search. The comparison using different lengths of the text you want to search for (3, 4, 5 characters), with volumes varying data (number of rows of the database 10, row 16). Was building a system to compare the three algorithms matching texts are algorithm Naive Algorithm and algorithm KMP Algorithm and depend on the search method sequential that follow a strategy attack brute force and algorithm Boyer-Moore Algorithm, which tracks how binary search, which depends on the strategy of divide and conquer, has been building the system using PHP language and MySQL database, reports were extracted from the system reports were analyzed and the researcher reached the following conclusions: Researcher found that average time for Boyer Moore algorithm is the lowest rate schedule which indicates the speed of the algorithm compared Naïve & KMP. Researcher has found that if a very large alphabet better use KMP algorithm because it is characterized by the Boyer Moore algorithm not dependent on the size of the alphabet used.