Abstract: The encoding apparatus registers, in a dynamic dictionary, strings in input text data that are not contained in a static dictionary. The encoding apparatus adds, to first hashed data obtained by individually N-dimensionally hashing words contained as registered items in the static dictionary, hashed data obtained by individually hashing strings registered in the dynamic dictionary. The encoding apparatus 100 determines, by using the first hashed data, whether each input string has been registered in the static dictionary 124 and whether the string has been registered in the dynamic dictionary 122. In accordance with the result of the determination, the encoding apparatus 100 performs encoding based on a content registered in the static dictionary or the dynamic dictionary.

Abstract: A power supply includes a first switching unit, a power restriction unit connected between the first switching unit and a load, a second switching unit connected between the power restriction unit and the load, a controller configured to output a control signal to the first switching unit and the second switching unit, and an adjusting unit configured to adjust input of the control signal to the second switching unit, and the second switching unit is operated selectively in accordance with the control signal.

Abstract: An information processing apparatus according to an embodiment determines whether a target character string is registered in a first dictionary, the target character string being a compression target contained in input data, outputs a compression code corresponding to the target character string when the target string is registered in the first dictionary, searches the target character string in first data when the target character string is not registered in the first dictionary, the first date accumulating character strings that are a part of the input data and have been determined to be not registered in the first dictionary, registers a matched character string in a second dictionary different from the first dictionary when the target character string is searched in the first data and outputs a compression code corresponding to a registration number of the target character string in the second dictionary.

Abstract: An extracting method that is executed by a computer. The extracting method includes storing first information into a storage device, wherein the first information indicates for each of a plurality of files and for each of a plurality of character data, whether the file includes the character data; storing second information into the storage device when a given file included in the files is updated, wherein the second information indicates for each of the character data, whether the given file includes the character data; and extracting a file group from the files when a search request is received, wherein from the file group, a file is excluded that is indicated by the first information and the second information not to include a character data to be searched for included in the search request.

Abstract: A method includes: setting a first and a second storage regions; first creating a first compression code of a compression target data in a file using a identifier indicating the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the comparing; and storing the compression target data into the first storage region associated with a identifier indicating the data in the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: An information processing apparatus according to an embodiment determines whether a target character string is registered in a first dictionary, the target character string being a compression target contained in input data, outputs a compression code corresponding to the target character string when the target string is registered in the first dictionary, searches the target character string in first data when the target character string is not registered in the first dictionary, the first date accumulating character strings that are a part of the input data and have been determined to be not registered in the first dictionary, registers a matched character string in a second dictionary different from the first dictionary when the target character string is searched in the first data and outputs a compression code corresponding to a registration number of the target character string in the second dictionary.

Abstract: An encoding unit encodes first encoding each of first words in a target file utilizing a first code allocation rule, each of the first words having an appearance frequency larger than an appearance frequency of a word positioned at a given ordinal rank in word frequency information, the word frequency information being information of word frequencies in a plurality of files that the target file is included, the first code allocation rule being generated from the word frequency information, and the encoding unit encodes at least a second word in the target file into a code with a first code length utilizing a second code allocation rule, the second word having appearance frequency smaller than the appearance frequency of the word positioned at the given ordinal rank in the word frequency information, the second code allocation rule being different from the first code allocation rule.

Abstract: A method includes: setting a first and a second storage regions; first creating a first compression code of a compression target data in a file using a identifier indicating the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the comparing; and storing the compression target data into the first storage region associated with a identifier indicating the data in the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: An information processing apparatus splits a word to be encoded into a plurality of word elements. The information processing apparatus obtains a plurality of hashed word elements by hashing each of the plurality of word elements, number of bits of each of the plurality of hashed word elements corresponding to a position of each of the plurality of word elements in the word, respectively. The information processing apparatus outputs an encoding result that the plurality of the hashed word elements are combined.

Abstract: A disclosed data structure of a phrase tree includes, as data of each node in the phrase tree, a data block including a first area for holding a code for a character or a character string, a second area for holding, for each character that will be used, an appearance sequential number of a second character that appears next to the character or the character string, and a third area for holding, according to the appearance sequential number, a number of appearances or a code corresponding to a character string comprising the character or the character string and the second character when the number of appearances exceeds a threshold.

Abstract: A non-transitory computer-readable recording medium has stored therein a compression program that causes a computer to execute a process.

Abstract: A method includes: setting a first and a second storage regions; first creating a first compression code of a compression target data in a file using a identifier indicating the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the comparing; and storing the compression target data into the first storage region associated with a identifier indicating the data in the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: A non-transitory computer-readable recording medium has stored therein a program for causing a computer to execute a process. The process includes: when obtaining a character string including one unit of character information at one position in the character string, referring to presence/absence information indicating whether or not at least one character string, in a character string group including a plurality of character strings to which compression codes have been assigned, includes the one unit of character information at the one position; and searching the character string group for the obtained character string except for a case that the presence/absence information indicates that none of the character strings included in the character string group include the one unit of character information at the one position.

Abstract: A non-transitory computer-readable recording medium has stored therein a compression program that causes a computer to execute a process.

Abstract: A database control method comprising a first main system processing in which, upon first data being stored in a second storage unit included in a second server communicably connected with the first server, the first data is stored in a first storage unit following instructions from a host computer, a first inhibiting processing in which, upon detecting an abnormality in communication with the second server, storing the first data in the first storage unit following instructions from a host computer is inhibited, a first query processing performing a first query to an arbitrating device arbitrating between the first server and the second server, and a processing executing or stopping the first main system processing in accordance with instructions from the arbitrating device.

Abstract: An AND operation is performed for an integrated appearance map of a compression code of character data “”, an integrated appearance map of a compression code of character data “”, and an integrated deletion map for a segment. The AND result is “1100” and it is found that the character data “” and “” are likely to be present in the segments (sg1(1)) and (sg1(2)). Since the segments are specified from the AND result, the AND operations are performed. As a result, the segments are specified and the AND operations are performed. As a result, a file number 3 is specified from the segment (sg0(1)) and a file number 19 is specified from the segment (sg0(5)). Therefore, it is found that both of the character data “” and “” are present in compression files (f3) and (f19).

Abstract: An extracting method that is executed by a computer. The extracting method includes storing first information into a storage device, wherein the first information indicates for each of a plurality of files and for each of a plurality of character data, whether the file includes the character data; storing second information into the storage device when a given file included in the files is updated, wherein the second information indicates for each of the character data, whether the given file includes the character data; and extracting a file group from the files when a search request is received, wherein from the file group, a file is excluded that is indicated by the first information and the second information not to include a character data to be searched for included in the search request.

Abstract: A disclosed data structure of a phrase tree includes, as data of each node in the phrase tree, a data block including a first area for holding a code for a character or a character string, a second area for holding, for each character that will be used, an appearance sequential number of a second character that appears next to the character or the character string, and a third area for holding, according to the appearance sequential number, a number of appearances or a code corresponding to a character string comprising the character or the character string and the second character when the number of appearances exceeds a threshold.

Abstract: A distributed transaction system includes a plurality of log groups each having a unique identifier assigned thereto, a data storage device storing data and a log storage device storing a log of the data. A table is provided in each of the log groups and has registered therein information about a database management device having the management right of each of the log groups. Wherein in response to the management right of the global representative log group moving to another database management device during an in-doubt state period of the two-phase commit, the table is rewritten to reflect moving of the management right of the global representative log group.

Abstract: A distributed transaction system includes a plurality of log groups each having a unique identifier assigned thereto, a data storage device storing data and a log storage device storing a log of the data. A table is provided in each of the log groups and has registered therein information about a database management device having the management right of each of the log groups. Wherein in response to the management right of the global representative log group moving to another database management device during an in-doubt state period of the two-phase commit, the table is rewritten to reflect moving of the management right of the global representative log group.