Abstract: A method, computer program product, and computer system for retaining messages. Bins for having messages stored for different retention periods are provided. Each message is of a message type. Messages are received and each received message is assigned to a bin. For each message determined to have an age exceeding a retention period of the message's assigned bin, the message is reassigned to a bin having a next higher retention period.

Abstract: Provided is an ad-hoc proxy for a batch processing task within a cloud environment. The proxy may reduce overhead that results from authentication between a jobs of the processing task and a third-party service. An example operation may include one or more of dividing a processing task for a target service into a plurality of jobs that each access data from the target service, establishing an authenticated communication channel between one or more proxies on a host platform and the target service, executing, via the one or more proxies, the plurality of jobs in parallel and accessing data from the target service via the authenticated communication channel established between the one or more proxies and the target service, and returning results of the execution to the plurality of jobs.

Abstract: A method, computer program product, and computer system for retaining messages. Bins for having messages stored for different retention periods are provided. Each message is of a message type. Messages are received and each received message is assigned to a bin. For each message determined to have an age exceeding a retention period of the message's assigned bin, the message is reassigned to a bin having a next higher retention period.

Abstract: The present invention relates to a method of generating a distributed text index for parallel query processing by a number of nodes. A set of node indices is generated for text indexing a set of documents, each node text index covering a subset of the documents. For each node text index, a local frequency measure for each term of the node text index is calculated on the basis of a frequency of documents containing the term in the subset of the documents of the node. A global frequency measure for each term is calculated on the basis of a frequency of documents containing the term in the set of documents. A quality measure for each node text index is calculated on the basis of the local frequency measures of the terms of the node and the global frequency measure of the terms of the node.

Abstract: The present invention relates to a method of generating a distributed text index for parallel query processing by a number of nodes. A set of node indices is generated for text indexing a set of documents, each node text index covering a subset of the documents. For each node text index, a local frequency measure for each term of the node text index is calculated on the basis of a frequency of documents containing the term in the subset of the documents of the node. A global frequency measure for each term is calculated on the basis of a frequency of documents containing the term in the set of documents. A quality measure for each node text index is calculated on the basis of the local frequency measures of the terms of the node and the global frequency measure of the terms of the node.

Abstract: The present invention relates to a method of generating a distributed text index for parallel query processing by a number of nodes. A set of node indices is generated for text indexing a set of documents, each node text index covering a subset of the documents. For each node text index, a local frequency measure for each term of the node text index is calculated on the basis of a frequency of documents containing the term in the subset of the documents of the node. A global frequency measure for each term is calculated on the basis of a frequency of documents containing the term in the set of documents. A quality measure for each node text index is calculated on the basis of the local frequency measures of the terms of the node and the global frequency measure of the terms of the node.

Abstract: The present invention relates to a method of generating a distributed text index for parallel query processing by a number of nodes. A set of node indices is generated for text indexing a set of documents, each node text index covering a subset of the documents. For each node text index, a local frequency measure for each term of the node text index is calculated on the basis of a frequency of documents containing the term in the subset of the documents of the node. A global frequency measure for each term is calculated on the basis of a frequency of documents containing the term in the set of documents. A quality measure for each node text index is calculated on the basis of the local frequency measures of the terms of the node and the global frequency measure of the terms of the node.

Abstract: A new approach to indexing semi-structured, non-traditional data uses an external search engine accessible to a database engine through a standardized interface. An external index managed by an external search engine maps object identifiers associated with the non-traditional data to row identifiers for a table stored in the relational database. In response to a query, one or more of the object identifiers are retrieved from the external index by the external search engine. The object identifiers returned by the external search engine are then used by the database engine to retrieve one or more row identifiers from an index in the relational database. The row identifiers are then used to retrieve one or more rows from the table in the relational database.