ì´ë¬í ê³¼ì 를 í´ê²°í기 ìí ì´ ë°ëª ì íëì í¹ì§ì ë°ë¥¸ ì¸í°ë·ì íµí íì¼ ê²ì ìë¹ì¤ ìì¤í ì,File retrieval service system through the Internet according to one feature of the present invention for solving this problem,
ì¸í°ë·ìì ìë£ë¤ì íì¼ë³ë¡ ì¸ë¶ííì¬ ì ì¥íê³ ìë ì ë³´ ë°ì´í°ë² ì´ì¤;An information database storing data on the Internet by file;
ì¸í°ë·ì ì¡´ì¬íë ì¬ì´í¸ë¤ì ê²ìíì¬ íì¼ìë£ë¥¼ ì¶ì¶íê³ , ì¶ì¶ë íì¼ìë£ë¥¼ ë¶ë¥íì¬ ì기 ì ë³´ ë°ì´í°ë² ì´ì¤ì ì ì¥íë íì¼ê²ìë¡ë´;A file search robot that searches for sites existing on the Internet, extracts file data, classifies the extracted file data, and stores the extracted file data in the information database;
ì¬ì©ìê° ì¸í°ë·ì íµí´ ì ìì íì¬ ìíë íì¼ì ëí ê²ìì¡°ê±´ì ì ë ¥íë©´, ì기 ê²ìì¡°ê±´ì ë°ë¼ ì기 ì ë³´ ë°ì´í°ë² ì´ì¤ë¥¼ ê²ìíê³ , ê²ì결과를 ì ê³µíë ê²ì ìì¤í ì í¬í¨íë¤.When a user connects via the Internet and inputs a search condition for a desired file, the search system includes a search system that searches the information database according to the search condition and provides a search result.
ì´ë¬í ê³¼ì 를 í´ê²°í기 ìí ì´ ë°ëª ì ë¤ë¥¸ í¹ì§ì ë°ë¥¸ ì¸í°ë·ì íµí ê²ì ìë¹ì¤ ë°©ë²ì,Search service method through the Internet according to another feature of the present invention for solving this problem,
ì¬ì©ìê° ë¤í¸ìí¬ë¥¼ íµí´ ì ìì íì¬ ìíë íì¼ì ëí ê²ìì¡°ê±´ì ì ë ¥íë ë¨ê³;Inputting a search condition for a desired file by a user connecting through a network;
ì기 ê²ìì¡°ê±´ì ë°ë¼ ì ë³´ ë°ì´í°ë² ì´ì¤ë¥¼ íì¼ ë¨ìë¡ ê²ìíê³ , ê²ì결과를 ì ê³µíë ë¨ê³ë¥¼ í¬í¨íë¤.Searching the information database on a file basis according to the search condition and providing a search result.
ê·¸ë¬ë©´, 첨ë¶ë ëë©´ì ì°¸ì¡°ë¡ íì¬ ë³¸ ë°ëª ì ì¤ìì를 ìì¸í ì¤ëª íê¸°ë¡ íë¤.Next, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
ë1ì ì´ ë°ëª ì ì¤ììì ë°ë¥¸ ì¸í°ë·ì íµí íì¼ ê²ì ìë¹ì¤ ìì¤í ì 구ì±ëì´ë¤.1 is a block diagram of a file retrieval service system through the Internet according to an embodiment of the present invention.
ë1ììì ê°ì´, ì´ ë°ëª ì ì¤ììì ë°ë¥¸ ì¸í°ë·ì íµí íì¼ ê²ì ìë¹ì¤ ìì¤í ì,As shown in Figure 1, the file search service system through the Internet according to an embodiment of the present invention,
ì¬ì©ìì ì»´í¨í°(10);User's computer 10;
í´ë¹ ê°ì ìì ëí ì 보를 ì ì¥íê³ ìë ê°ì ì ë°ì´í°ë² ì´ì¤(60);A subscriber database 60 that stores information about the subscriber;
ì¸í°ë·ì ì¡´ì¬íë íì¼ ì ë³´ë¤ì ì ì¥íê³ ìë ì ë³´ ë°ì´í°ë² ì´ì¤(60);An information database 60 that stores file information existing on the Internet;
ì¬ì©ìê° ì¸í°ë·ì íµí´ ì ìì íë©´, ííì´ì§(80)를 ì ê³µíë ì¹ ìë²(72);A web server 72 providing a homepage 80 when the user connects via the Internet;
ì¹ ìì 모ë ì¬ì´í¸ë¥¼ ê²ìíì¬ ê°ê°ì íì¼ ì 보를 ë°ì´í°ë² ì´ì¤ííë íì¼ ê²ìë¡ë´(74);A file search robot 74 which searches all sites on the web and databases each file information;
ì기 íì¼ ê²ìë¡ë´(74)ì´ ê²ìíì¬ êµ¬ì¶í ì ë³´ ë°ì´í°ë² ì´ì¤(60)ì ê°ê°ì ì ë³´ì ì ìíì¬ ì ììë¬ê° íì©íì ì´ì ë°ìíë©´ í´ë¹ ì 보를 ìì íë íì¼ ë³´ì ë¡ë´(71);A file correction robot (71) for accessing each information in the information database (60) searched and constructed by the file search robot (74) and deleting the corresponding information when a connection error occurs more than the allowed number of times;
ì¬ì©ìê° ì¸í°ë·ì íµí´ ì ìì íì¬ ê²ìì ìíë íì¼ì ì¡°ê±´ì ì ë ¥íë©´, ì íë ê²ìì¡°ê±´ì ë°ë¼ ì기 ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ê²ìíê³ ê·¸ 결과를 ì ê³µíë íì¼ê²ììì§(73)ì í¬í¨íë¤.When a user connects via the Internet and inputs a condition of a file to be searched, it includes a file search engine 73 for searching the information database 60 according to the selected search condition and providing the result.
ì기í ì¬ì©ì ì»´í¨í°(10)ë,The user computer 10 described above,
ì¹ ë¸ë¼ì°ì ¸ ë° ë¤ì¤ ì ì íë¡ê·¸ë¨ì ë´ì¥íë íë ëì¤í¬ ëë¼ì´ë¸(HDD, 19),Hard disk drive (HDD, 19) with built-in web browser and multiple access programs,
ì기 íë ëì¤í¬ ëë¼ì´ë¸(HDD, 19)ì ì¹ ë¸ë¼ì°ì ¸ ë° ë¤ì¤ ì ì íë¡ê·¸ë¨ì ë©ëª¨ë¦¬(9)ë¡ ì½ì´ ì¤ííë©°, ì¸í°ë·ì ì ìì ì¸ë¶ì ë¤ë¥¸ ì»´í¨í°ì ëìì ì ìíê³ ì 보를 ê³µì íëë¡ ì ì´íë ì¤ìì²ë¦¬ì¥ì¹(12),The central processing unit 12 that reads and executes the web browser and the multiple access program of the hard disk drive (HDD) 19 into the memory 9 and controls the simultaneous access and sharing of information with other external computers when accessing the Internet. ,
ì기 ì¤ìì²ë¦¬ì¥ì¹(12)ì ì¡ìì ë°ì´í°ë¥¼ ë³ë³µì¡°íë 모ë(14),Modem 14 for demodulating the transmission and reception data of the central processing unit 12,
ëì¤íë ì´ ì»¨í¸ë¡¤ë¬(13), ëì¤íë ì´(11, ìì¤í ë²ì¤(15), í¤ë³´ë(18) ë° ë§ì°ì¤(17)를 í¬í¨íë¤.It includes a display controller 13, a display 11, a system bus 15, a keyboard 18, and a mouse 17.
ì기í ì»´í¨í°(10)ë ì¬ì¤íµì ë§(20) ë° ì¹ ì§ììë²(40)를 íµí´ ì¸í°ë·ë§ì ì ìíë©°, ì´ì¸ìë ìì²´ìë²ë¡ ì¸í°ë·ë§(30)ì ì ìí ìë ìë¤.The computer 10 is connected to the Internet network through the private communication network 20 and the web support server 40, in addition to the Internet network 30 may be connected to its own server.
ê·¸ë¬ë©´, ì´ë¬í 구ì±ì ê°ì§ ì¸í°ë·ì íµí ë©í° ê²ì ìì¤í ì ëìì ë1 ë´ì§ ë11ì ì°¸ì¡°ë¡ íì¬ ì¤ëª íê¸°ë¡ íë¤.Next, the operation of the multi-search system via the Internet having such a configuration will be described with reference to FIGS. 1 to 11.
ë2ë ì´ ë°ëª ì ì¤ììì ë°ë¥¸ ì¸í°ë·ì íµí ê²ì ìë¹ì¤ ë°©ë²ì ëì íë¦ëì´ë¤.2 is an operation flowchart of a search service method through the Internet according to an embodiment of the present invention.
먼ì , ê°ì ìë ì»´í¨í°(10)를 ë¶í íê³ ì¹ ë¸ë¼ì°ì ¸ íë¡ê·¸ë¨ì ë¡ë©íë¤.First, the subscriber boots up the computer 10 and loads a web browser program.
ì´ ìíìì ì»´í¨í°(10) ì¬ì©ìê° ë§ì°ì¤(17) ëë í¤ë³´ë(18)를 ì´ì©íì¬ ì¬ì ììê² ì ìíë¤(S201).In this state, the user of the computer 10 connects to the business operator using the mouse 17 or the keyboard 18 (S201).
ê·¸ë¬ë©´, ì¤ìì²ë¦¬ì¥ì¹(12)ë í´ë¹ IP주ìë¡ ëª¨ë(14) ë° ì¸í°ë·ë§(30)ì íµí´ ì¬ì ìì ì¹ ìë²(71)ì ì°ê²°ëë¤.Then, the central processing unit 12 is connected to the operator's web server 71 through the modem 14 and the Internet network 30 to the corresponding IP address.
ê·¸ë¬ë©´, ì¹ ìë²(71)ë ííì´ì§(80)를 ì ê³µíë©°, ì¬ì©ìì ì»´í¨í°(10) ëì¤íë ì´(11)ìë í´ë¹ ì¬ì ìì ííì´ì§(80)ê° ëì¤íë ì´ëë¤(S21).Then, the web server 71 provides the homepage 80, and the homepage 80 of the corresponding operator is displayed on the display 11 of the user's computer 10 (S21).
í´ë¹ ííì´ì§ìì ì¬ì©ìê° ê°ì¸ ìì´ë ë° ë¹ë°ë²í¸ë¥¼ ì ë ¥íë©´, ì¹ ìë²(71)ë ì¬ì©ìê° ì ë ¥í ìì´ë ë° ë¹ë°ë²í¸ê° ì¼ì¹íëì§ ê°ì ì ë°ì´í°ë² ì´ì¤(50)를 ê²ìíì¬ íì¸íë¤. ì´í, ì¬ì©ìì ì¹ ìë²(72)ê°ì ë°ì´í° íµì ì ê´í ê³¼ì ì ì´ ë¶ì¼ìì ë리 ìë ¤ì§ ê¸°ì ì´ë¯ë¡ ìì¸í ì¤ëª ì íí¼íë¤.When a user enters a personal ID and password on the home page, the web server 71 searches and checks the subscriber database 50 to see if the ID and password entered by the user match. Since the process of data communication between the user and the web server 72 is well known in the art, a detailed description thereof will be avoided.
ì¬ì©ìê° ì ë¹í ê°ì ìê° ìëë©´, íìì¼ë¡ ë±ë¡ì íê±°ë ê²ì¤í¸(Guest)ë¡ íì ë ë²ììì ìë¹ì¤ë¥¼ ì´ì©íê² íê³ , ì ë¹í ê°ì ìì´ë©´, ííì´ì§ì ì´ê¸°íë©´ì ëíëë ê²ìì°½ì ì´ì©íì¬ ê²ìì í ì ìëë¡ íë¤. ë¬¼ë¡ íìê°ì ì¬ë¶ì ë°ë¼ 모ë ìë¹ì¤ë¥¼ ì ê³µí ìë ìë¤.If the user is not a legitimate subscriber, the user can register as a member or use the service in a limited range to a guest, and if the user is a legitimate subscriber, the user can search by using a search box displayed on the initial screen of the homepage. Of course, you can provide all the services depending on the membership.
ë¤ì, ì¬ì©ìê° ìì ì ëì¤íë ì´(11)를 ë³´ë©´ì ê²ìì¡°ê±´ì ì ë ¥íê³ , ê²ìì ì ííë¤(S22). ì´ë ì ë ¥íë ê²ìì¡°ê±´ì ë3ì ëíë´ìë¤.Next, the user enters a search condition while looking at his display 11 and selects a search (S22). 3 shows a search condition to be input at this time.
ë3ììì ê°ì´, ì¬ì©ìë íì¼ì ì¢ ë¥ë¥¼ ì ííê³ , ìíë ê²ìì´ë¥¼ ì ë ¥íë©´ í´ë¹ ê²ìì´ì í´ë¹íë íì¼ë¤ì´ ê²ìëë¤.As shown in FIG. 3, when a user selects a file type and inputs a desired search word, files corresponding to the search word are searched.
ê·¸ë¬ë©´, íì¼ ê²ì ìì§(73)ì ì¬ì©ìê° ì ë ¥í ê²ìì´ì í´ë¹ íì¼ì ì ë³´ ë°ì´í°ë² ì´ì¤(60)ìì ê²ìíê³ (S23, S24), ê·¸ 결과를 ì¬ì©ììê² ì ê³µíë¤(S25)Then, the file search engine 73 searches for the corresponding file of the search word input by the user in the information database 60 (S23, S24), and provides the result to the user (S25).
ì´í, ì¬ì©ìê° ì²ë¦¬ 결과를 ë³´ê³ ìíë ì¬í ì¦, íì¼ì ë¤ì´ë¡ë를 ì ííë©´(S26), íì¼ ê²ì ìì§(73)ì í´ë¹ íì¼ì ì¬ì©ììê² ì¡ì íë©°(S27), ì¬ì©ìê° í´ë¹ íì¼ì ì¬ì´í¸ë¡ ì´ëì ì ííë©´, ì¬ì©ì ì»´í¨í°ì ì¹ ë¸ë¼ì°ì ¸ê° í´ë¹ ì¬ì´í¸ë¡ ì ìì íê² ëë¤(S28).Subsequently, when the user views the processing result and selects the desired download, that is, the file (S26), the file search engine 73 sends the file to the user (S27), and the user selects the move to the site of the file. Then, the web browser of the user computer is connected to the site (S28).
ì기í ì ë³´ ë°ì´í°ë² ì´ì¤(60)ë íì¼ê²ì ë¡ë´(74)ì ìí´ ë§ë¤ì´ì§ê³ ì ë°ì´í¸ ëëë° ì´ë¥¼ ìì¸í ì¤ëª íë©´ ë¤ìê³¼ ê°ë¤.The information database 60 is created and updated by the file search robot 74, which will be described in detail as follows.
ë4ë íì¼ê²ìë¡ë´ì ì ë³´ ë°ì´í°ë² ì´ì¤ 구ì¶ì ìí ëì íë¦ëì´ë¤.4 is an operation flowchart for building an information database of a file search robot.
ë4ììì ê°ì´, íì¼ê²ì ë¡ë´(74)ì í¹ì ì¬ì´í¸ë¥¼ ì¶ë°ì ì¼ë¡ íë ë°©ë²(S41)ê³¼ í¹ì ê²ììì§ìì ì¶ì¶ë ì¬ì´í¸ë¥¼ 그룹ì¼ë¡ ê²ìíì¬ ì¶ë°ì ì¼ë¡ ììíë ë°©ë²(S42, S43)ì´ ìëë°, ì´ë ì¬ì ìê° ì íí ì ìì¼ë©°, ì´ë ë°©ë²ì´ë ì¸ë¶ë¡ ë§í¬ë ì¬ì´í¸ê° ìì¼ë©´, ì´ë¥¼ ì ë³´ ë°ì´í°ë² ì´ì¤(60)ì ì¤ë³µëì§ ìê² ì ì¥íë¤(S44).As shown in FIG. 4, the file search robot 74 has a method of starting a specific site (S41) and a method of starting a starting point by searching sites extracted from a specific search engine as a group (S42, S43). The operator can choose, and if there is a site linked to any way, it is stored in the information database 60 not to be duplicated (S44).
ì´ë¤ ì¬ì´í¸ë¥¼ ëìì¼ë¡ ë´ë¶ë¬¸ìë¡ ë¶ë¥ëë HTMLì ë¶ìíì¬(S45, 46) íì¼ë¡ íë¨ëë 모ë ì 보를 ì ë³´ ë°ì´í°ë² ì´ì¤ ë´ì ì ì¥íë¤(S47).The HTML classified as an internal document is analyzed for these sites (S45, 46), and all information determined as a file is stored in the information database (S47).
ì´ ê³¼ì ì ì¸ë¶ ì¬ì´í¸ê° ìì ëê¹ì§ ë°ë³µíë¤(S48).This process is repeated until there is no external site (S48).
ì´ë, íì¼ê²ìë¡ë´(74)ì ì ì´í기 ìí ê²ììµì ë° ê²ìë°©ë²ì ì ííë íë©´ì ë5ì ëìíìë¤.At this time, a screen for selecting a search option and a search method for controlling the file search robot 74 is shown in FIG.
ë5ììì ê°ì´, ì§ì ë ì¬ì´í¸ë¥¼ ìì ì¼ë¡ ì¤ì íê³ ì´ê³³ììë¶í° íìëë ì¸ë¶ ì¬ì´í¸ ë° íì¼ì ì°¾ìëê°ë ë°©ìì´ê³ , Yahooê²ììì ì ë ¥ë ê²ìì´ë¥¼ ì¼íìì ê²ìíì¬ ì»ì ííì´ì§ 목ë¡ì ëìì¼ë¡ íì¼ì ê²ìíë ë°©ë²ì´ë¤.As shown in FIG. 5, a method of setting a designated site as a starting point and searching for external sites and files derived therefrom is a method of searching a file from a homepage list obtained by searching a search term input from a Yahoo search on Yahoo. .
ë6ì íì¼ê²ìë¡ë´ì´ ê²ìíë ¤ë ëìíì¼ì ëíë´ë ëë©´ì´ë¤.6 is a diagram illustrating a target file to be searched by the file search robot.
ë6ììì ê°ì´, íì¼ê²ìë¡ë´(74)ì´ ê²ìíë íì¼ì MP3íì¼, ì´ë¯¸ì§ íì¼, ì¬ì´ë íì¼, ëìì íì¼, ì¤ííì¼, ìì¶íì¼, 문ìíì¼, ê·¸ì¸ ê¸°íë¶ë¥ë¡ ëëì´ì§ë©°, ê° ê·¸ë£¹ë§ë¤ íì¼ì íì¥ì 목ì ì´ ì§ì ëì´ ìê³ , ìëì ëë©´ì ì´ë¯¸ì§ íì¼ ê·¸ë£¹ì ì ííì ë ëíëë ì´ë¯¸ì§ ê´ë ¨ íì¼ë¤ì íì¥ëª ì´ë©°, ì´ëë¤ìí ë³íì´ë ì¶ê° ìì ê° ë ì ìë¤.As shown in FIG. 6, files searched by the file search robot 74 are divided into MP3 files, image files, sound files, video files, executable files, compressed files, document files, and other classifications. The purpose of the extension is specified, and the figure below is the extension of image-related files appearing when an image file group is selected, which may be variously modified or additionally deleted.
ë7ì ííì´ì§ ë´ë¶ ì¬ì´í¸ë¥¼ ê²ìíë ìí를 ë³´ì¸ ëë©´ì´ë¤.7 is a diagram illustrating a state in which a homepage internal site is searched.
ë7ììì ê°ì´, ííì´ì§ ë´ë¶ ì¬ì´í¸ë¥¼ ê²ìíë ìíê° ëìëë©°, ê²ìì¤ì ì¸ë¶ 문ìê° ë°ê²¬ëë©´ ìì¼ë¡ ê²ìí´ì¼í ííì´ì§ ì¬ì´í¸ë¡ ëì ìí¨ë¤.As shown in Fig. 7, the state of searching the internal site of the homepage is shown, and if an external document is found during the search, it accumulates to the homepage site to be searched in the future.
ë8ì íì¼ ë³´ì ë¡ë´ì ì ë³´ ë°ì´í°ë² ì´ì¤ ë³´ì ë°©ë²ì ëì íë¦ëì´ë¤.8 is an operation flowchart of an information database correction method of a file correction robot.
ë8ììì ê°ì´, íì¼ ë³´ì ë¡ë´(71)ì íì¼ ê²ì ë¡ë´(74)ìì ê²ìë ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ì°¨ë¡ëë¡ ì ìíì¬(S81), ì ìê²°ê³¼(S82)ê° íì©íìë§í¼ ì´ì ìë¬ê° ë°ìíë©´(S83, S84) ì´ ìë£ë ìë ê²ì¼ë¡ íë¨íì¬ íì¼ì ìì íë¤(S85).As shown in Fig. 8, the file correction robot 71 sequentially connects the information database 60 retrieved from the file retrieval robot 74 (S81), and if the connection result S82 has an error more than the allowable number of times ( S83, S84) It is determined that this data does not exist and the file is deleted (S85).
ì´í, ë¤ì íì¼ URLì ëí´ìë ê°ì ë°©ìì¼ë¡ ì§ííë©°(S86, S87) ì ì²´ íì¼ì 보를 ë¤ ì ìí íì ìë£ë¥¼ íë¤.Subsequently, the next file URL proceeds in the same manner (S86, S87) and completes after accessing all the file information.
ë9ë íì¼ë³´ì ë¡ë´(71)ì ì¤ì¼ì¥´ë§ì ì¤ì í기 ìí íë©´ì ëíë¸ ëë©´ì¼ë¡ì ì¬ì ìê° ììë¡ ì¤ì í ì ìë¤.FIG. 9 is a diagram showing a screen for setting the scheduling of the file correction robot 71, which can be arbitrarily set by the operator.
ë10ì ê²ìë íì¼ìë£ë¥¼ ìì íë ìì를 ë³´ì¸ ëë©´ì¼ë¡ì, ê²ìë íì¼ ìë£ìì unlink를 ìëì¼ë¡ ê²ìíê³ , ê²ìë íì를 ì²´í¬íì¬ ìµì ì ì¤ì ë íìë§í¼ ë°ê²¬ëë©´ ìëì¼ë¡ ìì ìí¨ë¤.FIG. 10 is a diagram illustrating an example of deleting a searched file data. The unlink is automatically searched in the searched file data, and the number of times of the search is checked to automatically delete the number of times set by the option.
ë11ì ìì°ì´ë¥¼ ê²ìíë ë°©ë²ì ëìíë¦ëì´ë¤.11 is a flowchart illustrating a method of searching for a natural language.
ë11ììì ê°ì´, ì¬ì©ìê° ê²ìì´ë¥¼ 문ì¥ì¼ë¡ ì ë ¥íë©´, íì¼ ê²ì ìì§(73)ì ì¬ì©ìê° ì ë ¥í ê²ìì´ì íì¼ëª ìì 모ëAì ë°©ë²ì¼ë¡ ê²ìì íë¤.As shown in Fig. 11, when a user inputs a search word as a sentence, the file search engine 73 searches by the method of module A in the file name of the search word input by the user.
ì¦, ì ì²´ ê²ìì´ë¡ ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ê²ìíê³ (S111), ë¨ì´ë³ë¡ ë¶ë¦¬ë ê²ìì´ë¡ ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ê²ìíë©°(S112), ê·¸ ë¤ì, ë¨ì´ë³ë¡ ì¡°ì¬ ë° ì´ë¯¸ê° ìëµë ê²ìì´ë¡ ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ê²ìíë©°, ë§ì§ë§ì¼ë¡ ë¨ì´ë³ë¡ ì¡°ì¬ ë° ì´ë¯¸ê° ìëµë ê²ìì´ì ëìì´/ì ìì´ë¡ ì ë³´ ë°ì´í°ë² ì´ì¤(60)를 ê²ìíë¤.That is, the information database 60 is searched by the entire search word (S111), the information database 60 is searched by the search terms separated by words (S112), and then the information database is searched and searched by words. (60), and finally, the information database 60 is searched as a synonym / synonym of the search word and the ending of the search word by word.
ë¤ì, íì¼ ì¤ëª ìì 모ëAì ë°©ë²ì¼ë¡ ê²ìì ì¤ìíë©°(S120), ì´í, ì ì²´ í ì¤í¸ìì 모ëAì ë°©ë²ì¼ë¡ ê²ìì ì¤ìíë¤.(S130)Next, a search is performed by the method of Module A in the file description (S120), and then a search is performed by the method of Module A in the full text (S130).
ì기í ê³¼ì ì 본 ë°ëª ì ì¤ììë ë¤ìí ë³íì´ ê°ë¥íë©°, ì¬ë¬ ê°ì§ ë°©ë²ì¼ë¡ ê²ì ì¡°ê±´ì ë³íí ì ìì¼ë©°, íìì ë°ë¼ìë ì¬ì©ìê° ì¡°ê±´ì ë³ê²½íëë¡ í ìë ìë¤.Embodiments of the present invention of the above process can be various modifications, it is possible to modify the search conditions in various ways, and to allow the user to change the conditions as needed.
ì기í ì¹ ìë²(71), ê²ììì§(73), íì¼ ê²ì ë¡ë´(74) ë±ì ë¹ë¡¯í 구ì±ììë¤ì íëì¨ì´ì ëë ìíí¸ì¨ì´ì ì¼ë¡ 모ë 구í ê°ë¥íë¤.The components including the web server 71, the search engine 73, the file search robot 74, and the like may be implemented in hardware or software.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4