Abstract: Providing consistency guarantees in a data stream processing engine is provided. Consistency tracking information is attached to data streams coming into the data stream processing engine. The consistency tracking information is propagated through a plurality of streaming operators that process the data streams within the data stream processing engine. Then, the propagated consistency tracking information is used to detect a consistent state in an output stream.

Abstract: A computer implemented method, computer program product and data processing system, for optimizing a layout of a relational database on a solid state disk. The optimized layout forms multiple column to disk block assignments. Each disk block is assigned substantially the same amount of column data. A column having a size less than a greatest size of any disk block is assigned to one of multiple disk blocks. A column having a size greater than or equal to the greatest size of any disk block is allowed a multiple disk block assignment.

Abstract: Improved document annotation techniques are provided. For example, in one aspect of the invention, a technique for determining an annotation for a document includes the following steps/operations. A user-proposed annotation to be associated with the document is obtained. Then, the technique automatically determines, in accordance with a knowledge base, whether the user-proposed annotation matches at least one allowed annotation.

Abstract: A system for providing consistency guarantees in a data stream processing engine. Consistency tracking information is attached to data streams coming into the data stream processing engine. The consistency tracking information is propagated through a plurality of streaming operators that process the data streams within the data stream processing engine. Then, the propagated consistency tracking information is used to detect a consistent state in an output stream.

Abstract: An embodiment of the present invention provides a computer system including a first memory and a second memory, where the first memory is substantially faster than the second memory. A method includes steps of: inspecting a request queue for block requests from a plurality of concurrent calling processes, the request queue including a plurality of block requests not yet processed by any of the plurality of concurrent calling processes; retrieving one of the plurality of block requests, wherein each block is accessed at most once by each calling process; determining whether the retrieved block request can be fulfilled from the first memory; and returning the retrieved block to the calling process whose state indicates that the block is needed if the retrieved block request can be fulfilled from the first memory.

Abstract: A computer implemented method, computer program product and data processing system, for optimizing a layout of a relational database on a solid state disk. The optimized layout comprises forming a plurality of column to disk block assignments, wherein each disk block is assigned substantially the same amount of column data. A column having a size less than a greatest size of any disk block is assigned to one of a plurality of disk blocks. A column having a size greater than or equal to the greatest size of any disk block is allowed a multiple disk block assignment.

Abstract: The present invention provides an elegant solution for processing multi-feature queries, which considers the differing access costs associated with each feature. Access cost is a critical factor in determining how individual features should be processed in terms of retrieving through sorted or random access, and, hence, in minimizing the overall query response time. The present invention operates dynamically during query processing and seeks to minimize the total query cost in terms of number of features retrieved and cost for access. It works by evaluating different combinations of feature access plans (sorted and random access) according to the number of retrieved features and forward access costs, and it selects the lowest cost plan. Experimental results on practical data show a significant speed-up in multi-features queries using the proposed solution.

Abstract: The present invention provides an elegant solution for processing multi-feature queries, which considers the differing access costs associated with each feature. Access cost is a critical factor in determining how individual features should be processed in terms of retrieving through sorted or random access, and, hence, in minimizing the overall query response time. The present invention operates dynamically during query processing and seeks to minimize the total query cost in terms of number of features retrieved and cost for access. It works by evaluating different combinations of feature access plans (sorted and random access) according to the number of retrieved features and forward access costs, and it selects the lowest cost plan. Experimental results on practical data show a significant speed-up in multi-features queries using the proposed solution.