Patent application number | Description | Published |
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 |
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 |
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 |
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 |
20090313210 | ENCODED MATRIX INDEX - A method, apparatus, and program product are provided for creating an Encoded Matrix Index for a column in a database table. An element of the column for all rows in the database table is compared to a corresponding reference value in a reference data structure, and in response to at least one value for the element of the column not matching the reference value, indicating a variation in a variation data structure and creating a value data structure. Queries executed using the Encoded Matrix Index include terms associated with a sub-column defined in a column of a database table. The variation data structure is accessed to determine whether any variation exists between rows belonging to a sub-column of the database table. If no variation exists, a value is accessed from the reference data structure; otherwise, a value for each row of the sub-column is accessed from a value data structure. | 12-17-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 |
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 |
20100185634 | DATA TRANFORMATIONS FOR A SOURCE APPLICATION AND MULTIPLE TARGET APPLICATIONS SUPPORTING DIFFERENT DATA FORMATS - Embodiments of the invention allow structured data to be transferred between a source application and target applications that process structured data in different formats. For example, structured data may have associated rules which transform the structured data based on some variables. The source application may register variable definitions for each variable in a registry. Each target application may read the registry and register values for the variables. Once values are registered, the source application transfers the structured data to a transformation engine that applies the rules, using the registered values for the variables, to transform the structured data into a format compatible with the target applications. The transformation engine may also determine distinct sets of variable values and transform structured data based on each distinct set. In doing so, the number of transformed data generated is limited to the number of distinct sets, thereby avoiding generating duplicate transformed data. | 07-22-2010 |
20100185635 | DATA TRANFORMATIONS BETWEEN A SOURCE APPLICATION AND SERVICE-ORIENTED TARGET APPLICATIONS SUPPORTING DIFFERENT DATA FORMATS - Embodiments of the invention allow structured data to be transferred between a source application and a service-oriented target application that process data in different formats. The data to be transferred may be divided into different sections, where each section is processed by a respective service of the target application. To transform each section of data into a format compatible with a respective service, the data may have a set of associated rules which transform data based on a set of variables. The source application may provide variable definitions for each of the variables. Each service of the target application may specify values for each of the variables. Once the variables have a specified value, a transformation engine may transform each section of the data and subsequently transfer the transformed sections of the data to respective services of the target application for processing. | 07-22-2010 |
20100185696 | DATA TRANFORMATIONS FOR APPLICATIONS SUPPORTING DIFFERENT DATA FORMATS - Embodiments of the invention allow structured data to be transferred between a source application and a target application that process structured data in different formats. For example, structured data may have a set of associated rules which transform the structured data based on a set of variables. The source application may register variable definitions for each of the variables in a registry. The target application may read the registry and register values for each of the rule variables. Once values are registered for the variables, the source application may transfer the structured data to a transformation engine that applies the rules, using the registered values for the variables, to transform the structured data into a format compatible with the target application. In doing so, the transformation engine can generate a document in any format compatible with the target application and subsequently transfer the generated document to the target application. | 07-22-2010 |
20110320434 | ENERGY MONETARY COST AWARE QUERY OPTIMIZATION - Embodiments of the invention provide a method of optimizing a query, including determining an execution plan for use in executing the query, based on a monetary cost of the energy needed to execute the query. A query optimization component may determine a plurality of execution plans for the query. The query optimization component may then select one of the plans to use in executing the query based on the monetary cost calculated for the plan. | 12-29-2011 |
20120179712 | ENCODED MATRIX INDEX - A method, apparatus, and program product are provided for creating an Encoded Matrix Index for a column in a database table. An element of the column for all rows in the database table is compared to a corresponding reference value in a reference data structure, and in response to at least one value for the element of the column not matching the reference value, indicating a variation in a variation data structure and creating a value data structure. Queries executed using the Encoded Matrix Index include terms associated with a sub-column defined in a column of a database table. The variation data structure is accessed to determine whether any variation exists between rows belonging to a sub-column of the database table. If no variation exists, a value is accessed from the reference data structure; otherwise, a value for each row of the sub-column is accessed from a value data structure. | 07-12-2012 |
20140351410 | ENDPOINT MANAGEMENT BASED ON ENDPOINT TYPE - Techniques are disclosed to facilitate endpoint management based on endpoint type. Counts of endpoints currently managed by an application are provided for each endpoint type. Weights are provided that each represent a measure of resource consumption by the application in managing an endpoint of a respective endpoint type. A count of additional endpoints of a first endpoint type is determined based on a capacity of a set of available resources. The count is used to facilitate usage of the predefined capacity of the set of available resources. | 11-27-2014 |
20140351436 | ENDPOINT MANAGEMENT BASED ON ENDPOINT TYPE - Techniques are disclosed to facilitate endpoint management based on endpoint type. Counts of endpoints currently managed by an application are provided for each endpoint type. Weights are provided that each represent a measure of resource consumption by the application in managing an endpoint of a respective endpoint type. A count of additional endpoints of a first endpoint type is determined based on a capacity of a set of available resources. The count is used to facilitate usage of the predefined capacity of the set of available resources. | 11-27-2014 |