Abstract: A stream of data can be estimated by a model to produce an estimated equation. The estimated equation can be used to calibrate a response to a SQL type join query.

Abstract: A proposal is made of a file management system and method capable of reliably deleting unnecessary data. In a file management console and method for reading or writing data of a file from or in a first volume, which is provided by a storage device, in response to a request sent from a host computer, one snapshot or multiple snapshots that relate to the first volume and can be updated are created. In response to an externally issued designated file deletion command, a designated file is deleted from all of the first volume and snapshots or part thereof specified in the deletion command. At this time, the data items of the designated file in the first volume and/or snapshots from which the designated file should be deleted are overwritten with invalid data. Moreover, pieces of management information on the designated file are changed to a reference-disabled state.

Abstract: A mechanism works in conjunction with a DB2® Log and an analysis tool, such as BMC's Log Master™, to handle logged data for Large Objects (LOBs) stored in tables of a DB2 database system. A plurality of controls track data logged for the LOBs. The mechanism reads log records from a DB2 Log and uses the controls to determine which of the tracked LOBs is associated with the log records and obtains data from those associated log records. The mechanism builds keys to index the data and stores the keys and the data in a Virtual Storage Access Method store having Key Sequenced Data Sets maintained separate from the log record store for the DB2 Log. When requested by the analysis tool, the data in the store can be reassembled using the keys and map records in the first store that map the logged data for the tracked LOBs.

Abstract: Providing a comparison of a set of similar items includes: receiving from a first member of an online community a selection of a stored prior comparison created by another online community member of a set of similar items; providing to the first member a template for the comparison, the template being at least partially pre-populated using data from the stored prior comparison created by the other online community member; and receiving from the first member a submission of the comparison, wherein the comparison includes one or more modifications as made by the first member to the template.

Abstract: An intent guessing system receives partial user queries as they are entered by the user. The partial user queries are compared with different intents derived from previously logged queries. Guesses are made as to which of the intents are associated with the partial user query. The intent guesses are then provided as responses to the user query. Features are identified for the earlier logged queries and associated with the derived intents. The derived intents and associated features are then used to identify intents for the partial user queries.

Abstract: Methods and apparatus, including computer program products, for parallel processing of assigned table partitions. In general, a group of data may be received and at least a portion of the data may be caused to be assigned to an application server to process the data based at least in part on the application server and the at least a portion of the data being assigned to a same segment. A segment may represent one or more partitions of data of a database, such as a multidimensional database or a flat database. The data that is processed may be payment items that are processed as part of payment order processing by a payment engine.

Abstract: A system and method to navigate through a media item catalog and generate recommendations using behavioral metrics such as correlation metrics (FIGS. 1,2) from a knowledge base (400) of mediasets (FIG. 4, 1-7). One implementation uses a knowledge base comprising a collection of mediasets. Various metrics (Metric 1-Metric m) among media items (m1 . . . ) are considered by analyzing how the media items are grouped to form the sets in the knowledge base (400). Such metrics preferably are stored in a matrix (100) that allows the system to dynamically build appropriate navigation lists (FIG. 3) from media items that a user selects (FIG. 5).

Abstract: The invention relates to a method for comparing computer-based and data-processing models of a complex system, with a first model and a second model of the system, whereby the models reflect a model of a system behavior by means of predefined objects which represent activities and units within the system. The inventive method comprises the steps of comparing the models and destination of corresponding respective predefined objects of the first and second model, detecting differences in attributes of corresponding predefined objects and outputting the differences to a user. The use of predefined objects, i.e. of objects that pertain to a known set of types, enables a more efficient comparison of models than in unstructured models.

Abstract: To guarantee that contents of an update by a transaction in a parallel database management system. A database management system includes a replica database management unit that manages the replica database, records synchronous information at a timing at which one of the transaction generated is valid in every database management unit and other transactions are invalid in every database management unit, extracts update information and the synchronous information for creating the replica database from the update logs, and causes the replica database management unit to import the update information of each transaction that has become valid before the synchronous information was recorded.

Abstract: A computer system and method is disclosed for mining current and archived address data in order to identify a preferred address for each service point in a territory. The data mining system may start in response to the presentation of a candidate address for matching. The set of mined data may be prioritized by clustering like characteristics, building similarity matrices, and by constructing dendrograms with nodes joined according to common characteristics. A computer system and method for maintaining a central database of preferred addresses is also disclosed. Selected address data gathered in a queue may be scored by characteristic, grouped by consignee location, and staged for processing. The scored queue of data may be prioritized by clustering like characteristics, building similarity matrices, and by constructing dendrograms.

Abstract: In a method of and a system for deduplicating backed-up data backup clients create respective backup tables comprising a list of files and respective file types to be backed up. A backup server receives backup tables from the backup clients. The backup server merges the received backup tables to form a merged backup table. The backup server sorts the merged backup table according to file type from a file type yielding a best deduplication ratio to a file type yielding a worst deduplication ratio, thereby forming a sorted backup table. The backup server requests the files listed in the sorted backup table, in order, from the backup clients. The backup server deduplicates files received from the backup clients, in order, using deduplication parameters optimized according to file type. The method calculates an updated deduplication ratio for each deduplicated file type. Examples of deduplication parameters include chunking techniques and hashing techniques.

Abstract: One embodiment includes a system providing application-layer functionality between one or more database clients and one or more database servers. The system includes one or more decoders residing at a decoding layer above a network layer. The decoders reside at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations. The decoders receive database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients, decode the database messages, and extract query-language statements from the database messages. The system also includes an application residing at an application layer above the decoding layer. The application resides at the first network location. The application receives and processes query-language statements extracted at the decoders.

Abstract: This is an example of a new method for optimization of database queries which uses an asynchronous task which keeps the most current status of the database objects by directly interfacing the existing storage management system. This asynchronous task in combination with query plan and cache data is able to aid in detecting and choosing “warm” query costing alternatives. The cold/warm status information of the asynchronous task helps query optimizer to determine: if it is suitable to use “warm” costing for a new query optimization; validate previous decisions to use a “warm”-optimized query plan, when it comes to potentially reuse and run with such a plan again; decide whether it's worthwhile to still cache such a plan in the plan cache.

Abstract: Processing non-Boolean term conditions in database queries. A query that is a request for data in a database is received and includes at least one uneven non-Boolean term condition that spans multiple tables in the database. The non-Boolean term condition is split into separate portions, each of the portions providing a Boolean term that can be satisfied by accessing one table in the database. The separate portions are executed independently to find at least one data result in the database that satisfies the Boolean term of each separate portion, and the data result from each separate portion are combined into a final result that satisfies the query.

Abstract: A method for accessing a database is provided. The method includes creating in a design environment a file that defines a metadata. The metadata relates at least one business object and at least one query. The method also includes communicating the file to a mobile device, storing the file on the mobile device, and transforming the file into a binary structure at an initial run of a computer application running on the mobile device. The binary structure is adapted to be read by the computer application. The method also includes recording the binary structure in a memory of the mobile device. A method for providing database access for a plurality of files with a limited number of database access channels is provided. A method for is provided for accessing a database in a computing environment for a plurality of recordsets. Each of the plurality of recordsets is associated with a database access channel for fetching records of the plurality of recordsets from the database upon occurrence of a preselected event.

Abstract: A system for use in a distributed environment comprising a first data processing system having a first entity (e.g. and object) and a second data processing system having a second entity. The first entity sends a request for an operation associated with the second entity. The request comprises an operation identifier in a first format (e.g. a first national language) and the operation comprises an operation identifier in a second format (e.g. a second national language). The environment also comprises a data structure comprising an association between the operation identifier in the first format and the operation identifier in the second format. The system comprises an intercept component for intercepting the request, a search component for searching the data structure for the operation identifier in the first format and a map component for mapping the operation identifier in the first format to the operation identifier in the second format.

Abstract: Under the present invention, a method, system, and program product for preventing an unread activity from being sent back (i.e., bounced-back) to its originating server during a replication operation are provided. The method includes: storing an identification of an originating server of a replicated unread activity, the unread activity being associated with a read/unread status of an email, in an unread log of a receiving server; during a subsequent replication process initiated by the receiving server, preventing replication of the unread activity back to the originating server; during the subsequent replication process, replicating the unread activity to at least one other server; and storing the identification of the originating server with the unread entry.

Abstract: A system architecture optimized for pattern match applications is provided. This system architecture includes a host computer and a pattern match accelerator (PMA), which in turn includes one or more pattern match units (PMUs) and PMU control logic. The PMU control logic can divide a database, transmitted by the host computer, such that each of the PMUs receives a database portion. Each PMU includes a main memory for storing the database portion and a programmable logic device (PLD). The PLD can perform a search and score operation on its database portion. Advantageously, the PLD can be configured to generate an index of the database portion, and then configured to perform the search and score operation using that index. The PMU control logic can assemble the results of the pattern match application from each of the PMUs.

Abstract: Schema information is provided with transmission of a data object. When a data object is converted to a transmission format, schema information for the object type is added to the transmission format element. The unmarshaling code uses the schema information to update a schema registry at the receiving end. The schema registry is used as a tool for converting the transmission format element back to the data element. The next time an object of that object type is sent to the recipient, the schema information is not added to the transmission format element.

Abstract: In an information-processing apparatus which provides one or more clients with a function that needs exclusive access control, a first management unit manages a series of first processing steps and incidental information in a state where a session with a client is maintained. A second management unit manages a series of indivisible second processing steps performed by using the function that needs exclusive access control. The first management unit starts the management of the first processing steps when a management start request is received from the client or when a request other than the management start request is received.