Patent application number | Description | Published |
20080215611 | SEQUENCED MODIFICATION OF MULTIPLE ENTITIES BASED ON AN ABSTRACT DATA REPRESENTATION - The present invention is generally directed to a system, method and article of manufacture for modifying data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs transformation of an abstract query into a form that can be used against a particular physical data representation. The transformation includes ordering physical modification operations according to a physical entity relationships specification to ensure that the physical modification operations are executed in an appropriate order. | 09-04-2008 |
20080215612 | SEQUENCED MODIFICATION OF MULTIPLE ENTITIES BASED ON AN ABSTRACT DATA REPRESENTATION - The present invention is generally directed to a system, method and article of manufacture for modifying data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs transformation of an abstract query into a form that can be used against a particular physical data representation. The transformation includes ordering physical modification operations according to a physical entity relationships specification to ensure that the physical modification operations are executed in an appropriate order. | 09-04-2008 |
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 |
20080228711 | USAGE-BASED OPTIMIZATION OF NETWORK TRAFFIC AND DATA WAREHOUSE SIZE - The present invention generally provides systems, methods, and articles of manufacture for maintaining a data warehouse having a plurality of fields updated with data from one or more data sources. Rather than automatically update every field of data available in the warehouse, a limited subset of fields identified through their involvement in queries issued against the warehouse are updated. By limiting the fields that are updated, the network bandwidth required to transmit the updates to the data warehouse may be reduced. Further, by removing fields from the data warehouse that are not in use, the size of the data warehouse may be reduced. | 09-18-2008 |
20080228716 | SYSTEM AND METHOD FOR ACCESSING UNSTRUCTURED DATA USING A STRUCTURED DATABASE QUERY ENVIRONMENT - Method, system and article of manufacture for processing database queries and, more particularly, for executing queries to retrieve data from both structured and unstructured data sources. A method of retrieving data from a database and an unstructured data source includes accessing the database to retrieve a first structured result set, accessing the unstructured data source using at least a portion of the structured data included in the first structured result set to retrieve an unstructured data result set, and generating a second structured result set from the unstructured data result set; and storing the second structured result in the database. | 09-18-2008 |
20080228737 | UTILIZATION OF LOGICAL FIELDS WITH CONDITIONAL CONSTRAINTS IN ABSTRACT QUERIES - Methods, systems, and articles of manufacture are provided for enhancing abstract queries by utilizing logical fields with conditional constraints. Building abstract queries with logical fields configured with conditional constraints allows for optimized physical queries to be generated from corresponding abstract queries. | 09-18-2008 |
20080228800 | DETERMINING QUERY ENTITIES FOR AN ABSTRACT DATABASE FROM A PHYSICAL DATABASE TABLE - Embodiments of the invention provide techniques for determining query entities in physical tables for an abstract database. A query entity may be created to store a particular set of data. The query entity may be defined in terms of the structure of the physical database, such as an SQL statement, used to generate the query entity as needed. The fields included in a given query entities may be determined based on the presence (or absence) of values in the columns of a physical database table. In addition, logical fields having access method which map to the fields included in a query entity may be generated. | 09-18-2008 |
20080235195 | DYNAMIC DATABASE ACCESS VIA STANDARD QUERY LANGUAGE AND ABSTRACTION TECHNOLOGY - Methods, systems, and articles of manufacture that allow saved abstract queries to be referenced from within query statements constructed using standard query languages, such as Structured Query Language (SQL), are provided. | 09-25-2008 |
20080249998 | TECHNIQUES FOR PROCESSING DATA FROM A MULTILINGUAL DATABASE - A method, system and article of manufacture for providing natural language support for users running queries against a multilingual database. One embodiment comprises identifying one or more physical values defined by physical data in the multilingual database for a query result associated with an executed query. At least one translation function configured to transform at least a portion of the identified physical values defined in one or more different natural languages into alternative values defined in a selected language is executed. From each executed translation function, a data structure mapping at least a portion of the identified physical values to translated values defined in the selected language is identified and the translated values defining the alternative values defined in the selected language are retrieved from each identified data structure. The query result associated with the executed query including the alternative values defined in the selected language is output. | 10-09-2008 |
20080250003 | PEER TO PEER (P2P) CONCEPT QUERY ABSTRACTION MODEL AUGMENTATION WITH FEDERATED ACCESS ONLY ELEMENTS - Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. | 10-09-2008 |
20080250004 | PEER TO PEER (P2P) CONCEPT QUERY NOTIFICATION OF AVAILABLE QUERY AUGMENTATION WITHIN QUERY RESULTS - Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. | 10-09-2008 |
20080250005 | PEER TO PEER (P2P) FEDERATED CONCEPT QUERIES - Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. | 10-09-2008 |
20080250006 | PEER TO PEER (P2P) FEDERATED CONCEPT QUERIES - Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. | 10-09-2008 |
20080256047 | SELECTING RULES ENGINES FOR PROCESSING ABSTRACT RULES BASED ON FUNCTIONALITY AND COST - Embodiments of the invention provide techniques for selecting rule engines for processing abstract rules based on functionality and cost. In general, an abstract rule is analyzed to determine which functions are required to process the rule. The abstract rule is assigned to a rule engine by evaluating metadata describing the functions and costs of the rule engines. The abstract rule is then translated to the format required by the selected rule engine. | 10-16-2008 |
20080256062 | METHOD AND SYSTEM FOR PROPAGATING ANNOTATIONS USING PATTERN MATCHING - Methods, systems, and articles of manufacture for propagating annotations created for data objects appearing in a variety of different application types are provided. Some embodiments present users collaborating on a project with an indication of data objects in a current document that have been annotated, or that related data objects have been annotated, in other documents. Users may then review the annotations and selectively associate the annotations with the related data object in the current document, thereby spreading the tacit knowledge reflected in the annotation about related data objects across many documents in an enterprise network. Further, an annotation management system may maintain a thesaurus of related terms and corresponding annotation points to find annotations for data objects that exist in other documents without having to inspect the data object(s) associated with each existing annotation. | 10-16-2008 |
20080270447 | RULESET GENERATION FOR MULTIPLE ENTITIES WITH MULTIPLE DATA VALUES PER ATTRIBUTE - Embodiments of the invention provide techniques for processing abstract rules with query results having rows with multiple data values per column. In general, value fields are created to store the multiple data values of each attribute contained in each row of the query results. The abstract rule is transformed, resulting in a single executable rule corresponding to each row of the query results. Each executable rule references the value fields created to store the multiple data values. Each executable rule is then processed, utilizing the value fields of the corresponding row as rule inputs. | 10-30-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 |
20080288235 | ONTOLOGICAL TRANSLATION OF ABSTRACT RULES - Embodiments of the invention provide techniques for selecting rule engines for processing abstract rules based on functionality and cost. In general, an abstract rule is analyzed to determine which functions are required to process the rule. The abstract rule is assigned to a rule engine by evaluating metadata describing the functions and costs of the rule engines. The abstract rule is then translated to the format required by the selected rule engine. | 11-20-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 |
20080319968 | PROCESSING QUERY CONDITIONS HAVING FILTERED FIELDS WITHIN A DATA ABSTRACTION ENVIRONMENT - Embodiments of the invention provide techniques for composing and executing queries using filtered fields. In one embodiment, a query may be composed with compatible fields, meaning filtered fields that store related data of a particular data type. Such compatible fields may be combined into a single query condition, thus simplifying the composition and execution of the query. In one embodiment, fields may be identified as compatible based on metadata included in a database abstraction model. | 12-25-2008 |
20080319969 | QUERY CONDITIONS HAVING FILTERED FIELDS WITHIN A DATA ABSTRACTION ENVIRONMENT - Embodiments of the invention provide techniques for composing and executing queries using filtered fields. In one embodiment, a query may be composed with compatible fields, meaning filtered fields that store related data of a particular data type. Such compatible fields may be combined into a single query condition, thus simplifying the composition and execution of the query. In one embodiment, fields may be identified as compatible based on metadata included in a database abstraction model. | 12-25-2008 |
20090006352 | COMPOSING ABSTRACT QUERIES FOR DELEGATED USER ROLES - Embodiments of the invention provide a database administrator composing an abstract query with visibility to logical fields that are permitted for the delegated roles. In one embodiment, a query interface is configured to receive administrator selections of delegated roles (i.e., the user roles to be provided with access to the finished abstract query). The query interface may then present the administrator with logical fields that are permitted for each delegated role. Providing such information may enable the administrator to verify that all intended users will have access to the finished abstract query. | 01-01-2009 |
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 |
20090077012 | DISPLAYING RELEVANT ABSTRACT DATABASE ELEMENTS - Embodiments of the invention enable users of an abstract database to use logical fields that are relevant to a given model entity. In one embodiment, a user may be presented with a query interface that includes relevant fields, and which may be used to compose abstract queries. In another embodiment, the query interface may include an initial query result, and may include relevant fields for model entities included in the initial query result. The query interface may be configured to enable a user to perform subsequent query operations using the included relevant fields. | 03-19-2009 |
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 |
20090083548 | SECURE DATABASE ACCESS THROUGH PARTIAL ENCRYPTION - The present invention generally is directed to systems, methods, and articles of manufacture for securing sensitive information involved in database transactions. Embodiments of the present invention selectively encrypt only portions of transactions involving sensitive data, thereby reducing or eliminating the processing overhead resulting from wastefully encrypting non-sensitive data. The sensitive data may be identified by a document. The document may be accessed by a requesting entity to determine which portions of a query should be encrypted prior to sending the query to a database server over a network. The document may also be accessed by a database server to determine which portions of query results should be encrypted prior to sending the query results to the requesting entity over the network. | 03-26-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 |
20090138452 | DISABLING QUERY CONDITIONS IN AN ABSTRACT QUERY ENVIRONMENT - Embodiments of the invention provide techniques for temporarily disabling conditions in abstract queries. In one embodiment, a query interface is configured to present an abstract query, and to allow a user to select conditions of the abstract query to be temporarily disabled. By executing an abstract query having disabled conditions, the user may be able to determine the effect of individual changes to the abstract query without having to re-compose the abstract query after each change. The conditions to be disabled may be selected individually, by field, or by value. Each disabled element may be displayed with a visual indicator communicating that it is disabled. The user may then select specific disabled conditions to be re-enabled. | 05-28-2009 |
20090138456 | DISABLING SUBSETS OF QUERY CONDITIONS IN AN ABSTRACT QUERY ENVIRONMENT - Embodiments of the invention provide techniques for temporarily disabling conditions in abstract queries. In one embodiment, a query interface is configured to present an abstract query, and to allow a user to select conditions of the abstract query to be temporarily disabled. By executing an abstract query having disabled conditions, the user may be able to determine the effect of individual changes to the abstract query without having to re-compose the abstract query after each change. The conditions to be disabled may be selected individually, by field, or by value. Each disabled element may be displayed with a visual indicator communicating that it is disabled. The user may then select specific disabled conditions to be re-enabled. | 05-28-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 |
20090157639 | FRAMEWORK FOR DYNAMIC ANALYSIS OF VARYING STRUCTURED DATA USING MULTIPLE ANALYSIS TECHNIQUES - The present invention provides for methods, apparatus and articles of manufacture directed to dynamically generating input to an analysis environment. Varying input data is linked with analysis routines by provision of a well defined but general purpose input structure for selected data, which is used as input to analysis routines. Metadata is used to describe the multiple analysis routines and their capabilities, and a framework both automatically formats the input data and customizes the analysis routine to accept the specific dynamic fields available in the input. In this manner, data (e.g., a query) containing new input fields is dynamically made available to multiple existing analysis techniques. | 06-18-2009 |
20090182708 | DEALING WITH COMPOSITE DATA THROUGH DATA MODEL ENTITIES - The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs conversion of an abstract query (i.e., a request for results or a request to modify data) into a form that can be used against a particular physical data representation. Abstract and/or physical queries are transformed according to model entities which define a relationship between logical fields of the data repository abstraction layer. | 07-16-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 |
20090299984 | PARTIAL DATA MODEL EXPOSURE THROUGH CLIENT SIDE CACHING - The present invention generally provides methods, articles of manufacture and systems for exposing, on a client device, fields of a data model representing an underlying database for use in building queries against the database. For some embodiments, the client device may be a device having limited resources, such as a handheld computing device. Therefore, rather than load and expose the entire data model on the client at once, a limited portion of the data model may be exposed on a client in a “just in time” (JIT) basis. The limited portion may be determined, for example, based on input received from a user and system parameters, such as the system memory and network bandwidth available to the client device. | 12-03-2009 |
20090300064 | Content Creation System Configured to Provide Feedback on Content Coverage - Embodiments of the invention may be used to improve enforcement and compliance with publishing rules in an automated and provable manner. Prior to publication, documents may be processed using publishing rules (workflows) based on conceptual analysis of document content. Additionally, embodiments of the invention include a content creation system configured to provide prompt feedback on content coverage. Such a system enables the creator of information to better understand what approval requirements apply to content they create and intend to publish, as the content is being created. | 12-03-2009 |
20090300471 | Processing Publishing Rules by Routing Documents Based on Document Conceptual Understanding - Embodiments of the invention may be used to improve enforcement and compliance with publishing rules in an automated and provable manner. Prior to publication, documents may be processed using publishing rules (workflows) based on conceptual analysis of document content. Additionally, embodiments of the invention include a content creation system configured to provide prompt feedback on content coverage. Such a system enables the creator of information to better understand what approval requirements apply to content they create and intend to publish, as the content is being created. | 12-03-2009 |
20090300705 | Generating Document Processing Workflows Configured to Route Documents Based on Document Conceptual Understanding - Embodiments of the invention may be used to improve enforcement and compliance with publishing rules in an automated and provable manner. Prior to publication, documents may be processed using publishing rules (workflows) based on conceptual analysis of document content. Additionally, embodiments of the invention include a content creation system configured to provide prompt feedback on content coverage. Such a system enables the creator of information to better understand what approval requirements apply to content they create and intend to publish, as the content is being created. | 12-03-2009 |
20100010980 | CONTEXT SENSITIVE TERM EXPANSION WITH DYNAMIC TERM EXPANSION - Methods, articles of manufacture and systems for searching collections of data using context sensitive expanded term searching using dynamic term expansion are provided. The collection of data may be a relational database, text document, or any other type of searchable collection of data. In either case, a query including a search condition based on a specified search term may be modified to include additional conditions based on a set of expanded (e.g., conceptually-related) search terms dynamically linked with the query. For some embodiments, a user may be given the ability to choose whether the set of expanded search terms are dynamically linked with the query or not. | 01-14-2010 |
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 |
20100045660 | Recommendations for Object Use in Virtual Environment - Techniques are disclosed for helping users determine the “best” places to use and acquire inventory objects within a virtual environment, as well as to notify users of useful inventory items when an avatar is at a particular location in the virtual environment. An object index may be used to store data describing attributes of virtual objects, and a user index may be used to store data describing interactions users engage in with virtual objects. | 02-25-2010 |
20100050100 | Virtual World Object Presentation, Recommendations and Navigation - Techniques are disclosed for helping users determine the “best” places to use and acquire inventory objects within a virtual environment, as well as to notify users of useful inventory items when an avatar is at a particular location in the virtual environment. An object index may be used to store data describing attributes of virtual objects, and a user index may be used to store data describing interactions users engage in with virtual objects. | 02-25-2010 |
20100057811 | CONTEXT-SENSITIVE TERM EXPANSION WITH MULTIPLE LEVELS OF EXPANSION - Articles of manufacture and systems for searching collections of data using context sensitive expanded term searching are provided. The collection of data may be a relational database, text document, or any other type of searchable collection of data. In either case, a query including a search condition based on a specified search term may be modified to include additional conditions based on a set of expanded (e.g., conceptually-related) search terms. For some embodiments, a user may be given the ability to control the level of expansion and the context in which the terms may be expanded. | 03-04-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 |
20100094893 | QUERY INTERFACE CONFIGURED TO INVOKE AN ANALYSIS ROUTINE ON A PARALLEL COMPUTING SYSTEM AS PART OF DATABASE QUERY PROCESSING - Techniques are disclosed for invoking an analysis routine running on a parallel computer system to analyze query results. An interface used to build and execute a database query may be used to invoke a complex analysis routine on a parallel computer system to analyze query results obtained by executing the database query. Alternatively, a user may build a query that includes specific conditions evaluated by an analysis routine on the parallel computer system (as opposed to selecting an analysis routine after receiving query results). | 04-15-2010 |
20100094894 | Program Invocation From A Query Interface to Parallel Computing System - Techniques are disclosed for invoking an analysis routine running on a parallel computer system to analyze query results. An interface used to build and execute a database query may be used to invoke a complex analysis routine on a parallel computer system to analyze query results obtained by executing the database query. Alternatively, a user may build a query that includes specific conditions evaluated by an analysis routine on the parallel computer system (as opposed to selecting an analysis routine after receiving query results). | 04-15-2010 |
20100185640 | VIRTUAL WORLD IDENTITY MANAGEMENT - Embodiments of the invention improve the ability for users of an immersive virtual environment to manage and change their avatars or avatar profiles, including their behavior, during their virtual experience. In one embodiment, a user associates each avatar or avatar profile they control or own with a task from a predetermined set of tasks or purposes. A virtual world identity manager (VWIM) may collect and evaluate data about the virtual experience of the user, including virtual environment, virtual behavior, and virtual interaction with other users. Using this information, the VWIM may assist the user with identity management, including notifying the user of an identity or behavioral mismatch, and dynamically prompting the user to change identity or behavior, and recommending appropriate identities or behaviors for the user. | 07-22-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 |
20100211586 | DATA MODEL SIMPLIFICATION THROUGH FIELD FALLOUT - Methods, articles of manufacture and systems are provided for simplifying a query building process by limiting the number of fields presented to a user for building queries. The number of fields presented to the user may be limited by hiding one or more logical fields from the user based on usage characteristics. For example, a logical field that is rarely used or has not been used within a predetermined period of time may be hidden from the user. For some embodiments, a fallout manager may monitor the use of logical fields in building queries, update usage characteristics, and mark logical fields as hidden based on the usage characteristics. A graphical user interface may not present to a user logical fields that have been marked as hidden. | 08-19-2010 |
20100250574 | USER DICTIONARY TERM CRITERIA CONDITIONS - Techniques are disclosed for processing an abstract query which includes a dictionary term criteria condition. The dictionary term criteria condition is used to specify a set of one or more keywords, each of which should appear in a distinct document (of a defined set of documents) in order for the condition to be satisfied. In one embodiment, a user defines an abstract query by specifying a model entity (a logical focus for a query used to identify a set of documents associated with the model entity), logical fields (specifying query conditions and information to be returned), and a set of terms for a dictionary term criteria condition. | 09-30-2010 |
20110023049 | OPTIMIZING WORKFLOW EXECUTION AGAINST A HETEROGENEOUS GRID COMPUTING TOPOLOGY - Optimizing workflow execution by the intelligent dispatching of workflow tasks against a grid computing system or infrastructure. For some embodiments, a grid task dispatcher may be configured to dispatch tasks in a manner that takes into account information about an entire workflow, rather than just an individual task. Utilizing information about the tasks (task metadata), such a workflow-scoped task dispatcher may more optimally assign work to compute resources available on the grid, leading to a decrease in workflow execution time and more efficient use of grid computing resources. | 01-27-2011 |
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 |
20110264679 | PEER TO PEER (P2P) MISSING FIELDS AND FIELD VALUATION FEEDBACK - Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query. | 10-27-2011 |
20110264688 | PEER TO PEER (P2P) DATA LICENSING MODEL IN A DISTRIBUTED ABSTRACT QUERY ENVIRONMENT - Methods, systems, and articles of manufacture for retrieving results for a query. One or more peer devices in a peer to peer network may define licensing terms for accessing data in one or more respective subsets of data contained therein. Upon receiving a query, the results of the data in data sets having licensing terms may be displayed to a requesting entity only upon acquiring an appropriate license. | 10-27-2011 |
20110270817 | WEB SERVICE DISCOVERY VIA DATA ABSTRACTION MODEL AUGMENTED BY FIELD RELATIONSHIP IDENTIFICATION - 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 logical fields of the data abstraction model via the discovery registry. The method further includes initiating execution of a discovered web service that returns a list of values. The list of values obtained by the discovered web service may be augmented with information determined based on field relationship metadata of the data abstraction model, where the field relationship metadata corresponds to the list of values. | 11-03-2011 |
20110270842 | WEB SERVICE DISCOVERY VIA DATA ABSTRACTION MODEL WITH INPUT ASSISTANCE - 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 logical fields of the data abstraction model via the discovery registry. A modified database query interface includes an input assistance selectable input associated with the discovered web services. In response to a selection of the input assistance selectable input, a form input interface may be displayed that includes one or more input forms associated with the discovered web services. | 11-03-2011 |
20110270856 | MANAGED DOCUMENT RESEARCH DOMAINS - Techniques are disclosed for improving the quality and durability of citations used within research documents. A method and apparatus may be sued to enhance the ability of researches to collaborate (or to simply be alerted) when the substance of a reference cited in one research document changes in a way that may conflict with how that reference is used in the citing document. For example, changes in cited reference may undermine (or enhance) the conclusions of a research paper stored in the managed repository. | 11-03-2011 |
20110270866 | SEMANTIC MODEL ASSOCIATION BETWEEN DATA ABSTRACTION LAYER IN BUSINESS INTELLIGENCE TOOLS - Systems, methods and articles of manufacture are disclosed for determining Business Intelligence (BI) tools and/or abstract queries that use similar semantic concepts. A semantics table may standardize semantic concepts across both BI tools and a data abstraction model. A BI concept repository may map BI tools to semantic concepts used by the BI tools. A user may be notified of a BI tool and/or of an abstract query that may be of interest to the user, on the basis of the semantic concepts. | 11-03-2011 |
20110270867 | WEB SERVICE DISCOVERY VIA DATA ABSTRACTION MODEL - A 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 a particular logical field selected via a database query interface. The data abstraction model includes a plurality of logical fields that each correspond to a particular data structure of the database. A web service input of a discovered web service is associated with a first logical field of the data abstraction model via the discovery registry, and a web service output of the discovered web service is associated with a second logical field of the data abstraction model via the discovery registry. A modified database query interface includes a text entry element to receive a text search term and a first selectable input associated with the first discovered web service. | 11-03-2011 |
20110270870 | WEB SERVICE DISCOVERY VIA DATA ABSTRACTION MODEL AND CONDITION CREATION - A method includes receiving a selection of a logical field of a data abstraction model. The method includes determining model entries (e.g., concepts) associated with the selected logical field and examining the data abstraction model to determine other model entries that are equal to the model entries associated with the selected logical field. For each equal model entry, the method includes determining web services to be used in performing a search, where the web services are determined by querying a discovery registry associated with the data abstraction model to discover one or more web services that are resolvable based on the selected logical field. A first discovered web service is executed with user supplied criteria provided via a user interface to obtain a list of values. A condition is created that limits acceptable values associated with the selected logical field based on the user supplied criteria. | 11-03-2011 |
20110276518 | FEE MODELS BASED ON PLUG-IN USE - A method and apparatus for calculating fees charged to users based on the plug-in use is disclosed. An application framework is provided as an extensible software platform. Users may integrate plug-in components into the application framework. Each plug-in component may identify a fee model defining how charges are assessed for using the plug-in. An auditing component, calculates the fees charged to each user of the customized application framework based on the features of the application framework and the plug-in use made by each individual user. | 11-10-2011 |
20110283112 | EXTRACTING PORTIONS OF AN ABSTRACT DATABASE FOR PROBLEM DETERMINATION - Systems, methods and articles of manufacture are disclosed for extracting portions of an abstract database for problem determination. An error may be detected when an application executes an abstract query against the abstract database. A portion of the abstract database may be extracted for problem determination. A defect entry may be created in a defect tracking tool, to store the extracted portion. One or more administrative users may be notified of the defect entry. | 11-17-2011 |
20120259881 | PEER TO PEER (P2P) MISSING FIELDS AND FIELD VALUATION FEEDBACK - Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query. | 10-11-2012 |
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 |
20130097155 | PROGRAM INVOCATION FROM A QUERY INTERFACE TO PARALLEL COMPUTING SYSTEM - Techniques are disclosed for invoking an analysis routine running on a parallel computer system to analyze query results. A query generated using a query builder application for execution against a database to produce query results. Embodiments receive a selection of one of a plurality of analysis routines to apply to the query results. A command and the query results are transmitted to a compute node of a parallel computer system using an established network connection. Embodiments invoke the selected analysis routine on the parallel computing system using the translated command and the query results to produce analysis routine results. The analysis routine results are merged with the query results to produce merged results, and the merged results are output for display. | 04-18-2013 |
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 |
20130211982 | ESTABLISHING A DATA MANGEMENT FEE STRUCTURE BASED ON FINE GRAINED DATA ENTITIES - Systems, methods and articles of manufacture for accessing data for a fee are provided. Fee schedules are defined for any arbitrary granularity of data, including for fields and data structures (e.g., tables in a database). Fees may be calculated based on the type of operation to be performed. Fees may also be calculated per operation and/or per data item involved in the operation. | 08-15-2013 |
20130218810 | ESTABLISHING A DATA MANGEMENT FEE STRUCTURE BASED ON FINE GRAINED DATA ENTITIES - Systems, methods and articles of manufacture for accessing data for a fee are provided. Fee schedules are defined for any arbitrary granularity of data, including for fields and data structures (e.g., tables in a database). Fees may be calculated based on the type of operation to be performed. Fees may also be calculated per operation and/or per data item involved in the operation. | 08-22-2013 |
20130226901 | PROCESSING ABSTRACT DERIVED ENTITIES DEFINED IN A DATA ABSTRACTION MODEL - A method, apparatus and article of manufacture for utilizing an abstract derived entity are disclosed. An abstract derived entity is a data object present in an abstract data model that may be referenced by other entities in the abstract data model as though it were a relational table present in a physical data source. In one embodiment, an abstract data model provides data access independent of the manner in which the data is physically represented in a set of physical data sources. In addition, an abstract derived entity may be used to provide aggregate data joined with other non-aggregate data. Aggregate data values are calculated from the column of a relational table, or other sets of input data. In one embodiment, an abstract derived entity may describe a describe relational table comprising a set of aggregate data used to form a column of the relational table joined to other columns formed from the sets of input data specified by the abstract derived entity. The resulting abstract derived table may be queried as though it were an actual relational table stored in a physical data source. | 08-29-2013 |
20130232230 | METHOD AND APPARATUS FOR OPTIMIZING PERFORMANCE AND NETWORK TRAFFIC IN DISTRIBUTED WORKFLOW PROCESSING - Methods and apparatus to optimize workflow execution by making intelligent decisions regarding service requests to perform workflow processes on one or more servers are provided. For some embodiments, a workflow controller may analyze a workflow definition specifying a set of tasks to be performed in order to determine if multiple tasks may be performed locally, on a common server. If so, the controller may generate a remote service to perform the multiple tasks on the common server, without requiring intermediate transfer of data between a local server on which the controller is running and the common remote server. | 09-05-2013 |
20130297643 | MOLECULAR LEVEL SIMILARITY SEARCH AND COMPUTER AIDED DRUG DISCOVERY PROCESS - Systems, methods and articles of manufacture are disclosed for searching chemical compounds referenced in chemical literature. References to chemical compounds in the documents may be transformed to corresponding references using a standard notation for representing chemical compounds. Criteria specifying desired molecular characteristics may be received. A regular expression may be generated based on the received criteria. The chemical documents may be searched using the regular expression. Based on the search, a chemical document may be determined that references a chemical compound satisfying the received criteria. Further, the regular expression may be generated based on the received criteria and a received mutation rule. Based on the generated regular expression and the chemical documents, one or more chemical compounds may be discovered that satisfy both the received criteria and the received mutation rule, but that is are not referenced in the chemical documents. | 11-07-2013 |