Patent application number | Description | Published |
20080201313 | DYNAMIC GRAPHICAL DATABASE QUERY INTERFACE - 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. | 08-21-2008 |
20080215532 | DATABASE OPTIMIZATION THROUGH SCHEMA MODIFICATION - A database optimizer collects statistics regarding applications accessing a database, and makes one or more changes to the database schema to optimize performance according to the collected statistics. In a first embodiment, the optimizer detects when a certain type of application accesses the database a percentage of time that exceeds a predefined threshold level, and if the data in the database is stored in a less-than-optimal format for the application, the data type of one or more columns in the database is changed to a more optimal format for the application. In a second embodiment, the optimizer detects when one type of application accesses a column a percentage of time that exceeds a first predefined threshold level and is less than a second predefined threshold level, and creates a new column in the database so the data is present in both formats. | 09-04-2008 |
20080235610 | CHAINING OBJECTS IN A POINTER DRAG PATH - An apparatus and method for a graphical user interface allow performing operations simply by dragging a first object to touch a second object. The selection of the first object places a corresponding first object in a chain of objects. When the selected first object touches a second object, a corresponding second object is added to the chain of objects. This process may continue for the selection of many objects by merely touching each object with the selected first object, which causes a corresponding object to be added to the chain of objects. The chain of objects may then be processed as an atomic group of operations that may be rolled back if any of the operations in the group fail. | 09-25-2008 |
20080270926 | POINTER DRAG PATH OPERATIONS - A graphical user interface allows performing operations simply by dragging a first object over a second object. One or more attributes of the second object are effectively “picked up” by virtue of dragging over the second object. In this manner, the user interface is more friendly, more intuitive, and reduces the number of pointer clicks to implement a particular function, thereby enhancing the efficiency of the user. | 10-30-2008 |
20080271149 | ANTIVIRAL NETWORK SYSTEM - 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. | 10-30-2008 |
20080301109 | MODIFICATION OF A SAVED DATABASE QUERY BASED ON A CHANGE IN THE MEANING OF A QUERY VALUE OVER TIME - 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. | 12-04-2008 |
20080301110 | MODIFICATION OF A SAVED DATABASE QUERY BASED ON A CHANGE IN THE MEANING OF A QUERY VALUE OVER TIME - 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. | 12-04-2008 |
20080301131 | MODIFICATION OF A SAVED DATABASE QUERY BASED ON A CHANGE IN THE MEANING OF A QUERY VALUE OVER TIME - 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. | 12-04-2008 |
20090019000 | QUERY BASED RULE SETS - 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. | 01-15-2009 |
20090019092 | ABSTRACTION BASED AUDIT AND SECURITY LOG MODEL FOR INCREASED ROLE AND SECURITY ENFORCEMENT - 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. | 01-15-2009 |
20090070307 | FINDING ANOMALOUS VALUES FOR LOGICAL FIELDS WITH TEMPORAL AUTOCORRELATION CONDITIONS - 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. | 03-12-2009 |
20090094217 | DYNAMIC GRAPHICAL DATABASE QUERY INTERFACE - 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. | 04-09-2009 |
20090112794 | ALIASED KEYS FOR FEDERATED DATABASE QUERIES - 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. | 04-30-2009 |
20090119277 | DIFFERENTIATION OF FIELD ATTRIBUTES AS VALUE CONSTRAINING VERSUS RECORD SET CONSTRAINING - 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. | 05-07-2009 |
20090125468 | RULESET OPTIMIZATION THROUGH BLOCKED AND CONCURRENT RULE DISPATCH - 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. | 05-14-2009 |
20090125500 | OPTIMIZATION OF ABSTRACT RULE PROCESSING - 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. | 05-14-2009 |
20090125540 | METHOD FOR EXECUTING FEDERATED DATABASE QUERIES USING ALIASED KEYS - 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. | 05-14-2009 |
20090132456 | APPLYING RULESET LIMITING CRITERIA FOR AFFIRMING RULE INPUTS AND OUTPUTS - 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. | 05-21-2009 |
20090138448 | PROCESSING DATABASE QUERIES BY RETURNING RESULTS OF A FIRST QUERY TO SUBSEQUENT QUERIES - 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. | 05-28-2009 |
20090157606 | QUERY BASED RULE OPTIMIZATION THROUGH RULE COMBINATION - 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. | 06-18-2009 |
20110040775 | PROACTIVE ANALYTIC DATA SET REDUCTION VIA PARAMETER CONDITION INJECTION - Systems, methods and articles of manufacture are disclosed for injecting parameter conditions to reduce a size of a data set to be processed. A data set may be received to be processed by an analytic routine. The data set may include results from executing a first query. Further, input may be received from a user, the input specifying a parameter specific to the analytic routine to be performed on the data set. At least one condition associated with the specified parameter may be identified. A second query may be generated from the first query and the identified condition. The second query may be executed to generate a reduced data set. The analytic routine may be performed on the reduced data set to generate an output to the user. | 02-17-2011 |
20110066860 | Virtual World Embedded Security Watermarking - A method, apparatus, and program product are provided for using watermarks to embed security features on avatars in a virtual world. A watermark engine receives security information for an avatar in a virtual world. The watermark engine creates a watermark for the avatar using the security information and associates the watermark with the avatar. The watermark may comprise at least one of: security preferences for the avatar, contact information for an owner of the avatar, and graphical information to cause alteration of the avatar when the avatar is recorded. | 03-17-2011 |
20110078241 | PERVASIVE, DISTRIBUTED PROVISION OF SERVICES SUCH AS PRODUCT BROKERAGE - A client-server computing system suited particularly for clients of varying functional capabilities. Information handling capabilities are provided at the client and server on a customized, as-needed basis. When a service is needed by a client, the server determines a number of factors that may be relevant to the manner in which the service is to be provided. Then, the server selects from between two or more services having different executable code, and uploads the selected service to the client. Thus, the code may be tailored to the client's capabilities, or other aspects of its function. Services are not permanently retained by a client; rather, the client performs an analysis to determine whether services should be retained or purged. Also, state information is not permanently retained by a client; the server retains the information and uploads that information to the client. The server also manages its resources by loading service components on an as-needed basis. | 03-31-2011 |
20110270868 | AUTOMATIC WEB SERVICE DISCOVERY AND INFORMATION RETRIEVAL VIA DATA ABSTRACTION MODEL - A computer-implemented method includes receiving a selection of a particular logical field via a database query interface. The method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on the particular logical field. The data abstraction model includes a plurality of logical fields, where each logical field corresponds to a particular data structure of the database. A web service input and a web service output of a particular discovered web service are associated with particular logical fields of the data abstraction model via the discovery registry. The method further includes automatically initiating execution of the discovered web services and displaying one or more values resulting from execution of the discovered web services. | 11-03-2011 |
20130283055 | VIRTUAL WORLD EMBEDDED SECURITY WATERMARKING - A method, apparatus, and program product are provided for using watermarks to embed security features on avatars in a virtual world. A watermark engine receives security information for an avatar in a virtual world. The watermark engine creates a watermark for the avatar using the security information and associates the watermark with the avatar. The watermark may comprise at least one of: security preferences for the avatar, contact information for an owner of the avatar, and graphical information to cause alteration of the avatar when the avatar is recorded. | 10-24-2013 |