{"title":"利用迭代深化搜索和图论解决有效的隐藏网络搜索","authors":"A. Ibrahim, S.A. Fahmi, S. I. Hashmi, Ho‐Jin Choi","doi":"10.1109/CIT.2008.WORKSHOPS.81","DOIUrl":null,"url":null,"abstract":"Deep web refers to the hidden portion of the WWW (World Wide Web) which cannot be accessed directly. One of the important issues in the WWW is how to search the hidden Web. Several techniques have been proposed in order to address this issue. In this paper, we have surveyed the current problems of retrieving information from hidden Web and proposed a solution to solve these problems using probability, iterative deepening search and graph theory.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Addressing Effective Hidden Web Search Using Iterative Deepening Search and Graph Theory\",\"authors\":\"A. Ibrahim, S.A. Fahmi, S. I. Hashmi, Ho‐Jin Choi\",\"doi\":\"10.1109/CIT.2008.WORKSHOPS.81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Deep web refers to the hidden portion of the WWW (World Wide Web) which cannot be accessed directly. One of the important issues in the WWW is how to search the hidden Web. Several techniques have been proposed in order to address this issue. In this paper, we have surveyed the current problems of retrieving information from hidden Web and proposed a solution to solve these problems using probability, iterative deepening search and graph theory.\",\"PeriodicalId\":155998,\"journal\":{\"name\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIT.2008.WORKSHOPS.81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Addressing Effective Hidden Web Search Using Iterative Deepening Search and Graph Theory
Deep web refers to the hidden portion of the WWW (World Wide Web) which cannot be accessed directly. One of the important issues in the WWW is how to search the hidden Web. Several techniques have been proposed in order to address this issue. In this paper, we have surveyed the current problems of retrieving information from hidden Web and proposed a solution to solve these problems using probability, iterative deepening search and graph theory.