Abstract: Transfer of desired monitoring data is enabled while restraining a data storage capacity and transfer capacity. A base system senses an alert and generates an index for specifying collection target data that is data present within a predetermined collection target time including an alert occurrence time point, records the collection target data in association with the index, into a time-series data table, and stores alert identification information in association with the index, into an index specifying table. A center system receives the alert identification information and transmits a data request for requesting the collection target data, to the base system. The base system, upon receipt of the data request, acquires the index associated with the designated alert identification information by searching the index specifying table, acquires the collection target data specified by the index from the time-series data table, and transmits the acquired data to the center system.

Abstract: An administrative computer which is connected to a plurality of search execution computers, includes: a distributed administration manager which receives graphs which retains a relation which connects data value and is configured with a group which is connected by the relation, and distributes same among a plurality of search execution computers; and a distributed search manager which, when a search condition is received, transmits the search condition to the plurality of search execution computers, and receives search results. The distributed administration manager groups the graphs with matching relations, segments the graphs which is associated with the group, and positions same on the plurality of search execution computers. The distributed search manager transmits search conditions including search conditions of the relations between the data and search conditions of the data value to each of the plurality of search execution computers, and has the search executed in parallel.

Abstract: A time-series data management method for generating a histogram from time-series data using a computer provided with a processor and a storage device, the computer storing the time-series data including a time of day and a value in the storage device, storing section information including a start time, an end time, and an identifier of the time-series data in the storage device, generating the histogram from the time-series data corresponding to the section information and storing the generated histogram in the storage device, accepting a section to be searched and selecting the histogram associated with the section to be searched, and combining the selected histograms and generating a histogram for the section to be searched

Abstract: Transfer of desired monitoring data is enabled while restraining a data storage capacity and transfer capacity. A base system senses an alert and generates an index for specifying collection target data that is data present within a predetermined collection target time including an alert occurrence time point, records the collection target data in association with the index, into a time-series data table, and stores alert identification information in association with the index, into an index specifying table. A center system receives the alert identification information and transmits a data request for requesting the collection target data, to the base system. The base system, upon receipt of the data request, acquires the index associated with the designated alert identification information by searching the index specifying table, acquires the collection target data specified by the index from the time-series data table, and transmits the acquired data to the center system.

Abstract: A search system using a table search server and a file search server as transmission destination candidates for search queries, wherein search speed is assumed to be higher for a search in the form of file data than for table data, the table data is converted to file data and stored in the file search server. Created are a search query history management table for accumulating and depositing search query history, and a characteristic determination rule management table for managing the rules of determining that the search speed is higher for a search made in the form of file data than for table data. The search system applies the characteristic determination rules to the search query history and specifies the table data. The search system acquires the specified table data from the table search server, converts the data to file data, and stores the data in the file search server.

Abstract: In a GC processing in which a memory area is managed by being divided, collection efficiency of an area is further optimized. In order to realize the technology, a calculator including an arithmetic unit and a memory includes a storage unit which stores reference source information of data which is stored in a plurality of storage areas which are allocated to the memory in each of the storage areas; and a control unit which determines a storage area in which updated reference source information is different from reference source information which is recorded in the storage unit to be an area as a release target.

Abstract: A computer includes a storage region in which an object generated by executing a program is disposed, and a control unit that performs execution of the program and releasing of the storage region. The control unit updates time information using garbage collection, a capacity of objects in a memory, or similar as a trigger, acquires information of a program generating an object and time information at the time of generation of the object which are recorded in a recording device so as to be correlated with each other when the object is generated. The control unit further detects an object which is unnecessary to execute a subsequent program and acquires the time information, and records a difference between the time information at the time of the generation and at the time of the detection in the recording device so as to be correlated with the information of the program.

Abstract: A memory use amount used by each object can be calculated for each of a plurality of pieces of generator property information that is information related to generation of data such as user information and request information. A computer for executing a program to generate data executes a step of specifying, from a storage device in which the plurality of pieces of generator property information on the data and identification information that the data has are associated and held, data corresponding to each piece of the generator property information and calculating a memory use amount of the specified data, and a step of outputting the calculated memory use amount to an interface. Further, a data structure of the data has a control area for storing information on control of the data and a data area, and the computer inserts the identification information into the data area.

Abstract: An administrative computer which is connected to a plurality of search execution computers, includes: a distributed administration manager which receives graphs which retains a relation which connects data value and is configured with a group which is connected by the relation, and distributes same among a plurality of search execution computers; and a distributed search manager which, when a search condition is received, transmits the search condition to the plurality of search execution computers, and receives search results. The distributed administration manager groups the graphs with matching relations, segments the graphs which is associated with the group, and positions same on the plurality of search execution computers. The distributed search manager transmits search conditions including search conditions of the relations between the data and search conditions of the data value to each of the plurality of search execution computers, and has the search executed in parallel.

Abstract: A method of managing a memory in a computer system including a processor executing programs and the memory, the memory including a first area, which is managed by a garbage collector, and a second area, which is not managed by the garbage collector, the method including the steps executed by the processor of: checking a reference relation of basic point data associated with the second area by tracing references from the basic point data; when the reference relation of the basic point data has a structure including a reference to data belonging to the same class as the class of the basic point data, determining that particular data out of data constituting the structure is prohibited from being migrated to the second area; and migrating data stored in the first area out of data remaining after excluding the particular data from the data constituting the structure to the second area.

Abstract: It is provided a memory management method for releasing an unnecessary area in a memory area used by a program stored in the memory and executed by the computing device. The memory management method including the step of: setting in the memory, a first memory area which is used to execute the program; setting in the memory, a second memory area which can be operated by the program; setting a utilized area in the second memory area based on an instruction from the program; storing objects including data in the utilized area of the second memory area based on an instruction from the program; determining whether the program uses the objects stored in the utilized area within the second memory area; and releasing, by the computing device, the utilized area occupied by an object that is not used by the program among the objects stored in the utilized area.

Abstract: A memory management method is provided to manage a memory in which areas of a garbage collected Java heap memory and a non-garbage collected external heap memory can be secured, by using a program executed by a processor in a computer. If it is judged that there is no reference to all data arranged in the external heap memory or starting point data of reference relations included in the all data, from data arranged outside the external heap memory, then the external heap memory is judged to be capable of being deallocated. As a result, it becomes possible to implement memory management in which garbage collection needing a long time program stop is not conducted and an additional API is not used.

Abstract: Disclosed is a method for analyzing a program that includes database operation statements, including: a first procedure for analyzing control flow of a program and data used in the program, on the basis of the program and the execution result of the program; a second procedure for analyzing the dependency relationship among a plurality of database operation statements, in accordance with the analysis result of the first procedure and the operation details of the plurality of database operation statements; a third procedure for analyzing the propagation path of the incorrect operation in the opposite direction to the control flow, on the basis of the analysis result of the first procedure and the analysis result of the second procedure and taking as a starting point for analysis a predetermined program location which is operating incorrectly; and a fourth procedure for displaying program statements on the propagation path obtained by the third procedure.

Abstract: A computer capable of managing reference relationships between data executes access of first and second storage regions in which stored data can be altered and a third storage region in which stored data cannot be altered. The computer sets specification data in the first storage region for accessing data stored in the second and third storage regions, and shifts data having a reference relationship with the specification data from among the data stored in the third storage region to the second storage region. If the accessing occurs while the shifting is being carried out and the data has already been shifted to the second storage region, the reference information for the specification data is amended to the shifted location of the data, and all of the references to data in the third storage region that are referenced by the specification data are amended, thereby releasing the third storage region.

Abstract: A computer manages memory by dividing the memory into at least a first storage area which stores generated data, and a closable region made of at least one second storage area and at least one third storage area. The second storage area constitutes a destination to which the data stored in the first storage area is to be moved. Data is moved from the first storage area to the second storage area; and the second storage area to which the data has been moved is changed to the third storage area. An update to the data stored in the third storage area is detected and the data of which the update has been detected is moved to a closable region other than the third storage area.

Abstract: Memory management by garbage collection involves a memory area that is allocated in a computer. Data is created in the memory area in accordance with a program executed by a processor of the computer, and it is checked whether or not data necessary to execute the program exists in the memory area to be released, in response to an explicit instruction to release the memory area. As a result of the check, if data necessary to execute the program does not exist in the memory area, the memory area is released. As a result of the check, if data necessary to execute the program exists in the memory area, the data is moved to a memory area different from the memory area to be released.

Abstract: A computer includes a storage region in which an object generated by executing a program is disposed, and a control unit that performs execution of the program and releasing of the storage region. The control unit updates time information using garbage collection, a capacity of objects in a memory, or similar as a trigger, acquires information of a program generating an object and time information at the time of generation of the object which are recorded in a recording device so as to be correlated with each other when the object is generated. The control unit further detects an object which is unnecessary to execute a subsequent program and acquires the time information, and records a difference between the time information at the time of the generation and at the time of the detection in the recording device so as to be correlated with the information of the program.

Abstract: Disclosed is a method for analyzing a program that includes database operation statements, said method including: a first procedure for analyzing control flow of a program and data used in the program, on the basis of the program and the execution result of the program; a second procedure for analyzing the dependency relationship among a plurality of database operation statements, in accordance with the analysis result of the first procedure and the operation details of the plurality of database operation statements; a third procedure for analyzing the propagation path of the incorrect operation in the opposite direction to the control flow, on the basis of the analysis result of the first procedure and the analysis result of the second procedure and taking as a starting point for analysis a predetermined program location which is operating incorrectly; and a fourth procedure for displaying program statements on the propagation path obtained by the third procedure.

Abstract: Memory management by garbage collection involves a memory area that is allocated in a computer. Data is created in the memory area in accordance with a program executed by a processor of the computer, and it is checked whether or not data necessary to execute the program exists in the memory area to be released, in response to an explicit instruction to release the memory area. As a result of the check, if data necessary to execute the program does not exist in the memory area, the memory area is released. As a result of the check, if data necessary to execute the program exists in the memory area, the data is moved to a memory area different from the memory area to be released.

Abstract: Memory management by garbage collection involves a memory area that is allocated in a computer. Data is created in the memory area in accordance with a program executed by a processor of the computer, and it is checked whether or not data necessary to execute the program exists in the memory area to be released, in response to an explicit instruction to release the memory area. As a result of the check, if data necessary to execute the program does not exist in the memory area, the memory area is released. As a result of the check, if data necessary to execute the program exists in the memory area, the data is moved to a memory area different from the memory area to be released.