Abstract: Methods, systems, and computer program products for dynamically adjusting computer resources, as appropriate, in response to predictions of query runtimes as well as for rendering costs of the computer resources actually utilized, which costs are consistent with consumer demands.

Abstract: A non-curling flexible food warmer with evenly heated surface for use in table-top banquet style settings with an integrated temperature control and with transversely oriented heating elements such that it may be readily rolled up for storage without damage to the heating elements. In one embodiment the body of the food warmer also has transversely oriented channels that permit the warmer to be folded accordion style without damage to the heating elements.

Abstract: Multiple database queries are satisfied with the same data in a manner that assures the data is current and without having to interrogate the database for each query. In a first embodiment, all queries that are received during the processing of a first query after interrogation of the database has begun for the first query are evaluated to determine whether the result set returned for the first query will satisfy the queries received during processing of the first query. If so, the result set returned for the first query is used to generate result sets for the subsequent compatible queries received during the processing of the first query. In a second embodiment, queries are delayed and grouped, and a new query is then processed for each group that returns a result set that satisfies all of the queries in the group. In both cases, the result set for one query is used to generate a result set for a different query.

Abstract: Embodiments of the invention may be used to increase query processing parallelism of an in-memory database stored on a parallel computing system. A group of compute nodes each store a portion of data as part of the in-memory database. Further, a pool of compute nodes may be reserved to create copies of data from the compute nodes of the in-memory database as part of query processing. When a query is received for execution, the query may be evaluated to determine whether portions of in-memory should be duplicated to allow multiple elements of the query (e.g., multiple query predicates) to be evaluated in parallel.

Abstract: A method and apparatus distributes database query joins on a multi-node computing system. In the illustrated examples, a join execution unit utilizes various factors to determine where to best perform the query join. The factors include user controls in a hints record set up by a system user and properties of the system such as database configuration and system resources. The user controls in the hints record include a location flag and a determinicity flag. The properties of the system include the free space on the node and the size join, the data traffic on the networks and the data traffic generated by the join, the time to execute the join and nodes that already have code optimization. The join execution unit also determines whether to use collector nodes to optimize the query join.

Abstract: A system is adapted to remove one or more contaminants, particularly phosphorus, from an influent. The system includes a first section receiving the influent and discharging a first flow. A first coagulant inlet is positioned upstream of the first section and is in fluid communication with the influent to introduce a first coagulant selected to precipitate the contaminant. A second section receives the first flow and discharges a second flow, and a third section including a disc filter receives the second flow and discharges an effluent. A second coagulant inlet is positioned downstream of the first section and upstream of the third section to introduce a second coagulant selected to precipitate the contaminant.

Abstract: An apparatus and method for a query governor to govern query execution in a parallel computer system with one or more networks. The query governor uses a network monitor to gather network status information to determine how to govern query execution. The query governor may also use historical information of previous query execution stored in a query file to determine if the query should be allowed to execute. The query governor may also use node and network restrictions to determine what networks the query can use.

Abstract: An apparatus and method optimize a query in a computer database system having a DISTINCT specifier. An SQL SELECT statement with a DISTINCT specifier is analyzed to determine if the expression can be optimized, and if so, the SELECT statement is reformulated to improve system performance. In preferred embodiments, the query optimizer eliminates the DISTINCT specifier in the outer select statement to reformulate the query. In other preferred embodiments, a query optimizer reformulates the query before being sent to the database manager to optimize the query to improve system performance.

Abstract: In a networked computer system that includes multiple interconnected nodes, a commitment control mechanism allows designating certain portions of a record in an in-memory database as mandatory and other portions of the record as secondary, and performs mandatory commitment control once all the mandatory portions are available even if one or more secondary portions are not yet available. The secondary portions may be under separate commitment control that is asynchronous to the commitment control for the mandatory portions, or may be under no commitment control at all. The result is a commitment control mechanism that performs commitment control for portions of a record that are marked mandatory even when one or more of the portions marked secondary are not available.

Abstract: Embodiments of the invention may be used to normalize data stored in an in-memory database on a parallel computer system. The data normalization may be used to achieve memory savings, thereby reducing the number of compute nodes required to store an in-memory database. Thus, as a result, faster response times may be achieved when querying the data. In one embodiment, normalization may be performed in a manner to avoid datasets that cross physical or logical boundaries of the compute nodes of a parallel system.

Abstract: A method for a variable direction of view endoscope used in combination with an image guided surgical system to provide new diagnostic and surgical capabilities. The method provides the following capabilities: greatly improved endoscopic orientation capabilities, global monitoring of endoscopic viewing direction, and greatly improved surgical approach and procedure planning.

Abstract: An apparatus, program product and method improve reporting of performance data in computing systems having uncapped partitions, or partitions that can borrow computer resources. A system measures or otherwise determines time of processor use or another metric that relates to the actual use of a computer resource by the uncapped logical partition. The metric is determined during a computer operation that may include a thread or job, and that may span an interval or period of intervals. The system uses the metric to estimate what the response time would have been if a capped logical partition was alternatively used. Information derived from this estimated response time is reported to the user.

Abstract: An apparatus and method define the concept of a “database breakpoint.” One or more conditions in the database are specified as a database breakpoint in a debug environment for debugging a computer program that accesses the database. When the database conditions exist, one or more debug functions may be performed with respect to the execution of the computer program. Examples of debug functions include halting execution of the computer program and halting operations to the database by other programs. With both the computer program and database halted, the user may then interrogate the database to determine its state, and may interrogate the program to determine its state. Database breakpoints greatly enhance the utility of a debugger by providing additional conditions for debugging a computer program that accesses a database.

Abstract: A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

Abstract: A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

Abstract: A database system has a contention monitor which determines when the level of contention for accessing or inserting records in the database rises above a threshold, and inhibits non-critical access to the database to reduce the level of contention. In a preferred embodiment, the level of contention is determined by periodically measuring the time for an INSERT operation on the database, and comparing the time to a threshold derived from a baseline time measurement for the operation during a time of normal database activity. Thus the contention level is inferred from the time to do the operation, in this case the INSERT query. In one embodiment, the contention monitor notifies a system administrator to take action to reduce the contention. In another embodiment, the contention monitor informs the system to take action automatically according to predetermined selections by the system administrator.

Abstract: A method for a variable direction of view endoscope used in combination with an image guided surgical system to provide new diagnostic and surgical capabilities. The method provides the following capabilities: greatly improved endoscopic orientation capabilities, global monitoring of endoscopic viewing direction, and greatly improved surgical approach and procedure planning.

Abstract: A computer-implemented method, system and computer product including a scheduling manager residing in memory; whereby the scheduling manager dynamically manages access of additional computer resources to be applied to work items of a program based on their valuations relative to the processing costs thereof.

Abstract: In an embodiment, content is received on a channel between a scheduled start time and a scheduled stop time. A schedule specifies a planned transmission of a scheduled program between the scheduled start time and the scheduled stop time. The received content is recorded to a saved program. A determination is made that the saved program includes interruption content that is different from lost content of the scheduled program. A request for the lost content is sent to a content provider, the lost content is received from the content provider, and the interruption content is replaced in the saved program with the lost content. The request includes a begin time of the lost content relative to a beginning of the scheduled program and an amount of the lost content.

Abstract: A query access plan for executing a database query is dynamically selected from among multiple alternative query access plans based on the availability of computer resources allocated for running the query. Preferably, a first query access plan is generated based on resources then available, and if it is possible to provide additional resources, one or more alternative plans are generated based on the additional resources. If an alternative plan is significantly better than the original plan based on a comparison of query related parameters, the alternative is chosen for executing the query. Additional resources for running the query may be provided from logically partitioned and/or grid environments.