Abstract: An apparatus, program product and method utilize one or more usage statistics, which are reflective of what data is actually and/or likely to be used by a client when processing a database query, to reduce or eliminate the transfer of unnecessary data between a client and server in a client-server database management system. Information such as the columns that are or have been used and/or the number of rows that have been accessed, may be utilized to identify certain data that is likely to not be used during processing of the database query. Based upon the data that has been identified, a subset of the data that would otherwise be returned as a result of the database query may be identified and returned to a client, often substantially reducing the amount of data required to be retrieved by a client in connection with a database query.

Abstract: Embodiments of the invention provide techniques for optimizing the processing of abstract rules included in rule set containers. In one embodiment, a first abstract rule may be identified as having an effect on a second abstract rule of the rule set container. A predicate and an action of the first abstract rule may be used in translating the second abstract rule into an executable rule. The executable rule performs the functionality included in the first and second abstract rules, while only requiring one rule execution in a rule engine. In another embodiment, the first abstract rule may be translated into a rejection query configured to return a rejection set. The second abstract rule may be translated into an executable rule that includes a condition that excludes any records included in the rejection set.

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 provide techniques for processing abstract rules with limiting criteria. In one embodiment, limiting criteria may specify requirements for characteristics of sets of input or output values of processing abstract rules. For example, limiting criteria may specify requirements for statistical validity of a set of input values, such as a minimum record count. In one aspect, limiting criteria may include input criteria applied to input data prior to being processed in a rule engine. In another aspect, limiting criteria may include output criteria applied to an output of a rule engine. In the event that limiting criteria are not satisfied, the processing of the abstract rule may be terminated.

Abstract: Embodiments of the invention provide techniques for optimizing the processing of abstract rules. In general, the results of executing an abstract query may be used as data inputs for processing an abstract rule. In one embodiment, query results may be sorted according to input field values required for processing a deterministic abstract rule. If a record of the sorted query results includes the same input values as a preceding record, then the rule output of the preceding record may be reused, rather than processing the abstract rule again. Accordingly, the demand load placed on a rule engine may be reduced.

Abstract: Embodiments of the invention provide techniques for optimizing the processing of abstract rules. In general, the results of executing an abstract query may be used as data inputs for processing an abstract rule. In one embodiment, query results may be sorted according to input field values required for processing a deterministic abstract rule. If a record of the sorted query results includes the same input values as a preceding record, then the rule output of the preceding record may be reused, rather than processing the abstract rule again. Accordingly, the demand load placed on a rule engine may be reduced.

Abstract: Embodiments of the invention provide techniques for performing federated queries of data records stored in multiple data sources. In one embodiment, an aliased key table may be configured to store relationships between key fields of multiple data sources. The aliased key table may specify a mapping function to translate a value of one key field to an equivalent value of a second key field. The mapping function may be used with a mapping table storing sets of key values of different data sources, with each set corresponding to a given entity. In another embodiment, the mapping function may call a web service configured to translate key values. In yet another embodiment, federated queries may be specified in terms of attributes, which may be matched to key values.

Abstract: Embodiments of the invention provide a method for creating value constraints and record constraints for entity based conditions, while (at least in some cases) reducing the amount of time and errors associated with manually composing query language statements (e.g., SQL). When composing an abstract query, a query interface may be provided for a user to input value constraints and record set constrains to create entity based conditions. The entity based conditions may specify a condition which is evaluated against all rows of data for an instance of a given model entity, and a record set constraint allows a user to specify a subset of records against which the entity based condition is applied.

Abstract: Embodiments of the invention provide techniques for performing federated queries of data records stored in multiple data sources. In one embodiment, an aliased key table may be configured to store relationships between key fields of multiple data sources. The aliased key table may specify a mapping function to translate a value of one key field to an equivalent value of a second key field. The mapping function may be used with a mapping table storing sets of key values of different data sources, with each set corresponding to a given entity. In another embodiment, the mapping function may call a web service configured to translate key values. In yet another embodiment, federated queries may be specified in terms of attributes, which may be matched to key values.

Abstract: A graphical query interface provides visual feedback to a user during the construction of a query. In a first embodiment, the visual feedback helps the user determine the quality of the query as the query is being built. The relationship of columns in the database is graphically displayed to a user. When the user selects a column in the database, a filtered display mechanism displays only those columns or records that satisfy the portion of the query already constructed. In a second embodiment, the visual feedback eliminates some possible selections in the query tree due to previously-made selections that eliminate the eliminated selections as possibilities. In the second embodiment, the visual feedback mechanism may function according to data values in columns, and may also function according to known relationships between columns themselves.

Abstract: Embodiments of the invention provide a technique for finding anomalous values for fields with temporal autocorrelation, without resorting to complex query writing. When composing an abstract query a query interface may be provided for a user to input a temporal correlation conditions. The temporal correlation conditions may include a type of change, a delta value, and a time frame within which two data values must occur to be identified as an anomalous value. The time correlation conditions are then passed to a query builder configured to generate and execute a database query configured to identify anomalous values based on the time correlation conditions.

Abstract: A graphical query interface provides visual feedback to a user during the construction of a query. In a first embodiment, the visual feedback helps the user determine the quality of the query as the query is being built. The relationship of columns in the database is graphically displayed to a user. When the user selects a column in the database, a filtered display mechanism displays only those columns or records that satisfy the portion of the query already constructed. In a second embodiment, the visual feedback eliminates some possible selections in the query tree due to previously-made selections that eliminate the eliminated selections as possibilities. In the second embodiment, the visual feedback mechanism may function according to data values in columns, and may also function according to known relationships between columns themselves.

Abstract: Embodiments of the invention provide techniques for processing abstract rule sets in a query engine. In general, the functions and Boolean logic incorporated in an abstract rule are analyzed to determine whether the rule may be processed by a query engine. As a result, the abstract rule as a whole may be processed by a query engine, may be processed in a rule engine, or may be processed in two stages in a query engine and a rule engine.

Abstract: Embodiments of the invention store log event records in a secure database log by encrypting information in a query, or in query results, that would otherwise be subject to unwanted disclosure (either from within or without a given organization). For example, an organization (e.g., a research institution) may allow a database administrator to review log event records to diagnose and correct system performance issues, without being forced to trust the administrator with sensitive medical data (e.g., medical records related to participants in a research study). Thus, the security of sensitive information may be maintained, while at the same time, the database administrator may still access the information needed to maintain a working system.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment determine whether a block of code associated with a copy-and-paste operation or a punch-out operation has a size greater than a threshold. If the size is greater than the threshold, then a method is created and the block of code is pasted into the method. Also, an invocation to the newly created method is added at the copied-from location and the intended pasted-to location (in the case of the copy-and-paste operation) or an invocation to the newly created method is added at the copied-from location (in the case of the punch-out operation). In this way, future modifications to the block of code need only be made in one place: the method, instead of at all locations where duplicate code exists. Thus, embodiments of the invention may reduce the fragility of the code.

Abstract: An apparatus and method modify a saved query based on a change in a query value meaning that changes over time. In preferred embodiments a graphical query interface displays an option to adjust query values of a saved database query. A query adjustment mechanism then adjusts the value of the query to compensate for the change in the meaning of the query value since the query was created such that the adjusted query will have the same basic meaning as when the query was originally created. Preferred Embodiments allow the user to specify to adjust the query to the current date or to a specified date in the past.

Abstract: An apparatus and method modify a saved query based on a change in a query value meaning that changes over time. In preferred embodiments a graphical query interface displays an option to adjust query values of a saved database query. A query adjustment mechanism then adjusts the value of the query to compensate for the change in the meaning of the query value since the query was created such that the adjusted query will have the same basic meaning as when the query was originally created. Preferred Embodiments allow the user to specify to adjust the query to the current date or to a specified date in the past.

Abstract: An apparatus and method modify a saved query based on a change in a query value meaning that changes over time. In preferred embodiments a graphical query interface displays an option to adjust query values of a saved database query. A query adjustment mechanism then adjusts the value of the query to compensate for the change in the meaning of the query value since the query was created such that the adjusted query will have the same basic meaning as when the query was originally created. Preferred Embodiments allow the user to specify to adjust the query to the current date or to a specified date in the past.

Abstract: A method, apparatus and program product initiate generation of a metafile at a client computer. The metafile is evaluated at a network server for a potential viral risk. Program code executing at the server may correlate the evaluated potential risk to a risk level stored in a database. The program code may attach a color designator or other assignment indicative of the assessed risk level to the data. A user at the client computer may act on the data based on the attached risk level.

Abstract: An apparatus and program product initiate generation of a metafile at a client computer. The metafile is evaluated at a network server for a potential viral risk. Program code executing at the server may correlate the evaluated potential risk to a risk level stored in a database. The program code may attach a color designator or other assignment indicative of the assessed risk level to the data. A user at the client computer may act on the data based on the attached risk level.