{"title":"减少计算时间以加快数据库搜索过程","authors":"Talal Bonny, B. Soudan","doi":"10.1109/ISMVL.2015.24","DOIUrl":null,"url":null,"abstract":"Computation time is one of the major concerns in database sequence applications such as searching process. These kinds of applications need to process many sequences and as result, consume much computation time. The mean and standard deviation of the different codes in each sequence of the database are parameters which may be used for searching process. We introduce a novel and efficient technique which computes these parameters for each sequence of the database off-line (i.e. design time). Each time a new sequence is required to be searched in the database on-line (i.e. run time), these parameter are used for comparison. Using our technique, we explicitly accelerate the database sequence searching by 35% in comparison to the traditional known methods.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computation Time Reduction to Speed-up the Database Searching Process\",\"authors\":\"Talal Bonny, B. Soudan\",\"doi\":\"10.1109/ISMVL.2015.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computation time is one of the major concerns in database sequence applications such as searching process. These kinds of applications need to process many sequences and as result, consume much computation time. The mean and standard deviation of the different codes in each sequence of the database are parameters which may be used for searching process. We introduce a novel and efficient technique which computes these parameters for each sequence of the database off-line (i.e. design time). Each time a new sequence is required to be searched in the database on-line (i.e. run time), these parameter are used for comparison. Using our technique, we explicitly accelerate the database sequence searching by 35% in comparison to the traditional known methods.\",\"PeriodicalId\":118417,\"journal\":{\"name\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2015.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2015.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computation Time Reduction to Speed-up the Database Searching Process
Computation time is one of the major concerns in database sequence applications such as searching process. These kinds of applications need to process many sequences and as result, consume much computation time. The mean and standard deviation of the different codes in each sequence of the database are parameters which may be used for searching process. We introduce a novel and efficient technique which computes these parameters for each sequence of the database off-line (i.e. design time). Each time a new sequence is required to be searched in the database on-line (i.e. run time), these parameter are used for comparison. Using our technique, we explicitly accelerate the database sequence searching by 35% in comparison to the traditional known methods.