A non-transitory computer-readable recording medium stores therein a data generation program that causes a computer to execute a program including: arranging a first morpheme in an order of a position of the first morpheme in text data by referring to an index generated by the text data, in which positions of a plurality of morphemes included in the text data are associated with each of the morphemes; and referring to relationship information indicating a relationship between morphemes, and when the first morpheme is a specific type having a relationship with a second morpheme, arranging the second morpheme in an order of a position of the second morpheme in the text data by referring to the index.
|
5. An information processing device comprising:
a processor configured to:
arrange in a buffer a first morpheme in an order of a position of the first morpheme in text data including morphemes, according to a position indicated in an index generated from the text data, the index positions of the morphemes in the text data being respectively associated with each of the morphemes; and
refer to relationship information indicating a relationship between morphemes in the text data, and with the first morpheme being a specific type that is a tag or column and having a relationship with a second morpheme, arrange in the buffer the second morpheme in an order of a position of the second morpheme in the text data according to the position indicated in the index.
4. A data generation method comprising:
arranging in a buffer a first morpheme in an order of a position of the first morpheme in text data including morphemes, according to a position indicated in an index generated from the text data, the index including positions of the morphemes in the text data being respectively associated with each of the morphemes, by a processor; and
referring to relationship information indicating a relationship between morphemes in the text data, and with the first morpheme being a specific type that is a tag or a column and having a relationship with a second morpheme, arranging in the buffer the second morpheme in an order of a position of the second morpheme in the text data according to the position indicated in the index, by the processor.
1. A non-transitory computer-readable recording medium storing therein a data generation program that causes a computer to execute a process comprising:
arranging in a buffer a first morpheme in an order of a position of the first morpheme in text data including morphemes, according to a position indicated in an index generated from the text data, the index including positions of the morphemes in the text data being respectively associated with each of the morphemes; and
referring to relationship information indicating a relationship between morphemes in the text data, and with the first morpheme being a specific type that is a tag or a column and having a relationship with a second morpheme, arranging in the buffer the second morpheme in an order of a position of the second morpheme in the text data according to the position indicated in the index.
2. The non-transitory computer-readable recording medium according to
wherein the text data is coded into coded text data, the first morpheme is coded into a coded first morpheme, the second morpheme is coded into a coded second morpheme, the index associates coded morphemes included in the coded text data with positions thereof in the coded text data, and
wherein the process further includes:
specifying positions of the coded first morpheme and the coded second morpheme in the coded text data, by referring to the index; and
arranging in the buffer the coded first morpheme and the coded second morpheme according to the specified positions to restore the first morpheme and the second morpheme therefrom.
3. The non-transitory computer-readable recording medium according to
when a word and a tag, or a word and a column, are received as a search target and as morphemes in the coded text data, specifying positions of a first code that is a code of the word and a second code that is a code of the tag or the column in the coded text data by referring to the index; and
arranging in the buffer the first code and the second code according to the specified positions to restore the word and the tag or column therefrom.
|
This application is based upon and claims the benefit of priority of the prior Japanese Patent Application No. 2018-071191, filed on Apr. 2, 2018, the entire contents of which are incorporated herein by reference.
The embodiments discussed herein are related to a data generation method, an information processing device, and a computer-readable recording medium.
In data compression and decompression, in file formats such as LZ77 and ZIP, encoding and decoding are performed by allocating a code having a short bit length with respect to characters or a longest match character string. In website search, there has been known a technique of utilizing a transposition index associated with words to accelerate full text search.
Meanwhile, in recent years, there has been known a technique that encoding and decoding are performed by allocating a code to a word in order to perform compression and decompression, and a transposition index associated with a word and an appearance position thereof is generated and incorporated in order to accelerate searching.
Patent Document 1: Japanese Laid-open Patent Publication No. 2016-046602
According to an aspect of an embodiment, a non-transitory computer-readable recording medium stores therein a data generation program that causes a computer to execute a program including: arranging a first morpheme in an order of a position of the first morpheme in text data by referring to an index generated by the text data, in which positions of a plurality of morphemes included in the text data are associated with each of the morphemes; and referring to relationship information indicating a relationship between morphemes, and when the first morpheme is a specific type having a relationship with a second morpheme, arranging the second morpheme in an order of a position of the second morpheme in the text data by referring to the index.
The object and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the claims.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not restrictive of the invention.
It is easy to restore original data based on a compression code associated with the order of appearance of words. However, transposition indexes are not arranged in the order of appearance of codes of words, but are transposed (re-arranged) in the code order of the codes of word (or character strings constituting a word). Therefore, it takes a long time to restore the original data. Particularly, if it is desired to restore only a specific part of data, it takes a long time to specify the part to be restored and to search the corresponding index.
Further, in order to suppress an increase of the size of transposition indexes, processing such as excluding words with a high appearance frequency from an index target or increasing the information granularity relating to the positions of transposition indexes are performed. Therefore, it is difficult to restore the original data by utilizing transposition indexes.
Preferred embodiments will be explained with reference to accompanying drawings. The present invention is not limited to the embodiments. The respective embodiments can be combined with each other as appropriate within a scope where no contradictions occur among them.
First, processes performed by an information processing device 10 (see
As illustrated in
After specifying, by the co-occurrence bitmap, the position of a specified tag and a word to be enclosed with specified tags, the information processing device 10 performs transposition buffering of a compressed code using a bitmap transposition index to arrange a compressed code in a transposition buffer. Thereafter, the information processing device 10 uses a static dictionary and a dynamic dictionary to convert the compressed codes into the transposition buffer in the order of storage to restore only a corresponding part of the original text data.
Here, the bitmap transposition index is an index generated from sentence data to be encoded, and is an index in which a compressed code corresponding to each word appearing in the sentence data is associated with an appearance position in the document data. The co-occurrence bitmap is information in which each tag appearing in the sentence data is associated with a tagged word.
The static dictionary is a dictionary describing a compressed code allocated to a corresponding word in advance for words with a high appearance frequency, and is a table in which words with a high appearance frequency are associated with compressed codes. The dynamic dictionary is a dictionary describing a compressed code allocated to a corresponding word for words with a low appearance frequency, and is a table in which words with a low appearance frequency are associated with compressed codes. That is, the dynamic dictionary memorizes therein an association between a compressed code dynamically allocated to a word when appearing in sentence data and an unregistered word with respect to each unregistered word that is not registered in the static dictionary, among words appearing in the sentence data. Further, the transposition buffer is a buffer sectioned by a fixed length of 3 bytes, and having a length of number of bytes same as a bitmap transposition index. Words in each dictionary include tags.
In such a state, the information processing device 10 acquires each bitmap transposition index corresponding to each of a compression code A, a compression code B, . . . , and a compression code N respectively corresponding to a word 1, a word 2, . . . , and a word n that have appeared in the document data. Similarly, the information processing device 10 acquires a co-occurrence bitmap corresponding to each of the compression code a and the compression code b corresponding to each of a tag a (for example, <FUKUSAYO>) and a tag b that have appeared in the document data. The information processing device 10 further specifies the word 1 enclosed by the tag a to generate the co-occurrence bitmap.
Thereafter, when a word enclosed by the tag a (for example, <FUKUSAYO>) is set as a restoration target by a query from a user or the like, the information processing device 10 decides the search target as the tag a (for example, <FUKUSAYO>) and the tag b being paired therewith (for example, </FUKUSAYO?>). The relationship of the tags can be associated with each other in advance, or can be generated automatically by using a general tag configuration, so as to add “/(slash)” to the tag specified as a search target.
The information processing device 10 then specifies a word 1 (for example, HATSU) and a word 2 (for example, NETSU) corresponding to the tag a (FUKUSAYO) by referring to the co-occurrence bitmap, and narrows down the word 1 and the word 2 as transposition targets and restoration targets. Subsequently, the information processing device 10 acquires the bitmap transposition index corresponding to each of the word 1 and the word 2, and acquires the co-occurrence bitmap corresponding to each of the tag a <FUKUSAYO> and the tag b </FUKUSAYO>. The information processing device 10 then prepares a transposition buffer sectioned by 3 bytes each.
The information processing device 10 then specifies the position of the tag a <FUKUSAYO> in the original data according to the co-occurrence bitmap corresponding to the tag a <FUKUSAYO>, and specifies the position of the tag b </FUKUSAYO> in the original data according to the co-occurrence bitmap corresponding to the tag b </FUKUSAYO>. Similarly, the information processing device 10 specifies the positions of the word 1 and the word 2 in the original data according to the bitmap transposition index corresponding to the word 1. In this manner, the information processing device 10 specifies bits 6, 7, 8, and 9 as appearance positions of a character “HATSU” and a character “NETSU” that are enclosed by the tags <FUKUSAYO> in the original data.
Subsequently, the information processing device 10 transposes compression codes of the appeared word 1 (HATSU), word 2 (NETSU), tag a (<FUKUSAYO>), and tag b (</FUKUSAYO>) in the transposition buffer corresponding to the appearance positions in the target sentence data. For example, when the tag a <FUKUSAYO> (the compression code a) appears in the sixth place, the tag b </FUKUSAYO> (the compression code b) appears in the ninth place, the word 1 (the compression code A) appears in the seventh place, and the word 2 (the compression code B) appears in the eighth place, the information processing device 10 stores the compression code a in the sixth place, the compression code A in the seventh place, the compression code B in the eighth place, and the compression code b in the ninth place in the transposition buffer.
Thereafter, the information processing device 10 converts the respective stored compression codes into the original words in the order stored in the transposition buffer, by referring to the static dictionary and the dynamic dictionary. As it is explained with reference to the case described above, the information processing device 10 converts the compression code a stored in the sixth place of the transposition buffer into the tag <FUKUSAYO>, converts the compression code A stored in the seventh place thereof into the word 1, converts the compression code B stored in the eighth place thereof into the word 2, and converts the compression code b stored in the ninth place thereof into the tag </FUKUSAYO>. By arranging these elements in the order of storage, as “<FUKUSAYO>, HATSU, NETSU, </FUKUSAYO>, only the part to be searched in the original sentence data can be restored.
In this manner, the information processing device 10 arranges corresponding words associated with the index in the order of positions in the document data, by referring to the index generated from the document data as text data, in which each of the words and tags included in the document data are associated with positions in the document data. Therefore, the information processing device 10 can generate a part of the original data based on the bitmap transposition index and the like. In the present embodiment, a bitmap transposition index corresponding to a compression code of a word is explained as an example. However, the present invention is not limited thereto, and even a bitmap transposition index corresponding to a morpheme acquired from document data or a word itself can be processed in the same manner. In this case, before storage in the transposition buffer, the morpheme or the word is converted into a compression code by using the static dictionary and the dynamic dictionary.
The communication unit 11 is a processing unit that controls communication with other devices and is, for example, a network interface card. For example, the communication unit 11 receives a bitmap transposition index and the like from other information processing devices 10.
The memory unit 12 is an example of a memory device that memorizes therein programs and data and is, for example, a memory or a hard disk. The memory unit 12 memorizes therein a transposition index DB 13, a static dictionary 14, a dynamic dictionary 15, a co-occurrence information DB 16, and the like.
The transposition index DB 13 is an index generated from sentence data to be encoded, and is a database that memorizes therein bitmap transposition indexes with offsets in which a compression code corresponding to each word appearing in the sentence data is associated with an appearance position in the document data.
A generation example of the bitmap transposition index with offsets is described with reference to
A generation example of the bitmap transposition index with offsets is described with reference to
The bitmap index referred to herein is a bitmap in which the presence of a word included in text data for each file is indexed. As illustrated in
For example, as illustrated in
As an example, the index generation device sets values of the respective bits of the bitmap bi1 at the remainder positions of division by dividing positions of the respective bits of the bitmap bi1 by the bottom 29, with respect to the hashed bitmap h11 of the bottom 29. A bit value “1” at the 35th bit position in the bitmap bi1 is set at the sixth bit in the hashed bitmap h11. A bit value “1” at the 42nd bit position in the bitmap bi1 is set at the 13th bit in the hashed bitmap h11. The index generation device sets values of the respective bits of the bitmap bi1 at the remainder positions of division by dividing positions of the respective bits of the bitmap bi1 by the bottom 31, with respect to the hashed bitmap h12 of the bottom 31. A bit value “1” at the 35th bit position in the bitmap bi1 is set at the fourth bit in the hashed bitmap h12. A bit value “1” at the 42nd bit position in the bitmap Bi1 is set at the 11th bit in the hashed bitmap h12. That is, the index generation device sets the respective bits from the 0th bit of the bitmap sequentially from the 0th bit to the (bottom-1)th bit in the hashed bitmap. The index generation device returns again and sets an ORed value from the 0th bit thereafter in the hashed bitmap and a value already set in the hashed bitmap.
More specifically, as an example, there is explained a case where it is assumed that a bitmap 50 is included in an index and the bitmap 50 is hashed. The index generation device generates a bitmap 50a of the bottom 29 and a bitmap 50b of the bottom 31 from the bitmap 50. In the bitmap 50a, a section is set for each offset 29 with respect to the bitmap 50, and an offset with flag “1” starting from the set section is represented by flags of offsets 0 to 28 in the bitmap 50a.
The index generation device copies the information from the offset 0 to the offset 28 of the bitmap 50 to the bitmap 50a. The index generation device processes the offset information on an offset 29 and onwards of the bitmap 50a in the following manner.
A flag “1” is set in an offset “35” of the bitmap 50. Because the offset “35” is an offset “28+7”, the index generation device sets a flag “(1)” to an offset “6” of the bitmap 50a. It is assumed that the first offset is 0. A flag “1” is set in an offset “42” of the bitmap 50. Because the offset “42” is an offset “28+14”, the index generation device sets a flag “(1)” to an offset “13” of the bitmap 50a.
In the bitmap 50b, a section is set for each offset 31 with respect to the bitmap 50, and an offset with the flag “1” starting from the set section is represented by flags of offsets 0 to 30 in the bitmap 50b.
A flag “1” is set in the offset “35” of the bitmap 50. Because the offset “35” is an offset “30+5”, the index generation device sets a flag “(1)” to an offset “4” of the bitmap 50b. It is assumed that the first offset is 0. A flag “1” is set in the offset “42” of the bitmap 50. Because the offset “42” is an offset “30+12”, the index generation device sets a flag “(1)” to an offset “11” of the bitmap 50b.
The index generation device generates the bitmaps 50a and 50b from the bitmap 50 by performing the processes described above. The bitmaps 50a and 50b are the results of hashing the bitmap 50. While a case where the length of the bitmap 50 is 0 to 43 has been explained here, even in a case where the length of the bitmap 50 is equal to or more than 43, the flag “1” set in the bitmap 50 can be expressed with the bitmap 50a and the bitmap 50b.
In this manner, the index generation device generates a hashed bitmap generated according to the method described above for each word. Subsequently, the transposition index DB 13 memorizes therein the hashed bitmap for each word. Note that, as described above, a bitmap transposition index having a general size can be used instead of the size-reduced transposition index. As the size reduction method, any known method can be employed.
Further, the transposition index DB 13 memorizes therein a co-occurrence bitmap that is a bitmap transposition index with offsets in which a compression code corresponding to each tag appearing in sentence data is associated with an appearance position in document data, which is an index generated from sentence data to be encoded.
The static dictionary 14 is a database or the like that memorizes therein an association between a word having a high appearance frequency and a compression code allocated in advance to the word. The dynamic dictionary 15 is a database that memorizes therein the association between a word having a low appearance frequency, not registered in the static dictionary 14, and appearing in the document data to be encoded and a compression code allocated to the word.
Items in the lateral direction in the upper part of
Codes of “0*h” and “1*h” are one-byte codes, and a common control code is associated therewith in each hierarchy. Codes of “2*h” to “3*h” are one-byte codes, and super-high frequency words (English words) having a particularly high appearance frequency among the words appearing highly frequently are associated therewith in advance. Codes of “4*h” and “5*h” are one-byte codes, and super-high frequency words (Japanese words) having a particularly high appearance frequency among the words appearing highly frequently are associated therewith in advance.
Codes of “6*h” and “7*h” are two-byte codes, and words appearing highly frequently (English words) are associated therewith in advance. Codes of “8*h” and “9*h” are two-byte codes, and words appearing highly frequently (Japanese words) are associated therewith in advance. Codes from “A*h” to “F*h” are two-byte or three-byte codes, and when a low frequency word appears, a code is allocated thereto dynamically. “E*h” and “F*h” are three-byte codes to correspond to shortage of codes.
Referring back to
The control unit 20 is a processing unit that controls the entire information processing device 10, and is a processor, for example. The control unit 20 executes an acquisition unit 21 and a restoration unit 22. The acquisition unit 21 and the restoration unit 22 are an example of an electronic circuit provided in the processor or an example of processes performed by the processor.
The acquisition unit 21 is a processing unit that acquires a bitmap transposition index with offsets and a co-occurrence bitmap from other computers such as an index generation device. Specifically, the acquisition unit 21 acquires the bitmap transposition index generated by the method described with reference to
The restoration unit 22 includes a search unit 23, a transposition processing unit 24, and a restoration processing unit 25, and performs restoration of original document data by using a bitmap transposition index with offsets, a co-occurrence bitmap, and the like. Specifically, after the restoration unit 22 restores a hashed bitmap transposition index and a co-occurrence bitmap, restoration of original document data is performed by using the search unit 23, the transposition processing unit 24, and the restoration processing unit 25. The transposition processing unit 24 and the restoration processing unit 25 are examples of a first arrangement unit and a second arrangement unit.
Restoration of a hashed bitmap transposition index is described with reference to
As illustrated in
Similarly, the restoration unit 22 generates a bitmap 51b based on the bitmap 50b of the bottom 31. Information of flags of offsets 0 to 30 in the bitmap 51b is similar to that of the flags of offsets 0 to 30 in the bitmap 50b. The information of flags of an offset 31 and onwards in the bitmap 51b is repetition of information of offsets 0 to 30 in the bitmap 50b.
Thereafter, as illustrated in
Referring back to
As illustrated in
As illustrated in
In the searching process, a bitmap corresponding to the first character “HATSU” included in the search character string “HATSUNETSU” is extracted from the bitmap index. “1” is set in the seventh bit of the bitmap. In the searching process, the bitmap is shifted to the left by one bit. Therefore, “1” is set in the eighth bit of the bitmap.
Subsequently, in the searching process, a bitmap corresponding to the subsequent second character “NETSU” included in the search character string “HATSUNETSU” is extracted from the bitmap index. “1” is set in the eighth bit of the bitmap. In the searching process, an AND operation of the shifted bitmap corresponding to the first character “HATSU” and the bitmap corresponding to the subsequent character “NETSU” is performed. The bitmap obtained by performing the AND operation corresponds to a search bitmap generated in association with the order of appearance in “HATSUNETSU” constituting the search character string. In the searching process, it is determined whether all the bits in the bitmap are 0 as a result of operation. In this example, because the eighth bit in the bitmap is calculated as “1”, it is determined that it is not said that all the bits are “0”. That is, it is determined in the searching process that there is a character string “HATSUNETSU” including the current character and the next character.
Further, in the searching process, a bitmap corresponding to the tag “<FUKUSAYO>” is extracted from the bitmap index, and “1” is set in the sixth bit of the bitmap. Similarly, in the searching process, a bitmap corresponding to the tag “</FUKUSAYO>” is extracted from the bitmap index, and “1” is set in the ninth bit of the bitmap. In the searching process, a bitmap in which “1” is set from the sixth bit to the ninth bit put between a start tag <FUKUSAYO> and an end tag </FUKUSAYO> is generated.
Thereafter, in the searching process, an AND operation of the bitmap in which “1” is set from the sixth bit to the ninth bit corresponding to the tag <FUKUSAYO> generated here and the bitmap corresponding to “HATSUNETSU” described above in which “1” is set in the eighth bit is performed. A bitmap in which “1” is set in the eighth bit is generated in the searching process as a result of the AND operation. In the searching process, it is determined whether all the bits in the bitmap are “0” as the result of operation. In this example, because the eighth bit in the bitmap is calculated as “1”, it is determined that it is not said that all the bits are “0”. That is, in the searching process, it can be determined that there is a character string “HATSUNETSU” between the tags and the sixth bit to the ninth bit are the restored part corresponding to the search query.
The transposition processing unit 24 is a processing unit that transposes a compression code of a corresponding word and a compression code of a corresponding tag to a transposition buffer based on a bitmap of a bitmap transposition index and a co-occurrence bitmap. The transposition processing unit 24 secures a transposition buffer sectioned by 3 bytes, which is the maximum number of bytes of a code managed in the dynamic dictionary 15, in a memory or the like, and stores the compression codes of the corresponding word and tag in a transposition buffer corresponding to the position at which the word and the tag have appeared.
In this manner, the transposition processing unit 24 can store the compression codes of the corresponding words and the like in the order of appearance in document data, sequentially from the top of the transposition buffer sectioned by 3 bytes based on the bitmap transposition index of the respective compression codes of the word “HATSU”, the word “NETSU”, the tag “<FUKUSAYO>”, and the tag “/<FUKUSAYO>”. The transposition processing unit 24 outputs a transposition buffer in which the compression codes are stored to the restoration processing unit 25.
The restoration processing unit 25 is a processing unit that restores a part to be restored in original document data from a transposition buffer in which compression codes are stored. Specifically, the restoration processing unit 25 deletes NULL in the transposition buffer and generates compressed data in which only the compression codes are extracted. Thereafter, the restoration processing unit 25 performs restoration of the document data by using the static dictionary 14 or the dynamic dictionary 15 to restore the respective compression codes to original words. The restoration processing unit 25 can also restore the state of the transposition buffer by inserting NULL to compressed data.
Thereafter, the restoration processing unit 25 refers to the static dictionary 14 and the dynamic dictionary 15 to specify words and the like corresponding to the respective compression codes in the compressed data “A000h, 20h, 25h, A001h”, and generates “<FUKUSAYO>, HATSU, NETSU, </FUKUSAYO>” in which the compressed data is converted into words and the like. The restoration processing unit 25 then connects the words and the like obtained by conversion to restore the restoration target “<FUKUSAYO>HATSUNETSU</FUKUSAYO>”.
As illustrated in
Subsequently, upon reception of a search query including tags and words to be searched from a user terminal or the like (S104), the search unit 23 performs full text search (S105) and performs tag condition search (S106) to specify that a search target in the search query is included in an original document and to specify a part of the original document, which is a restoration target (S107).
Subsequently, the transposition processing unit 24 secures a transposition buffer for compression codes (S108). The restoration processing unit 25 then uses bitmaps respectively corresponding to specified words and tags to specify the compression codes to be restored, and stores the specified compression codes at corresponding positions in the transposition buffer, thereby generating compressed data by deleting NULL (S109).
Thereafter, the restoration processing unit 25 restores the respective compression codes in the compressed data to words and the like (S110) by using respective dictionaries, and restores only the corresponding part by using the restored words and the like (S111).
As described above, the information processing device 10 performs transposition and replacement of compression codes and restoration of texts based on a bitmap transposition index with offsets and a co-occurrence bitmap. Specifically, the information processing device 10 associates one bit in a bit string of the bitmap transposition index with offsets with fixed three bytes in a byte string of the compression code, and performs transposition of a compression code of the corresponding word only for a part to be restored (tag-related part). Subsequently, the information processing device 10 suppresses NULL bytes in the respective compression codes. Thereafter, the information processing device 10 restores only a tag-related part to be restored by using the static dictionary and the dynamic dictionary based on a byte string of the compression code having the fixed three bytes. Therefore, the information processing device 10 can accelerate restoration by narrowing down only the part to be restored (tag-related part) based on the co-occurrence bitmap.
While an embodiment of the present invention has been described above, the present invention can be also carried out in various different modes other than the embodiment described above. Therefore, a different embodiment is described below.
The information processing device 10 according to the first embodiment can perform the searching process described above by receiving a word or a tag as a search query. Further, the tag specified in the search query can be processed by using a method similar to that of the first embodiment, with regard to both a start tag and an end tag or either one of these tags. The information processing device 10 can process not only tags but also columns in a similar manner, and can employ any morpheme so long as the morpheme co-occurs.
Further, in the first embodiment, an example in which “HATSU” and “NETSU” are separately encoded has been explained. However, the present invention is not limited thereto, and encoding as “HATSUNETSU” is also possible. The compression codes explained in the embodiment are only an example, and do not limit their values and the like. Further, the relationship between a morpheme such as a word and a tag and a compression code is also only an example, and does not limit its value and the like.
Further, elements such as bitmap indexes, co-occurrence bitmaps, and the co-occurrence information DB 16 can be generated by the information processing device 10, and can be generated by the index generation device and the information processing device 10 can acquire these elements from the index generation device.
Process procedures, control procedures, specific names, and information including various kinds of data and parameters described in the above embodiments and illustrated in the drawings can be arbitrarily changed unless otherwise specified.
Further, the respective constituent elements of the respective devices illustrated in the drawings are functionally conceptual, and these constituent elements do not need to be configured in physically the same manner in the drawings. That is, the specific mode of distribution and integration of the respective devices is not limited to the illustrated ones. In other words, all or a part thereof can be functionally or physically distributed or integrated in an arbitrary unit according to various kinds of load and the status of use. In addition, all or an arbitrary part of respective processing functions executed by the respective devices can be realized by a CPU (Central Processing Unit) and by a program analyzed and executed in the CPU, or can be realized as hardware by a wired logic.
An information processing program having the same functions as those of the respective processing units such as the acquisition unit 21 and the restoration unit 22 illustrated in
The CPU 401 performs various types of processing by reading out respective programs memorized in the hard disk device 408 and loading the programs in the RAM 407 to execute the programs. These programs can cause the computer 400 to function as the acquisition unit 21 and the restoration unit 22 illustrated in
The information processing program described above does not need to be memorized in the hard disk device 408. For example, it is possible to configure that the computer 400 reads and executes the program memorized in a storage medium that can be read by the computer 400. The storage medium that can be read by the computer 400 corresponds to, for example, a portable recording medium such as a CD-ROM (Compact Disc Read only memory), a DVD, and a USB (Universal Serial Bus) memory, a semiconductor memory such as a flash memory, or a hard disk drive. Further, it is possible to configure that the program is memorized in a device connected to a public line, the Internet, or a LAN (Local Area Network) and the computer 400 reads out the program from them to execute the program.
When the search function is invoked by the CPU 401, by performing processing based on at least a part of the middleware 28 or the application program 29 (performing the processing by controlling the hardware group 26 based on the OS 27), the functions of the acquisition unit 21 and the restoration unit 22 are realized. The respective functions of the acquisition unit 21 and the restoration unit 22 can be respectively included in the application program 29 itself or can be a part of the middleware 28 that is invoked and executed according to the application program 29.
According to one embodiment, it is possible to restore original data and to shorten the time taken for the restoration.
All examples and conditional language recited herein are intended for pedagogical purposes of aiding the reader in understanding the invention and the concepts contributed by the inventors to further the art, and are not to be construed as limitations to such specifically recited examples and conditions, nor does the organization of such examples in the specification relate to a showing of the superiority and inferiority of the invention. Although the embodiments of the present invention have been described in detail, it should be understood that the various changes, substitutions, and alterations could be made hereto without departing from the spirit and scope of the invention.
Okubo, Takahiro, Kataoka, Masahiro, Matsumura, Ryo
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
7917737, | Nov 16 2004 | International Business Machines Corporation | System and method for managing data |
20090089256, | |||
20090164437, | |||
20120023073, | |||
20150331847, | |||
20160056839, | |||
20160171031, | |||
20160217111, | |||
JP2004102430, | |||
JP2009271794, | |||
JP2010146273, | |||
JP2016046602, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Feb 13 2019 | OKUBO, TAKAHIRO | Fujitsu Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 048586 | /0605 | |
Feb 14 2019 | KATAOKA, MASAHIRO | Fujitsu Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 048586 | /0605 | |
Feb 27 2019 | MATSUMURA, RYO | Fujitsu Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 048586 | /0605 | |
Mar 13 2019 | Fujitsu Limited | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Mar 13 2019 | BIG: Entity status set to Undiscounted (note the period is included in the code). |
Jun 03 2024 | REM: Maintenance Fee Reminder Mailed. |
Date | Maintenance Schedule |
Oct 13 2023 | 4 years fee payment window open |
Apr 13 2024 | 6 months grace period start (w surcharge) |
Oct 13 2024 | patent expiry (for year 4) |
Oct 13 2026 | 2 years to revive unintentionally abandoned end. (for year 4) |
Oct 13 2027 | 8 years fee payment window open |
Apr 13 2028 | 6 months grace period start (w surcharge) |
Oct 13 2028 | patent expiry (for year 8) |
Oct 13 2030 | 2 years to revive unintentionally abandoned end. (for year 8) |
Oct 13 2031 | 12 years fee payment window open |
Apr 13 2032 | 6 months grace period start (w surcharge) |
Oct 13 2032 | patent expiry (for year 12) |
Oct 13 2034 | 2 years to revive unintentionally abandoned end. (for year 12) |