Abstract: Some embodiments of the present invention provide a system that executes a garbage collector in a computing system. During operation, the system obtains a throughput model for the garbage collector and estimates a set of characteristics associated with the garbage collector. Next, the system applies the characteristics to the throughput model to estimate a throughput of the garbage collector. The system then determines a level of performance for the garbage collector based on the estimated throughput. Finally, the system adjusts a tunable parameter for the garbage collector based on the level of performance to increase the throughput of the garbage collector.

Abstract: Abstraction and/or integration can be performed on information, e.g. transaction data items in standard and/or proprietary formats, using data processing systems. For example, standard-based abstraction operations can analyze transaction data items in standard format to obtain transaction segment data items, each about a transaction segment; transaction segment data items can be used to obtain and store segment group data structures, each about a type of transaction segment data items and which can also include standard-based abstraction artifacts. Abstraction operations on standard or proprietary format can automatically extract pre-integration information, such as usage attributes, useful in integration and for other purposes. Integration can be performed on transaction type attribute data, producing merged attribute data including mapping attributes, such as based on match results from associated fields of selected transaction types in different formats.

Abstract: A sales support system, a sales support method and a sales support program are disclosed. The sales support system which includes a content database, a viewing history database, an authentication unit, an application updating unit, a storage medium storing content specifying unit, a recording position information extraction unit, a corresponding content existence determination unit, a recording position data transmission unit and a recorded content relevant data transmission unit.

Abstract: A method and system for coping with slice and dice operations in data warehouses is disclosed. An external approach may be utilized, creating queries using structured query language on a computer. An algorithm may be used to rewrite the queries. The resulting predicates may be joined to dimension tables corresponding to fact tables. An internal approach may be utilized, using aggregation functions with early aggregation for creating the queries. The results of the slice and dice operations may be outputted to a user on a computer monitor.

Abstract: A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.

Abstract: An index creating unit divides text information into words and creates index information associated with schema identification information and identification information for each of the words divided. When the number of pieces of the index information stored in a file format exceeds a threshold, an index analyzing unit analyzes a distribution of a schema identification information group and an identification information group. When an analysis shows that more than a predetermined number of the schema identification information substantially match the schema identification information stored in a first rule storage unit, a first compressing unit compresses the schema identification information group using group identification information and in-group identification information stored in the first rule storage unit.

Abstract: The present invention provides a music artist retrieval system which makes it possible for users to automatically retrieve an unknown music artist similar to the user's favorite artist while actually reproducing and confirming a piece of music of the unknown artist. A music artist similarity map storing section (13) computes a plurality of similarities for a plurality of music artists and makes a music artist similarity map for the plurality of music artists based on the plurality of similarities, then stores the music artist similarity map. Here, the similarities are computed between one of the plurality of music artists and the other music artists based on features of the respective music artists. A similar artists selecting and displaying section (17) displays on a display plurality of indications related to one music artist and two or more music artists whose similarities are close to the one music artist, based on the music artist similarity map.