KR20070067056A - Data retrieval method and system using cover data - Google Patents

Abstract

The present invention relates to a data retrieval method and system, and a data retrieval system according to an embodiment of the present invention includes a cover data retrieval device for retrieving at least one or more cover data corresponding to a keyword input from a user. And a neighbor data search module that provides a search result for at least one or more data accessed before and after the last access time of the selected cover data among the at least one or more label data.

Description

Data search method and system using cover data {METHOD AND SYSTEM FOR SEACHING DATA BY USING CLUE DATA}

1 is a block diagram showing the configuration of a data retrieval system according to an embodiment of the present invention;

2 illustrates a database according to an embodiment of the present invention.

3 illustrates a database according to another embodiment of the present invention.

FIG. 4 is a diagram of a screen outputting cover data corresponding to a keyword input from a user in the data retrieval system of the present invention. FIG.

5 illustrates a database according to another embodiment of the present invention.

6 illustrates an embodiment of assigning an incremented data identifier to data accessed in accordance with the present invention.

7 is a flowchart illustrating a process of providing a data search result according to an embodiment of the present invention.

8 is a diagram illustrating a screen for providing a neighbor data search result according to an embodiment of the present invention.

<Explanation of symbols for the main parts of the drawings>

101: cover data search module

102: neighbor data search module

103: database

104: real-time indexer

105: early-stage indexer

The present invention relates to a data retrieval method and system, and more particularly, to search for cover data corresponding to a keyword input from a user, and to search for one or more data accessed before and after the last time that the selected cover data is accessed. The present invention relates to a data retrieval method and system.

Today, with the development of the Internet, web search services are becoming more common to effectively manage vast amounts of data on the Internet. The web search service automatically tracks the hypertext structure of the web using a web robot to recursively search the referenced documents and index the searched documents. A user can access a web search service site through the Internet and enter a keyword to search for information such as a web document desired by the user in an indexed database.

In addition, the storage space of personal computers such as desktops and notebooks is greatly increased, and files containing a large number of documents, pictures, mails, instant messages, videos, or music are stored on the desktops or laptops. Storage in storage has created the need for local computer searches not only for web searches but also for data in desktops and laptops.

For example, if a user of a desktop computer writes a review about a movie "Ireland" using a word processor, and a few years later, to find an "Ireland" review somewhere stored on his computer, the directory and file name where the file is stored must be You must remember. However, it is virtually impossible to remember the directory and file name for all documents and the like.

Even if you don't remember the directory where you saved the file, if you know the file name or the string included in the file content, you can find the file you want by using the file search function provided by the operating system (OS). However, the file search capability provided by the operating system does not use the indexing function, and thus searches for information in the user's computer, which takes a long time and increases the storage space of the computer such as a hard disk. As the number of files increases, this inconvenience has increased.

To alleviate this inconvenience, a "desktop search" service has been introduced. The "desktop search" service searches for information in the user's computer related to the entered keyword when the user enters the keyword through the deskbar, toolbar or web browser window. Desktop Search makes it easy to find what you're looking for by searching for information on your computer, saving you the hassle of manually organizing your files, emails, and favorites.

However, the existing "desktop search" service only provides keyword search results in the user's computer, and does not provide data search results according to the user's access order. That is, if you can't remember the file name, storage location, and related keywords for a file you've worked with, but remember keywords for document data you've used at the time you worked on the file, the existing "Desktop Search" service Has a problem that does not provide a search result for the data to find.

For example, if a user changes the data in "Tomorrow To Do", visits the web page of "Naver-Kim Hye-Soo Now," reads the article, and then clicks on the "Naver-Han's Fan Cafe" web page. I visited, and I liked "Han-in" but I don't know who I am, so I may not remember my name. In this case, according to the prior art, there is no way to find "Naver-Han-ga-in's fan cafe" if the user does not remember the name of "han-ga-in" or "contents related to the han-ga-in".

In fact, when a large number of users access certain data or visit a web page, when the data or the content of the web page is new content that is not encountered, the time before and after the data or the web is accessed rather than remembering it correctly. In many cases, the data accessed in the time before and after visiting the page or the contents included in the visited web page are often stored. According to the related art, there is a problem in that a user cannot provide a search result for new data that the user cannot remember.

That is, if the user has accessed data in the past, but cannot remember any search words related to the data, but knows a search method for other data accessed before and after the time of access to the data, No way has been presented to retrieve the data.

According to the present invention, when the user accesses the data or visits the web page, the data or the content of the web page is new content that the user cannot remember and visits the web page or the time before and after accessing the data. It is an object of the present invention to provide a data retrieval method and system that can provide a search result by accurately searching for data that a user wants to search even if the data included in the web page or the visited web page is accessed. .

The present invention stores a keyword corresponding to the data stored in the user terminal and the address of the web page visited by the user, a data retrieval method that can search the cover data by searching the stored data and the keywords included in the web page address at the same time and It is another object to provide a system.

Another object of the present invention is to provide a data retrieval method and system capable of indexing data and web pages accessed by a user in order while using a minimum memory.

In addition, the present invention provides a data identifier increased in the crawl order for the data stored in the user terminal and stored in the database, and an increased data identifier is assigned to the data accessed after the end of the index operation in real time index Another object of the present invention is to provide a data retrieval method and system capable of providing the data retrieval result before and after the final access time of the real-time accessed data as well as the data stored in the user terminal.

In order to achieve the above object and to solve the above-mentioned problems of the prior art, the data retrieval system according to an embodiment of the present invention is a cover for retrieving at least one or more cover data corresponding to the keyword input from the user And a neighboring data search module for providing a search result for at least one or more data accessed before and after the last access time of the selected label data among the searched at least one label data.

Further, according to another embodiment of the present invention, a method for providing a data search result to a user includes: searching for at least one cover data corresponding to a keyword input from the user; Providing search results for at least one or more data accessed before and after the last access time of the selected marker data.

Hereinafter, a data retrieval method and system according to the present invention will be described in detail with reference to the accompanying drawings.

1 is a block diagram showing the configuration of a data retrieval system according to an embodiment of the present invention. Referring to FIG. 1, a search system according to the present invention includes a cover data searcher 101, a neighbor data searcher 102, a database 103, a real-time indexer 104, and an initial indexer 105.

The cover data searcher 101 searches for at least one cover data corresponding to the keyword input from the user. In the present invention, the cover data is data used to find target data to be searched by the user, and may be data stored in the user terminal or a web page visited by the user. Data stored in the user terminal includes all types of data used in the user terminal, such as document data, video data, image data, music data.

The user terminal of the present invention is a code division multiplexing access (CDMA) module, a Bluetooth module, an infrared communication module, such as a PC, a personal digital assistant (PDA), a smart phone, a handheld PC, a mobile phone, an MP3 player, and the like. (IrDA), a predetermined communication module such as a wired / wireless LAN card can be provided, and it is a concept to collectively refer to a terminal having a computing capability by mounting a predetermined microprocessor.

At this time, the cover data searcher 101 searches the cover data corresponding to the keyword input from the user with reference to the database 103, and the database stores the keyword corresponding to the data stored in the user terminal.

2 is a diagram illustrating a database according to an embodiment of the present invention. Referring to FIG. 2, a database stores a keyword 201 and corresponding data 202. The data may be data stored in a user terminal. At this time, the database may store the keyword 201 and the data 202 corresponding to the keyword as shown in FIG. 2, or may store data and a plurality of keywords included for each data.

The data retrieval system of the present invention analyzes the data stored in the user terminal, extracts a keyword included in the data, and stores data corresponding to the extracted keyword in a database. For example, "document 1" stored in the user terminal may include a keyword such as "summer vacation", and the database holds "document 1" as data corresponding to the keyword "summer vacation". If the data stored in the user terminal is moving image data, image data, or the like, keywords extracted from the file name may be stored in the database.

The cover data searcher 101 searches the cover data corresponding to the keyword input by the user in the database and provides a search result to the user. For example, when a user inputs "summer vacation" as a keyword, the cover data searcher 101 searches for "document 1" by referring to a database and outputs a search result to the user terminal.

According to an embodiment, the search result may include a file name of the searched data, location information in a user terminal, last access time information, and the like. The access time information may be information about a time when the user generates the data, a changed time, or a read time.

In addition, according to an embodiment, the database 103 stores the address of a web page visited by a user and a keyword corresponding to the web page.

3 is a diagram illustrating a database according to another embodiment of the present invention.

Referring to FIG. 3, the database of the present invention stores a keyword 301 and an address 302 of a web page corresponding to a web page that the user visited through web browsing in a user terminal.

When the user accesses a predetermined web page in the user terminal, the data retrieval system of the present invention stores the address 302 of the accessed web page in a database, analyzes the data contained in the web page, and extracts a keyword. In operation 301, the extracted keyword is stored in a database corresponding to the data.

For example, when a user visits a web page of "http://nextour.co.kr" through a user terminal, the keyword "summer vacation" may be extracted by analyzing data included in the web page.

The database is generated by storing the address of the web page and the keywords extracted by analyzing the data included in the web page. If there are keywords included in the plurality of web pages at the same time, the database may store the keyword 301 and the address 302 of the web page including the keywords.

The cover data searcher 101 searches the cover data corresponding to the keyword input from the user with reference to the database of FIG. 3. For example, when the keyword input from the user is "summer vacation", the cover data searcher 101 refers to the database of FIG. 3 and the web page address corresponding to the keyword "http://nextour.co.kr/". "And" http://www.naver.com "can be searched by the cover data.

4 is a view capturing a screen outputting cover data corresponding to a keyword input from a user in the data retrieval system of the present invention.

Referring to FIG. 4, when a user inputs a keyword into a search box 401 of a predetermined user interface and selects and inputs a search 402, the cover data searcher 101 searches a database to display cover data corresponding to the keyword. Print the search results.

For example, when a user inputs a keyword "summer vacation" into the search box 401, the cover data searcher 101 searches for and outputs cover data corresponding to the keyword by referring to a database.

As described above, the cover data may be data regarding the web page 403 and the data 404 stored in the user terminal. There may be a plurality of searched cover data, and in FIG. 4, searched cover data corresponding to the keyword "summer vacation" are two web pages and one document stored in the user terminal.

Therefore, since the present invention stores the data stored in the database and keywords corresponding to the address of the web page visited by the user, the cover data can be searched by simultaneously searching the stored data and the keywords included in the web page address.

The neighbor data search module 102 of FIG. 1 provides a search result for at least one data accessed before or after the last access time of the selected cover data among the at least one searched cover data. Access to the cover data may be creation, modification, or reading of the data if the cover data is data stored in the user terminal, and visitation of the web page if the cover data is a web page.

The user may select and input one cover data on the cover data search result output screen of FIG. 4, and the neighbor data searcher 102 generates and provides a search result for data accessed before and after the last access time of the selected cover data. do.

At least one or more data accessed before and after the last access time of the selected marker data is at least one or more data generated, changed, or read before and after the final time of creation time, change time, and read time for the selected marker data.

For example, in FIG. 4, when the user selects "Document 1" of the cover data, the neighbor data retriever 102 provides one or more data accessed before and after the time when the user last accessed the cover data. At this time, the last access time of the cover data is the last time of the user creating, modifying or reading the "document 1", and one or more data accessed before and after the last time is the last time the user accesses the "document 1". Data generated, changed, or read before and after the accessed time.

For example, if a user creates "Document 1" at "12:15 PM on August 3, 2005," and selects "Document 1" as cover data, the last access time of "Document 1" is "2005." 12:15 pm "on or before August 3" Search the generated, changed or read data and output the search results to the user. In addition, web pages visited before and after the time of generating, changing, or reading the document 1, which is the cover data, may be output as a search result to the user.

According to an embodiment, at least one or more web pages visited before and after the last access time of the selected cover data are at least one web page visited by the user before and after the time when the user last visited the web page which is the selected cover data. Can be.

For example, if a user makes a final visit to the "NEXTOUR-HONG KONG TRAVEL" web page at "12:15 PM on August 3, 2005," and selects the "NEXTOUR-HONG KONG TRAVEL" as the cover data, the "NEX Before and after the final approach time of "Tour-Hong Kong Travel" at 12:15 pm on August 3, 2005, the web page visited by the user is searched and the search result is output to the user. In addition, documents of a user terminal that has been generated, changed, or read before and after visiting the web page, which is the cover data, may be output to the user as a search result.

As described above, since the present invention searches for and provides data accessed before and after the last access time of the cover data, it is necessary to index and store the data accessed by the user. Thus, the real-time indexer 104 and the initial indexer 105 of FIG. 1 index the data accessed by the user and store it in the database. The database of the present invention is a storage means for storing information, and is not limited to a commercial database such as Microsoft's SQL server, but includes all means for storing information, and the information may be in any form, such as a file or a data record table. Contains data.

First, the initial indexer 105 crawls the data stored in the user terminal and stores the last access time of the data in the database in association with the location of the data. The initial indexer 105 indexes documents already stored in the user terminal when the data retrieval system according to the present invention is installed in the user terminal. On the other hand, the real-time indexer 104 is a document that is created, changed, or read in the user terminal after the data retrieval system according to the present invention is installed in the user terminal or the web page visited by the user using the user terminal Index them. Hereinafter, a case in which data stored in the user terminal and data accessed after the data retrieval system according to the present invention is installed in the user terminal are separately indexed. For example, the indexing process may be the same and may be indexed in one storage means. And an initial indexer and a real-time indexer may be implemented in one configuration.

5 is a diagram illustrating a database according to another embodiment of the present invention. Referring to FIG. 5A, when the data search system according to the present invention is installed in the user terminal, the initial indexer 105 crawls the data stored in the user terminal to locate the data 501 and the last access time of the data. 502 and a data identifier 503. The real-time indexer 104 assigns a sequentially increased data identifier 503 to the accessed data whenever the user accesses the data stored in the user terminal, the location of the accessed data 501, the end of the data. The access time 502 and data identifier 503 are stored to update the database.

In addition, the initial indexer 105 crawls the visited web page cache data stored in the user terminal to store the address of the visited web page instead of the location of the data, and the visit time and data of the web page. Identifiers can be stored. Similarly, the real-time indexer 104 assigns a sequentially increased data identifier to the visited web page whenever the user visits the web page, and stores a database storing the data identifier in association with the address of the visited web page. Update

In the present invention, crawling refers to collecting data distributed and stored in a user terminal and including it as an index of a search target.

At this time, the database of the data retrieval system maintains the location of the data in a separate location table 510 and stores the last access time 502 and the identifier 503 of the data to maintain the time-identifier table 520. . The time-identifier table 520 stores the identifier 503 for the last access time 502 of the data. The identifier may have a value that is sequentially increased. For example, the identifier may have a value that is incremented by "1".

If an identifier that is sequentially increased according to the final access order for data is stored and stored in the database, the data is accessed according to the sort order of the identifier. In addition, in the present invention, it is necessary to sort the data identifiers in order of final access time in addition to the identifier ordering as follows. At this time, the present invention maintains a time-identifier table 520 that records the final access order 502 and identifier 503 to avoid redundant storage of previously stored information.

In this case, the time-identifier table 520 may be generated in three structures according to the arrangement order of the last access time 502 input. If the last access time for the data is not entered in order, the time-identifier table 520 may store the last access time 502 and the corresponding identifier 503 regardless of the last access time 502. It can be created in a binary tree structure. At this time, the final access time 502 is used as a node key of the binary tree, and through this, the binary tree is sorted in order of the final access time 502.

On the other hand, when the final access time for the data is input in order, the time-identifier table 520 is an array that records the last access time 502 and the corresponding identifier 503 in the order of the last access time (502) ( array) can be created. The binary tree structure is used when the sort order of data does not match the final access order, but has a disadvantage in that a large amount of calculation is required when searching for data accessed before or after the last access time. The array structure is used when the sorting order of data coincides with the recent access order, and when searching for data accessed before and after the last access time, the data can be read in the arranged order so that the data can be easily searched. have.

In addition, the time-identifier table 520 may have a mixed structure in which the data accessed up to a predetermined time point is random in the order of final access time 502, but the data accessed after the time point is in increasing order of the last access time 502. have. At this time, the time-identifier table 520 maintains the binary tree structure until the point in time, and converts the stored data into the array structure after the point in time, and the data updated after the point in time may be maintained in the array structure.

That is, according to the present invention, a sequential access can be performed in chronological order according to the last access time order of data, and the binary access tree in which the last access time 502 and the corresponding identifier 503 are stored regardless of the order of the last access time 502. In the structure, after searching for the node having the last access time 502 as the node key to search, the sequential access is possible according to the order of final access time through the sequential tree traversal, while in the array structure, the identifier is determined by the order of the last access time. Are arranged, allowing sequential access to the data.

The structure of the time-identifier table as described above is only a matter of rearranging and arranging the data in the order of the last access time 502, and finally the sequential access to the data is possible even if the structure has any one of the three structures. Of course.

The location table may store the location of the data and record the location of the data in order corresponding to the order of the identifier 503. For example, when an identifier is assigned and recorded from "1" to "100", the position table may store positions of data to which an identifier is assigned in order. The location may be data having a predetermined size.

Accordingly, neighbor data retriever 102 reads the identifier of the selected label data from the time-identifier table with reference to the database, and reads from the location table the location of the data corresponding to the identifier. At this time, since the location of the data in the location table is stored corresponding to the increased identifier, it can be determined from the identifier. For example, when the identifier of the selected label data is "1001", since the identifier is an identifier that is allocated and stored in the 1001th position, the location of the data may be the 1001th stored data in the position table. When the positions are recorded in the position table as data having a predetermined size as described above, the position corresponding to the 1001th assigned identifier is (1001-1) * (the size of the position) at the point where the position table starts. Since the data is recorded at the point, reading the identifier of the time-identifier table allows the corresponding position to be read from the position table.

When the location is read, the neighbor data retriever 102 determines the last access time of the marker data recorded at the location.

Neighbor data retriever 102 retrieves an identifier of at least one or more data accessed before and after the last access time with reference to the time-identifier table. At this time, if there are a plurality of data accessed at the same time, a plurality of data identifiers are all searched. The neighbor data searcher may read a location of data corresponding to the searched identifier from a location table, generate a search result, and provide the search result to a user. At this time, a predetermined number of data may be provided according to the setting.

In addition, the neighbor data retriever 102 visits at least one web page visited before or after a visit time of the web page, which is the selected cover data, using the sequential approach to the time-identifier table described above after retrieving the last access time. Can provide search results for.

When the database includes both data and web pages stored in the user terminal, both the web page accessed before and after the access time of the cover data and the data stored in the user terminal may be output as a search result for the selected cover data.

The initial indexer 105 of the present invention records the data stored in the user terminal and time information about the web page visited by the user in the database 103 as described above, and the neighbor data searcher 102 refers to the database and displays the cover data. It is possible to provide a search result about the accessed data before and after the last access time of.

According to an embodiment, the initial indexer 105 may be implemented in a program form and installed in the user terminal. When the initial indexer 105 is installed in the user terminal, data stored in a storage means of the user terminal and web page cache data may be provided. Web page visit history stored in cache data may be read and stored in the database 103.

On the other hand, the data stored in the user terminal of the present invention or the information about the visited web page is stored in the database, but after the data retrieval system according to the present invention is installed in the user terminal for the data accessed by the user or visited web page The information needs to be indexed in real time. By such a need, the real-time indexer 104 indexes in real time information about the data that a user accesses or the web page to visit. For example, the real-time indexer 104 assigns the data identifier an incremented value of 1 for each visited accessed data or web page whenever the user accesses data or visits a web page stored in the user terminal.

According to an exemplary embodiment, the present invention receives a search time range from a user, and searches and provides data that is finally approached to the search time range by referring to the database of FIG. 5.

At this time, the data retrieval system of the present invention receives a retrieval time range from a user, and retrieves at least one or more data which has been finally approached to the input retrieval time range by referring to a database. The at least one last accessed data is data created, changed or read at the final time of creation, change or read time for the data.

For example, if a user enters a search time range of "August 8, 2005 20:00" to "August 8, 2005 22:00," the data retrieval system refers to the time-identifier table of the database of FIG. Identifier of the data that was last accessed at the earliest time after the entered search time range of "August 8, 2005, 20:00" and the last accessed data before "August 8, 2005, 22:00". Read the identifier of. When the data identifier is read, the identifiers of the last accessed data are sequentially read between the last access time of the two data identifiers through the neighbor data searcher to read the position of the data corresponding to each of the data identifiers, and the data from the position. Read it and generate search results and provide them to the user.

Therefore, according to the present invention, since there is an effect of searching and providing the last accessed data in the search time range input by the user, even if the user does not remember the keyword associated with the data and only remembers the access time range. You can retrieve the data and provide it to the user.

6 is a diagram illustrating an embodiment of assigning an incremented data identifier to data accessed according to the present invention. Referring to FIG. 6, the real time indexer 104 assigns an increased data identifier to the accessed data whenever the user accesses the data stored in the user terminal.

For example, when a user creates, changes, or reads text data called "Tomorrow To Do", the real-time indexer 104 gives a data identifier "1001" and writes the identifier "1001" to the database in association with the data. do.

In the next order, when the user creates, changes or reads the text data of "Document 1", the real time indexer 104 gives the data identifier "1002" and writes the identifier "1002" in the database in association with the data. .

Next, when the user visits a web page of "Naver News-Kim Hye-Soo Now", the real-time indexer 104 gives the data identifier "1003" which is sequentially increased, and assigns the data identifier in real time in association with the address of the web page. The database is stored in the index database 103 to update the database.

Similarly, when a user visits a web page of "Naver-Han Fan Cafe" in the following order, the real-time indexer 104 sequentially gives the data identifier "1004" and associates the data identifier with the address of the web page. Stored in the database 103.

Accordingly, neighbor data retriever 102 identifies the data identifier corresponding to the real-time selected marker data and provides a search result for the data corresponding to at least one or more data identifiers before and after the identified data identifier, thereby resulting in the finalization of the marker data. Search results may be provided for one or more data accessed before and after the access time.

For example, if a user changes the data of the "Tomorrow List", creates "Document 1", visits the web page of "Naver-Kim Hye-Soo Now," reads the article, and then links to the "Naver" linked to the article. -You visited Han Ga-in's fan cafe "web page, and you may not remember the name because you liked Hanga-in, but you don't know who it is.

In this case, according to the prior art, there was no way to find "Naver-Hangain's fan cafe", but according to the present invention, the user visited "Naver-Hangain's fan cafe" while changing the data of "Tomorrow To-Do List." You can search for "Naver-Han-ga-in's fan cafe" even if you create "Document 1" and look at the article of "Naver-Kim Hye-su Now" and visit "Naver-Han-ga-in's fan cafe".

That is, the user remembers the keyword "summer vacation" included in "Document 1" which he worked on before visiting the "Naver-Hanga fan cafe", and the keyword "summer vacation" is displayed in the search box of the cover data searcher 101. You can enter

As shown in FIG. 4, the cover data searcher 101 outputs information on the data of "Document 1" as a cover data search result by referring to the database 103.

When the user selects "Document 1", the neighbor data retriever 102 refers to the database to identify the data identifier "1002" of "Document 1" and stores the data identifiers "1001", "stored before and after the identified data identifier. Last access time to "Naver-Kim Hye-Soo Now" by providing search results for "Tomorrow To Do List", "Naver-Kim Hye-Soo Now", "Naver-Han Ga-in Fan Cafe", and the corresponding data for 1003 "and" 1004 " It is possible to provide search results for one or more data accessed before and after.

8 is a diagram illustrating a screen for providing a neighbor data search result according to an embodiment of the present invention.

Referring to FIG. 8, the neighbor data searcher 102 is a search result for "Document 1", and the web pages "Naver-Kim Hye-Soo Now" (801) and "Naver-Han Ga-in's fan cafe" 802 that the user visited are The data "Tomorrow To Do List" 803 stored in the user terminal is searched for and output. In this case, information about the web pages 801 and 802 visited by the user may include a part of the web page, an address of the web pages 801 and 802, and time information when the user visited the web page. Information on the data 803 stored by the user in the user terminal may include a part of the data, an address where the data is stored, and time information when the user accesses the data.

In fact, when a large number of users access certain data or visit a web page, when the data or the content of the web page is new content that is not encountered, the time before and after the data or the web is accessed rather than remembering it correctly. In many cases, the data accessed in the time before and after visiting the page or the contents included in the visited web page are often remembered. However, the present invention has an effect of accurately searching for the data to be searched even if the user remembers only the latter content.

In addition, since the present invention indexes the database in order by assigning identifiers to stored data or web pages accessed by the user, there is an effect that the access data can be indexed in sequence while using a minimum memory.

According to an embodiment, the real-time indexer 104 of FIG. 1 crawls the data stored in the user terminal as shown in FIG. 5, the location 501 of the crawled data, the last access time 502 of the data and the increased number. Perform an initial indexing operation that stores the data identifier 503 in the database.

For example, the real-time indexer 104 may have a data location "C: \ Document \ Document1.txt" for "Document 1" stored at "8:12 PM on August 8, 2005" as shown in FIG. The last access time "8/08 11:12 pm" and the increased data identifier "1001" may be stored in the database.

According to an embodiment, the data stored in the user terminal may be data about a web page visited by the user, and the address of the visited web page, the visit time of the web page, and the increased number of the visited web page as shown in FIG. Data identifiers can be stored in the database.

As a result of the initial indexing operation, when the index of all data stored in the user terminal is terminated, the real-time indexer 104 may switch the database structure according to the nature of the input. For example, initial indexes are typically populated regardless of the order of last access time, so that the database maintains a binary tree structured time-identifier table. Real-time indexes, on the other hand, typically have inputs in order of final access time, so if you can guarantee that all the data is entered in chronological order, you can turn the database inside into an array structure that is superior in performance.

After completion of the initial indexing operation, the real-time indexer 104 may update a database storing the data identifier in association with the accessed data whenever the user accesses data stored in the user terminal. The process of updating the database is as described in FIG.

The indexing operation for all the stored data is completed and stored in the database 103, and whenever the user accesses the stored data, the real-time indexer 104 updates the database storing the data identifier in association with the accessed data. The neighbor data retriever 102 then identifies a data identifier corresponding to the selected marker data, compares the reference data identifier with the data identifier, and accesses the data before and after the last access time of the selected marker data with reference to the database. Provide search results for at least one or more data.

Therefore, the present invention simply gives an increased data identifier in the crawl order for data stored in the user terminal and stores it in the database, and gives an increased data identifier for data accessed after the end of the indexing operation. By storing, it is possible to provide the data search result which is accessed before and after the last access time of the data accessed in real time as well as the data stored in the user terminal.

7 is a flowchart illustrating a process of providing a data search result according to an embodiment of the present invention.

Referring to FIG. 7, the data retrieval system according to the present invention maintains a database in step S701. The database stores the keyword corresponding to the data stored in the user terminal or the address of the web page visited by the user and the keyword corresponding to the web page, with reference to FIGS. 2 and 3.

In step S701, the data retrieval system according to the present invention is installed in a user terminal to generate a database.

The database is created by crawling the data stored in the user terminal and storing the last access time of the data in association with the location of the data. The database may be generated by crawling visited web page cache data stored in the user terminal and storing the visit time in association with the address of the visited web page. The database has been described with reference to FIG. 5.

In step S702, the data retrieval system according to the present invention updates the database as the user approaches the user terminal or visits a web page.

The data retrieval system of the present invention provides a database by assigning a sequentially increased data identifier to the accessed data each time a user accesses data stored in the user terminal and storing the data identifier in association with the accessed data. Update

In addition, the data retrieval system of the present invention provides a database by sequentially increasing the data identifier for the visited web page whenever the user visits the web page, and storing the data identifier in association with the address of the visited web page. Update

When the user inputs a keyword for the cover data in step S703, the data retrieval system according to the present invention receives the keyword, and in step S704, at least one corresponding to the keyword input from the user with reference to the database. The above cover data is retrieved and provided to the user.

As described above, the cover data may be data stored in the user terminal or a web page visited by the user.

In step S705, the user selects one of the provided cover data, and the data retrieval system of the present invention receives the selection input. The screen providing the cover data has been described with reference to FIG. 4.

In step S706, the data retrieval system of the present invention provides a search result for at least one or more data accessed before and after the last access time of the selected marker data.

The selected cover data may be the cover data selected by the user among the provided cover data by providing the searched at least one cover data.

As described above, the access time may be one of a generation time, a change time, and a read time.

If the searched cover data is one, the selected cover data may be the searched cover data.

The at least one data accessed before or after the last access time of the selected cover data may be at least one web page visited by the user before or after the user last visited the web page which is the selected cover data. .

The data retrieval system of the present invention identifies a data identifier corresponding to the selected label data with reference to a database and provides a search result for data corresponding to at least one data identifier before and after the identified data identifier. The screen providing the search result has been described with reference to FIG. 8.

Therefore, when a user accesses predetermined data or visits a web page, if the data or the contents of the web page are new contents that have not been encountered, the time before and after the user accesses the data without remembering it or before and after visiting the web page. When the data accessed in the time or the contents included in the visited web page is memorized, it is effective to provide a search result by accurately searching the data to be searched.

Each step shown in FIG. 7 may be performed in the order shown in FIG. 7, in the reverse order, or simultaneously.

Content not described in connection with the method described with reference to FIG. 7 may be omitted as it is applicable to the embodiments related to the local computer search system.

The data retrieval method according to the present invention has been described so far, and thus the technical contents described in the embodiments of the data retrieval system may be applied to the data retrieval method of FIG. 7 as it will be omitted.

The data retrieval method according to the present invention can be implemented in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. The medium may be a transmission medium such as an optical or metal wire, a waveguide, or the like including a carrier wave for transmitting a signal specifying a program command, a data structure, or the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above-described embodiments, which can be variously modified and modified by those skilled in the art to which the present invention pertains. Modifications are possible. Accordingly, the spirit of the present invention should be understood only by the claims set forth below, and all equivalent or equivalent modifications thereof will belong to the scope of the present invention.

Since the present invention stores the data stored in the user terminal and the keyword corresponding to the address of the web page visited by the user, it is possible to search the cover data by simultaneously searching the stored data and the keywords included in the web page address.

In addition, the present invention is a new content that the data or the contents of the web page has not been encountered when the user accesses the data or visits the web page, so that the user does not remember, at the time before and after the data or the web page Even when the data accessed in the time before and after the visit or the contents included in the visited web page are remembered, the user may search the data exactly to search and provide the search result.

In addition, since the present invention indexes the database in order by assigning identifiers to stored data accessed or web pages visited by the user, there is an effect that the access data can be sequentially indexed using a minimum of memory.

In addition, the present invention simply gives an increased data identifier in the crawl order for the data stored in the user terminal, and stores it in the database, and gives an increased data identifier for the data accessed after the end of the indexing operation. By storing the data, the data search result may be provided before or after the last access time of the data accessed in real time as well as data stored in the user terminal.

Claims (1)

A directory checking unit for checking a directory in which the file is stored by using a file name or a string included in the file content; And An information search unit that searches for information in your computer through the file search and index functions. Data retrieval system comprising a.

Images