Abstract: A computer-readable recording medium stores therein an information search program that causes a computer to search for text items described in a text file. The information search program causes the computer to execute receiving input of a search keyword; searching an index file for a writing keyword that includes the search keyword, the index file including writing keywords described, for respective entries, in an order identical to the order in which the text items are described in the text file; identifying an entry that corresponds to the writing keyword retrieved at the searching; and outputting the identified entry.

Abstract: An information retrieval apparatus including a first detecting unit that detects a feeder indicative of a presence of a numerical value in a file subject to retrieval in which a numeral and a character are present together; a second detecting unit that detects a number of places in the numerical value correlated to the feeder detected by the first detecting unit; and a compressing unit that compresses the numerical value into compressed information including a compression code for a numeral indicative of the number of places detected by the second detecting unit and a compression code for a numeral at each place in the numerical value, wherein the numerical value is correlated to the feeder based on an appearance frequency of a numeral included in the file.

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 method of compressing compression target data, includes: converting, by a processor, the compression target data into a compression code that is generated according to one of a first compression process and a second compression process corresponding to one of a first compression result and a second compression result where the compression target data is more compressed, based on the first compression result obtained when a first compression process is performed with respect to the compression target data, and the second compression result obtained when a second compression process is performed with respect to the compression target data, wherein the first compression process determines a code length based on information being obtained by converting the compression target data according to a predetermined algorithm and being different type from the compression target data, wherein the second compression process determines a code length based on the compression target data.

Abstract: A non-transitory computer-readable recording medium has stored therein a character data storing program. The character data storing program causes a computer to execute a process which includes: storing character data to storing places in a storage area, locations in the storage area being specified by bit strings with a predetermined length. The character data is stored to storing places specified by a plurality of types of predetermined-length bit strings that includes a bit string of a compressed code assigned to the character data.

Abstract: An information processing apparatus which manages a file which holds information including a plurality of items, includes a processor, the processor configured to: search for a file satisfying a requested search condition based on item information obtained by associating the items and the number of files including the items, and file information indicating whether or not each of the files includes each item, and upon receipt of a deletion request of a file, update the number of files of items included in the file of a deletion target in the item information, and, when the number of files becomes 0, deletes an item whose number of files becomes 0 and the number of files including the item from the item information.

Abstract: A method of controlling decompression, wherein the method includes: transmitting, by a first computer that already has stored therein compressed data that are compressed based on compression parameters, identification information for identifying the first computer to a second computer that stores therein the compression parameters; and encrypting, by the second computer, the compression parameters using the identification information received from the first computer. The compression parameters include at least a frequency of appearance and an allocated sign for each piece of character data. The method also includes: transmitting, by the second computer, the encrypted compression parameters to the first computer; decrypting, by the first computer, the encrypted compression parameters received from the second computer using the identification information; and decompressing, by the first computer, the compressed data based on the decrypted compression parameters.

Abstract: A non-transitory computer-readable recording medium has stored therein a generating program that causes a computer to execute a process including: selecting a control mode from a first control mode and a second control mode in accordance with whether a document element that includes a predetermined number or more of child elements is present in a document file, the first control mode and the second control mode determining storing locations of data in the document file from a plurality of blocks, the first control mode determining the storing locations of data in the document file for each document element in a hierarchy of the child elements, and the second control mode determining the storing locations of data in the document file for each document element in the hierarchy of the document element that includes the child elements or in the hierarchy higher than the hierarchy of the document element.

Abstract: A method includes: storing, by a processor, in a storage region represented by first character information and identification information of a first file, presence or absence information that represents whether or not the first file includes the character information or whether or not a second file that is different from the first file includes second character information, wherein the storage region stores information that represents whether or not the second file includes the second character information.

Abstract: A non-transitory computer-readable medium storing a selected character specification program that causes a computer to execute a process including detecting a character region indicating a region, in which each character of the displayed character string is displayed on a screen, based on character string display information, specifying a stroke of a closed curved line designated on the screen based on input operation information, and specifying one or a plurality of successive characters, in which a ratio of an area of a selected region based on uppermost, lowermost, leftmost, and rightmost points of the stroke of the closed curved line in the character region to an area of the character region exceeds a threshold, as selected character among a respective character of the displayed character string overlapped with the stroke of the closed curved line.

Abstract: An information processing system includes a processor configured to create, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identify based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data.

Abstract: A first encoding unit encodes, within the compression target data, each part with a sequence of the same value into the number of consecutive runs of the value. A decomposing unit decomposes the number of consecutive runs of the same value into an addition of integers belonging to a predetermined integer group. A calculating unit calculates the probability of occurrence of each integer obtained by the decomposition. A second encoding unit encodes each integer by assigning shorter codes to integers with higher probabilities of occurrence.

Abstract: A system includes circuitry configured to: read a plurality of character information and a plurality of identifiers that are included in a text file; determine whether a character information among the plurality of character information is included between the at least one pair of identifiers among the plurality of identifiers in the text file; and associate the character information with the at least one pair of identifiers when it is determined that the character information is included between the at least one pair of identifiers.

Abstract: A recording medium stores an information processing program that causes a computer to execute storing a compression symbol map group having a bit string indicating for each character code, presence or absence of the character code in a file group, and a Huffman tree whose leaf corresponding to the character code has a pointer to a compression symbol map of the character code, the Huffman tree converting the character code into a compression symbol of the character code; compressing sequentially and according to the Huffman tree, a character code to be compressed and described in a file of the file group; detecting access to the leaf at the compressing; identifying by a pointer in the accessed leaf, a compression symbol map of the character code to be compressed; and updating a bit that indicates presence or absence of the character code to be compressed, in the identified compression symbol map.

Abstract: A computer receives a retrieval request with a retrieval character string, adds control information to a region corresponding to code information included in a management region used for extending encoded data when an extension result of the code information matches a first character of the retrieval character string when the encoded data to be retrieved is sequentially extended in response to the retrieval request, and performs collation processing between the retrieval character string and character string information corresponding to data of the extension result of the code information when the control information is added to a partial region corresponding to code information to be extended in the extension.

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 includes storing to a storage device: files that include character units; first index information indicating which file includes at least one character unit in a character unit group having a usage frequency less than a predetermined frequency and among character units having common information in a predetermined portion, the usage frequency indicating the extent of files having a given character unit; second index information indicating which file includes a first character unit having a usage frequency at least equal to the predetermined frequency and among the character units having common information in a predetermined portion; and referring to the first and second index information to extract a file having character units in the first and second index information, when a request is received for extraction of a file having the first character unit and a second character unit that is included in the character unit group.

Abstract: A computer-readable recording medium stores therein an information retrieval program that causes a computer to execute a retrieval process in which files to be retrieved are narrowed down by using a bit string for each character in the files to find characters making up a retrieval keyword to retrieve a keyword identical to or related to the retrieval keyword in the files to be retrieved. The bit strings indicate the presence of the characters in the files. The information retrieval program causes the computer to execute extracting, from among the bit strings, a bit string of an arbitrary character; and compressing the extracted bit string, by using a special Huffman tree having leaves of plural types of symbol strings covering patterns represented by a predetermined number of bits and a special symbol string having a number of bits greater than the predetermined number of bits.

Abstract: An encoding method includes searching a search target symbol string within a specific range from the end of a symbol string, which has been utilized for encoding, for a match symbol string corresponding to a beginning symbol string of a symbol string to be encoded, encoding the beginning symbol string based on a distance between the match symbol string and the beginning symbol string, and a length of the match symbol string.