Abstract: At least one region of a heap that includes memory allocations is analyzed, using age and occupancy criteria, across a number of local garbage collection cycles using a processor executing a region-based garbage collector. Based upon the analyzed age and occupancy criteria of the at least one region, at least one stable region in age and occupancy is identified among the at least one region of the heap across the number of local garbage collection cycles. Maintenance of a remembered set (RS) of external references into the at least one stable region is temporarily stopped for each identified stable region during at least one additional local garbage collection cycle.

Abstract: The present disclosure discloses a method and system for data deduplication. The method comprises: acquiring meta data and multiple data chunks corresponding to at least one original data object, which are generated by using a data deduplication method; combining the acquired multiple data chunks into a new data object; performing deduplication on the new data object to generate new meta data and new data chunks corresponding to the new data object; and storing the meta data corresponding to the at least one original data object, the new meta data corresponding to the new data object, and the new data chunks. The method and system can further improve deduplication ratio, lower data storage amount, and save costs.

Abstract: Mechanisms for performing database queries are provided. With these mechanisms, in response to a query request, a query plan intended for minimum query response time and a query plan intended for minimum query total time for the query request are obtained execution of the minimum query response time query plan and the minimum query total time query plan is started. Before the execution of the minimum query total time query plan reaches a specified point, an initial query result obtained from the execution of the minimum query response time query plan is output. In response to the execution of the minimum query total time query plan reaching the specified point, continuing the execution of the minimum query total time query plan to output remaining query results.

Abstract: In a method for searching for a previously visited web page, a first computer receives a plurality of search parameters from a second computer. The plurality of search parameters include a parameter identifying a characteristic of an element of a previously visited web page and a parameter identifying a weight of confidence in a recollection of a user that the element has the characteristic. The first computer searches for the characteristic of the element in a database including one or more characteristics of elements of indexed web pages. The first computer finds a match between the characteristic of the element and a characteristic of an element of an indexed web page of the indexed web pages. The first computer creates a list including an identification of the indexed web page. The first computer sends the list to the second computer.

Abstract: A search method includes the step of creating a list of candidate probe words. For each candidate probe word, the number of item descriptions that contain the candidate probe word is counted. Q probe words are chosen whose word count most equally divides the number of remaining item descriptions into q+1 subgroups. The q probe words are presented for selection. Based on the selection, the list of probe words is pruned to eliminate items that that were not selected. The counting step, choosing step, presenting step and pruning step are repeated until a final list of items remain.

Abstract: At least one region of a heap that includes memory allocations is analyzed, using age and occupancy criteria, across a number of local garbage collection cycles using a processor executing a region-based garbage collector. Based upon the analyzed age and occupancy criteria of the at least one region, at least one stable region in age and occupancy is identified among the at least one region of the heap across the number of local garbage collection cycles. Maintenance of a remembered set (RS) of external references into the at least one stable region is temporarily stopped for each identified stable region during at least one additional local garbage collection cycle.

Abstract: A method and a system for backing up terminal data are disclosed. The scheme is used for solving technical problems that existing ways for backing up terminal data have a low duplicating efficiency and resources are wasted seriously. The scheme creates a terminal index table to maintain data information in a terminal device; when the terminal device newly creates or modifies data contents, information of the index items in the terminal index table and corresponding data contents are sent to a network server; the network server also creates a server index table corresponding to the terminal index table, and the network server stores or deletes data contents of the terminal device according to information such as types and numbers of index items. The scheme can back up terminal data rapidly and simplifies the check procedure, thereby saving memory resources of the terminal device and improving backup efficiency.

Abstract: A computer-implemented method for monitoring an object-oriented application is disclosed. A transaction-representative-digraph is built based upon a real-time running of the application, and the digraph contains nodes of a plurality of replaceable classes. A key node is selected based upon invocation relationships between the nodes. A monitor program is instrumented at the selected key node.

Abstract: Relationships between digital text volumes in a corpus are identified by comparing a plurality of digital text volumes in the corpus to identify clusters of similar volumes. For a given cluster, the pages of pairs of volumes within the cluster are compared to determine page similarity data, the page similarity data indicating degrees of similarity between the compared pages. The relationships between pairs of volumes in the clusters are classified based on the similarity data.

Abstract: Data retention requirement rules may be created to have an area association, a minimum retention period specification, and a maximum retention period specification associated with one or more rules. Users may be assigned to one or more areas of at least one rule. Data objects may associated with one or more areas that may be associated with a rule. As the rules are updated and/or changed, the minimum and maximum periods in different rules may be compared in real time to implement a data retention policy that automatically deletes, preserves, and/or prevents access to data objects according to the each of the rules.