Patent application number | Description | Published |
20080222124 | ABSTRACTLY MAPPED PHYSICAL DATA FIELDS - A method, apparatus, and article of manufacture for managing access to an abstract database are provided. The abstract database may include a data abstraction model comprising a plurality of logical field definitions, each of the definitions comprising a logical field name, and an access method maps the logical field to a physical data field. Collectively, the physical data fields provide an indirection layer logically disposed between the data abstraction model and the underlying physical database. By providing this layer of indirection using the physical data fields, a number of enhancements to the data abstraction model may be provided. This includes providing enhancements to the security, administration, and usability of an abstract database. | 09-11-2008 |
20080275857 | TECHNIQUES FOR SHARING PERSISTENTLY STORED QUERY RESULTS BETWEEN MULTIPLE USERS - A system and article of manufacture for managing access to query results and, more particularly, for managing access by multiple users to persistently stored query results, whereby at least some of the users may have different access rights. One embodiment provides a computer-readable storage medium for managing access to a query result obtained upon execution of a query against one or more databases. The computer-readable storage medium comprises creating security information configured for restricting access to the query result. The security information is associated with the query result. Access to some or all of the query result is granted to a requesting entity on the basis of the security information and an attribute of the requesting entity. | 11-06-2008 |
20080281799 | TECHNIQUES FOR SHARING PERSISTENTLY STORED QUERY RESULTS BETWEEN MULTIPLE USERS - A method, system and article of manufacture for managing access to query results and, more particularly, for managing access by multiple users to persistently stored query results, whereby at least some of the users may have different access rights. One embodiment provides a method of managing access to a query result obtained upon execution of a query against one or more databases. The method comprises creating security information configured for restricting access to the query result. The security information is associated with the query result. Access to some or all of the query result is granted to a requesting entity on the basis of the security information and an attribute of the requesting entity. | 11-13-2008 |
20080291934 | Variable Dynamic Throttling of Network Traffic for Intrusion Prevention - Methods, apparatus, and computer program products for variable dynamic throttling of network traffic for intrusion prevention are disclosed that include initializing, as throttling parameters, a predefined time interval, a packet count, a packet count threshold, a throttle rate, a keepers count, and a discards count; starting a timer, the timer remaining on no longer than the predefined time interval; maintaining, while the timer is on, statistics including the packet count, the keepers count, and the discards count; for each data communications packet received by the network host, determining, in dependence upon the statistics and the throttle rate, whether to discard the packet and determining whether the packet count exceeds the packet count threshold; and if the packet count exceeds the packet count threshold: resetting the statistics, incrementing the throttle rate, and restarting the timer. | 11-27-2008 |
20080294872 | DEFRAGMENTING BLOCKS IN A CLUSTERED OR DISTRIBUTED COMPUTING SYSTEM - Embodiments of the invention provides techniques for defragmenting blocks of resources allocated to perform computing jobs on a distributed or clustered system so that more contiguous physical resources may be made available to users submitting new job requests. Typically, the defragmentation process is performed when a job is submitted that requires access to a computing block that is larger than any currently available block in the parallel computing system. | 11-27-2008 |
20080295029 | ADDRESSING QUERY SCHEDULING AND SYSTEM RESOURCE REQUIREMENTS - Method, system and article of manufacture for scheduling queries. In particular, the scheduling options made available to a user for a particular unit of work are determined dynamically at the time of scheduling. In this way, the execution cost, for example, of a particular unit of work can be taken into account when determining which scheduling options to make available. In addition, or alternatively, system availability and/or user parameters may be accounted for when determining which scheduling options to make available. | 11-27-2008 |
20080301108 | DYNAMIC DISCOVERY OF ABSTRACT RULE SET REQUIRED INPUTS - A method, system and article of manufacture for processing rule sets and, more particularly, for processing abstract rule sets. One embodiment provides a computer-implemented method of managing execution of an analysis routine on input data. The method comprises receiving input and receiving user-selection of an analysis routine for processing the received input. The analysis routine is defined by at least one abstract rule set having one or more abstract rules each having a conditional statement and a consequential statement. The method further comprises executing the analysis routine on the received input, comprising (i) identifying all required inputs for each abstract rule of the analysis routine, (ii) determining whether the received input includes data for all required inputs, and (iii) if the received input does not include data for one or more of the required inputs, retrieving suitable data for the one or more of the required inputs from the database. | 12-04-2008 |
20080319965 | FILTERING QUERY RESULTS USING MODEL ENTITY LIMITATIONS - A method, system, and article of manufacture to process database queries are disclosed. One embodiment comprises receiving an abstract query against a database having a multiplicity of data records. The abstract query identifies a model entity that defines a focus of the abstract query. The method further comprises receiving a limitation request configured to restrict a result set for the abstract query. The limitation request specifies a limitation on data records that are returned for one or more instances of the underlying model entity. From the abstract query, an executable query capable of being executed by a query engine is generated. The executable query is modified on the basis of the limitation request. The modified executable query is executed against the database to obtain the result set, whereby the result set is restricted as requested by the limitation request. | 12-25-2008 |
20090055438 | STRICT VALIDATION OF INFERENCE RULE BASED ON ABSTRACTION ENVIRONMENT - An article of manufacture for processing rule sets and, more particularly, for processing abstract rule sets. One embodiment provides a computer-readable storage medium containing a program which, when executed by a processor, performs operations for managing execution of an analysis routine. The operations comprise accessing an analysis routine configured to process one or more inputs. The analysis routine is defined by at least one abstract rule set having one or more abstract rules each having a conditional statement and a consequential statement. The operation further comprises determining, from the retrieved analysis routine, a predefined validating condition that needs to be satisfied by at least one of the inputs, and validating a particular data value defining the at least one of the inputs on the basis of the predefined validating condition. If the particular data value is not validated, a predefined action configured to avoid execution of the analysis routine on invalid inputs is performed. | 02-26-2009 |
20090063477 | RESEARCH RAPIDITY AND EFFICIENCY IMPROVEMENT BY ANALYSIS OF RESEARCH ARTIFACT SIMILARITY - Methods for comparing query-related objects are provided. In one embodiment, a first plurality of query-related objects for a first user is compared to a second plurality of query-related objects for a second user to determine a degree of similarity between the first and second plurality of query-related objects. A notification of the degree of similarity is issued. | 03-05-2009 |
20090100034 | DATABASE STAGING AREA READ-THROUGH OR FORCED FLUSH WITH DIRTY NOTIFICATION - Embodiments of the present invention allow the results of a query to an operational datastore to be augmented with relevant data that may be stored in a staging area datastore. Upon receiving a query to the operational datastore, it is determined whether data relevant to the query is present in the staging area datastore. If relevant data is present, such data may be transformed, transferred and combined with data in the operational datastore. The query is then run against the combined data and the results displayed to the user. | 04-16-2009 |
20090119270 | ABSTRACT QUERY BUILDING WITH SELECTABILITY OF AGGREGATION OPERATIONS AND GROUPING - Systems and articles of manufacture for query building with selectability of aggregation operations and grouping. Abstract queries are composed on the basis of a data abstraction model abstractly describing data in the database. The abstract queries may include result criterions and aggregation operations to be performed with respect to the result criterions for generating aggregation information. An object is generated containing query entities and allowing a user to selectively (i) generate a first executable query corresponding to the abstract query inclusive of the aggregation operation and aggregation logic; and (ii) generate a second executable query corresponding to the abstract query exclusive of the aggregation operation and aggregation logic. | 05-07-2009 |
20090144251 | METADATA MANAGEMENT FOR A DATA ABSTRACTION MODEL - Systems and articles of manufacture for managing metadata associated with a data abstraction model abstractly describing data in a database. One embodiment provides a technique for managing metadata describing objects of a data abstraction model with logical fields that define abstract views of physical data in a database. Managing metadata includes traversing a logical tree structure representing the data abstraction model. The logical tree structure has a plurality of nodes, each representing a logical field or a category of logical fields of the data abstraction model. Managing metadata also includes identifying metadata describing logical fields or categories represented by the plurality of nodes. The identified metadata is stored in a queryable database. A user is allowed to query the database to identify objects in the data abstraction model that may be used to construct an abstract query. | 06-04-2009 |
20090234822 | SORTING DATA RECORDS CONTAINED IN A QUERY RESULT - A system and article of manufacture for managing query results and, more particularly, for sorting data records contained in a query result obtained in response to execution of a query against a database. In one embodiment, the data records in the query result are sorted on the basis of related information which is retrieved from a corresponding data source. In another embodiment, the sorting is performed on the basis of a value variance which is determined for each of the data records in the query result. In still another embodiment, the sorting is performed on the basis of a requested value range coverage. In yet another embodiment, the sorting is performed on the basis of suitability scores which are determined with respect to analysis routines which are configured for processing the query result. | 09-17-2009 |
20090249093 | Design Structure for Selecting Processors for Job Scheduling Using Measured Power Consumption - In a design structure for allocating a plurality of parts of a computational system to a computational job, a set of requirements necessary to execute the job is determined. A set of parts of the plurality of parts is assembled so that the set of parts is capable of meeting the set of requirements and so that a part is added to the set of parts based on a determination that the addition of the part will minimize power consumption by the set of parts. The set of parts are caused to execute the job. | 10-01-2009 |
20090259622 | Classification of Data Based on Previously Classified Data - Embodiments of the invention generally provide methods, systems, and articles of manufacture that facilitate classification of unclassified data. When unclassified data records are found in a data tree, one or more classified data records near the unclassified data record in the data tree may be identified. The unclassified data record may be compared to the identified classified data record to determine one or more suggested classifications for the unclassified data record. The unclassified data record may therefore be classified into one of the suggested classifications based on, for example, user input. | 10-15-2009 |
20090260053 | Data Management in a Computer System - Embodiments of the invention generally provide methods, systems, and articles of manufacture that facilitate classification of a data access authority of unclassified users into one or more categories, and control access of data by the users based on the categories. When an unclassified user is found in an organization chart, one or more classified users near the unclassified user in the data tree may be identified. The unclassified user may be compared to the identified classified users to determine one or more suggested data access categories for classifying the unclassified user. The unclassified user may therefore be classified into one of the suggested data access category based on, for example, user input. | 10-15-2009 |
20100023498 | RELATIONSHIP MANAGEMENT IN A DATA ABSTRACTION MODEL - A method, system and article of manufacture for managing relationships in a data abstraction model abstractly describing data in a database. One embodiment provides a method of linking logical branches of data in a database based on the relationships. The method includes accessing a data abstraction model abstractly describing the data in the database. The data abstraction model defines a logical tree structure having a plurality of logical branches. Relationships between logical fields of different logical branches are identified and logical links abstractly describing the identified relationships are created. | 01-28-2010 |
20100030774 | MODEL ENTITY OPERATIONS IN QUERY RESULTS - The present invention provides systems and articles of manufacture that enhance the capability of a database abstraction model and query application constructed for an underlying physical database. Typically, the query application is used to compose and execute an abstract query. Once an initial query result is presented to a user, a user may select to execute a model entity operation by interacting with a query interface of the query application. A model entity operation allows the user to retrieve additional information from the underlying database, based on information included in the initial query result, without having to create a new query or having to correlate the results of multiple queries. | 02-04-2010 |
20100043059 | Trusted Electronic Communication Through Shared Vulnerability - A method for using shared vulnerability to provide trusted communication services between systems is disclosed. For example, a server may deny access to a service which renders it vulnerable to an untrusted client unless access to a useful vulnerability is received from the client. That is, the server may trust the client because any misuse by the client may result in the server exploiting the shared vulnerability. A system may request access to a service on another system to perform some transaction. Upon receiving this request, the server may determine a vulnerability of the client useful in deterring or stopping unwanted actions. The server may request access to this vulnerability. Once this vulnerability has been granted to the server, the server may then grant access to the requested service to the client. | 02-18-2010 |
20100070505 | Classification of Data in a Hierarchical Data Structure - Embodiments of the invention are generally related to data security, and more specifically to data classification. The nodes of a hierarchical data structure may be displayed in a graphical user interface (GUI). The GUI may be configured to receive selection of a data classification type. Upon receiving a selection of a data classification type, a probability of a node containing data objects that may be classified as the selected data classification type may be displayed adjacent to the node, thereby allowing efficient location and classification of the data objects. | 03-18-2010 |
20100076961 | ABSTRACT RECORDS - Embodiments of the invention provide methods, systems, and articles of manufacture improving the process of query composition, query processing, and presenting query results to users of an abstract database. Embodiments of the present invention organize and view data using abstract records. Specifically, users compose a query according to the logical relationships present in the data. Rather than evaluate conditions against a set of rows from a relational table, conditions included in abstract query are evaluated against instances of an abstract record. Instances that satisfy the conditions specified by an abstract query are returned as query results. In a specific case abstract records are used to evaluate a “never exists conditions, that determine the absence of data in an abstract records that satisfy a particular condition. | 03-25-2010 |
20100185678 | QUERY CONDITIONS-BASED SECURITY - A method, system and article of manufacture for managing access to queries and, more particularly, for managing access by multiple users to persistently stored queries. One embodiment provides a method of managing access by multiple users to a predefined query against data in a database. The method comprises associating one or more access rights with at least some portion of the predefined query. When a request to access the predefined query by a first user is received, access to the predefined query by the first user is limited on the basis of the access rights. | 07-22-2010 |
20100191767 | EXPECTED FUTURE CONDITION SUPPORT IN AN ABSTRACT QUERY ENVIRONMENT - Embodiments of the invention are generally related to data processing, and more specifically to retrieving data from a database. An abstract query may include query conditions and a first logical field comprising conditions for determining whether a second logical field will have a predefined value in the future. Upon execution, the abstract query may return results that satisfy the conditions for determining whether the second logical field will have the predefined value. | 07-29-2010 |
20110060757 | OPTIMIZED METHOD OF LOCATING COMPLETE AGGREGATION OF PATIENT HEALTH RECORDS IN A GLOBAL DOMAIN - A method, apparatus and article of manufacture are provided to optimize the time and effort required to locate all data on a given entity that may span multiple data nodes in a distributed environment. For example, embodiments of the invention may be used to locate nodes within the distributed environment that store electronic healthcare records. A poll request from a first node to a second node may include electronic records existence data indicating data nodes known to have, or not have, records related to a given individual. This information is used to minimize the number of nodes that need to be polled to arrive at the complete aggregation of patient records that exist within a given set of nodes. | 03-10-2011 |
20120265777 | MIXED MODE (MECHANICAL PROCESS AND ENGLISH TEXT) QUERY BUILDING SUPPORT FOR IMPROVING THE PROCESS OF BUILDING QUERIES CORRECTLY - Embodiments of the present invention allow verification of query language by providing a natural language description for the query language. A natural language description is generated for each query component along with selectable text representing the query component. Upon selection of the selectable text, the query component is rendered for editing. | 10-18-2012 |
20130138633 | DECOMPOSED QUERY CONDITIONS - A method, article of manufacture and apparatus for decomposing an initial query into smaller conditional groups for execution on a database is disclosed. A separate database query may be generated for each of the conditional groups, and the results of executing these separate database queries may be combined and returned as the result of the initial query. Typically, the initial query may be decomposed because it is otherwise too large and/or too complex to be executed directly. | 05-30-2013 |