Abstract: A recording medium stores a program causing a computer to execute a process including: acquiring first incompatibility information, which is information for searching for a description incompatible with second software from source code that uses first software and indicates a condition for a keyword of language elements and a positional relationship between the language elements; extracting keywords from the first incompatibility information, generating first frequency information based on appearance frequency of a same keyword, and generating first order information that indicates an appearance order of the keywords estimated from a condition of the positional relationship; and based on a first degree of similarity between the first and second frequency information corresponding to second incompatibility information and a second degree of similarity between the first and second order information corresponding to the second incompatibility information, determining identity between the first and second incompa

Abstract: An information processing program that causes a computer to execute a process including: acquiring use information that is use information for a database that includes incompatibility information that indicates a rewrite method in which source code dependent on first software is made compatible with second software and registrant information that indicates a registrant of the incompatibility information, and indicates a user of the incompatibility information and a use result of the incompatibility information; identifying a type of the use result indicated by the use information; and calculating an evaluation value to be given to at least one of the user indicated by the use information and the registrant indicated by the registrant information according to the identified type based on evaluation reference information that indicates a correspondence relationship between a plurality of types of use results and a plurality of evaluation values.

Abstract: A storage medium storing an information processing program that causes a computer to execute a process, that includes acquiring first incompatibility information that indicates a feature of a first language element included in a first source code that uses first software and a rewriting method of the first language element for making the first source code compatible with second software; rewriting a syntax tree based on the rewriting method indicated by the first incompatibility information; searching the rewritten syntax tree for the second language element based on second incompatibility information that indicates a feature of a second language element included in a second source code that uses the second software and an event that occurs due to the second source code; and outputting warning information that indicates relevance between the rewriting method and the event in a case where the second language element is included in the rewritten syntax tree.

Abstract: A storage unit stores incompatibility information that is associated with a pair of first software and second software and that indicates conditions about a relationship between and attributes of two or more language elements. A processing unit generates, from a source code that indicates a request to the first software, a syntax tree that indicates a relationship between a plurality of language elements included in the source code and attributes of each of the plurality of language elements, based on a grammar of a language used for writing the source code. The processing unit specifies a description in the source code by searching the syntax tree for a language element that satisfies the conditions indicated by the incompatibility information, the description being incompatible with the second software.

Abstract: A non-transitory computer-readable storage medium storing a program that causes a computer to execute a processing, the processing including identifying, by a plurality of processes, at least one candidate for a record separation point from text data in each of a plurality of divided files, detecting, from the text data in the plurality of divided files, a text region indicating one data value based on a detection result of predetermined format code, determining that the at least one candidate that is not included in the text region is a record separation point, and transmitting a plurality of partial texts corresponding to the pieces of record data to one or more processes that transforms the plurality of partial text into a record format data, each of the plurality of partial texts being extracted from the plurality of divided files based on the determined record separation point.

Abstract: A non-transitory computer-readable storage medium storing a program that causes a computer to execute a processing, the processing including identifying, by a plurality of processes, at least one candidate for a record separation point from text data in each of a plurality of divided files, detecting, from the text data in the plurality of divided files, a text region indicating one data value based on a detection result of predetermined format code, determining that the at least one candidate that is not included in the text region is a record separation point, and transmitting a plurality of partial texts corresponding to the pieces of record data to one or more processes that transforms the plurality of partial text into a record format data, each of the plurality of partial texts being extracted from the plurality of divided files based on the determined record separation point.

Abstract: A data search device specifies a first cluster that is closest to an input query, specifies another cluster that is different from the first cluster that includes the target data and whose distance from the input query is within the first distance, by using a first distance indicating a distance from the position of the input query to the center of the first cluster, extracts the target data that belongs to the other cluster and whose distance from the input query is within the first distance or the target data that belongs to the other cluster and whose distance from the center of the other cluster is greater than a second distance and searches the target data similar to the input query from the target data that belongs to the first cluster and the target data that is extracted from the other cluster.

Abstract: A non-transitory computer-readable recording medium stores therein a retrieving control program that causes a computer to execute a process including, receiving a retrieval request including range information; estimating a number of records to be obtained by performing retrieval in a retrieval range; calculating a difference between a cost of retrieval processing time when retrieval processing is performed by a first process or thread which performs the retrieval processing for a record of the total number of records, and the cost of retrieval processing time when retrieval processing is performed by parallel retrieval; calculating a cost of time for giving a record of the estimated number of records from a plurality of processes or threads to the first process or thread; and controlling, according to a comparison result between the difference and the calculated cost of the time, whether the retrieval request is to be processed by the parallel retrieval.

Abstract: An update method executed by a computer includes: recording a history of processes executed on records in a database in accordance with a request; generating a second index, respectively, for a plurality of new records added to the database in accordance with another request, by applying a storage position to a first index of the plurality of records respectively; and reflecting, to the second index, at least one process from among the processes, the at least one process being executed after a start of the generating of the second index.

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 data management apparatus includes a storage device; and a processor that executes a procedure, the procedure including selecting a data group, each data in the data group including one of a plurality of tags, among a plurality of data, compressing the data group into a compressed data group, and storing the compressed data group in the storage device, the stored compressed data group being associated with tagging information which indicates that each data of the data group includes the certain tag.

Abstract: A computer-readable recording medium having stored therein a calculation program causing a computer to execute a process includes: dividing each of subtracted value data and subtraction value data into a plurality pieces of data in a byte; comparing sizes of each of the divided pieces of subtracted value data and each of the divided pieces of subtraction value data, which have a corresponding digit position; adding carry-down value data that is obtained from digit information of each of the divided pieces of subtracted value data, to the divided corresponding piece of subtracted value data, in accordance with a comparison result; and subtracting each of the divided pieces of subtraction value data, from the divided piece of subtracted value data, to which the carry-down value data is add, and which has the corresponding digit position.

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 data management apparatus includes a storage device; and a processor that executes a procedure, the procedure including selecting a data group, each data in the data group including one of a plurality of tags, among a plurality of data, compressing the data group into a compressed data group, and storing the compressed data group in the storage device, the stored compressed data group being associated with tagging information which indicates that each data of the data group includes the certain tag.

Abstract: A database management apparatus is provided with a setting unit that receives a snapshot request and records information indicating an extraction range to a memory, an extraction unit that sequentially extracts records and records the extracted records to another area, a monitoring unit that records information indicating an extraction-completed area and an extraction-remaining area, an update unit that judges whether a record targeted by an update instruction for update by a subsequent transaction is in the extraction-completed area, updates the update target record in the extraction-completed area if in the extraction-completed area, and records a map of the update target record in the extraction-remaining area to an area outside the extraction range and updates the map if in the extraction-remaining area, and a restore unit that updates the update target record to be the same as the map, after extraction of the update target record is completed.

Abstract: A database management apparatus is provided with a setting unit that receives a snapshot request and records information indicating an extraction range to a memory, an extraction unit that sequentially extracts records and records the extracted records to another area, a monitoring unit that records information indicating an extraction-completed area and an extraction-remaining area, an update unit that judges whether a record targeted by an update instruction for update by a subsequent transaction is in the extraction-completed area, updates the update target record in the extraction-completed area if in the extraction-completed area, and records a map of the update target record in the extraction-remaining area to an area outside the extraction range and updates the map if in the extraction-remaining area, and a restore unit that updates the update target record to be the same as the map, after extraction of the update target record is completed.

Abstract: A plurality of data stored in a database is read successively. Update contents of the data are acquired as update history, if there is an update of the data in the database during a period from a start of the data extraction to an end of the data extraction. Contents of the plurality of the data extracted are overwritten with the contents at a time of the start of the data extraction, based on the update history acquired.

Abstract: A database duplicating apparatus that extracts a data group stored in a database to duplicate a database includes a data extracting unit that sequentially extracts a plurality of data included in the data group; an update monitor that monitors an update status of a data content of the data extracted by the data extracting unit; an update-log storing unit that, when the update monitor detects an update of the data content, stores a content of the update as an update log; and a correcting unit that corrects a content of data extracted by the data extracting unit based on the update log.