Patent application number | Description | Published |
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 |
20090083224 | SUMMARIZING DATA REMOVED FROM A QUERY RESULT SET BASED ON A DATA QUALITY STANDARD - A method, article of manufacture and apparatus for graphically summarizing the data in an initial query result set, including when rows are removed from the result set by applying a data quality standard is disclosed. When a user selects to change the data quality standard, a group of target rows are identified and removed from the user's display. A bitmap is generated to graphically represent the location of each row in the initial result set, including removed rows. A bitmap to summarize the data values for one or more columns in the initial result set may also be created. Thus, a user may quickly obtain an intuitive view of what the data looks like, without the need for complex analysis or graphing packages. | 03-26-2009 |
20090106217 | ONTOLOGY-BASED NETWORK SEARCH ENGINE - A method and apparatus for searching for a documents residing on a network comprises receiving a search request from a user. The search request comprises one or more search terms of an ontology. The ontology includes a plurality of terms. One or more of the plurality of terms includes a plurality of sub-category terms. One or more documents residing on the network is identified based on the one or more search terms and an ontology index. The ontology index comprises a plurality of relationships between the plurality of terms and sub-category terms of the ontology and a plurality of documents residing on the network. One or more search results that describe the one or more documents is presented to the user. The one or more documents contain the one or more search terms, or one of the plurality of sub-category terms of the one or more search terms. | 04-23-2009 |
20090112838 | ONTOLOGY-BASED NETWORK SEARCH ENGINE - A method and apparatus for searching for a documents residing on a network comprises receiving a search request from a user. The search request comprises one or more search terms of an ontology. The ontology includes a plurality of terms. One or more of the plurality of terms includes a plurality of sub-category terms. One or more documents residing on the network is identified based on the one or more search terms and an ontology index. The ontology index comprises a plurality of relationships between the plurality of terms and sub-category terms of the ontology and a plurality of documents residing on the network. One or more search results that describe the one or more documents is presented to the user. The one or more documents contain the one or more search terms, or one of the plurality of sub-category terms of the one or more search terms. | 04-30-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 |
20090150338 | POLICY DRIVEN MEMORY MANAGEMENT OF POOL OF CURSORS IN DATABASE MANAGEMENT SYSTEM - An apparatus, program product and method utilize policy-driven management of a pool of cursors in a database management system. Cursor usage statistics are determined for a plurality of cursors, and a plurality of cursor criteria defined in a policy are used to identify one or more cursors to close based upon the determined statistics. Among the statistics that are collected is a query time statistic that specifies, for each cursor, how long the query with which that cursor is associated, took to execute. As a result, a cursor that is associated with query that took a relatively longer time to execute will generally be less likely to be closed than a cursor that is associated with a query that took a relatively shorter time to execute. Consequently, should a cursor be needed for a particular query after the cursor has been closed, the performance penalty associated with recreating that cursor and its associated objects will be reduced. | 06-11-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 |
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 |