Abstract: Methods and apparatus for converting a date using spatial information. In one implementation, a method of converting date information using spatial information includes: storing date information in a storage format; receiving target spatial information; retrieving a target format indicator matching the received target spatial information, where the retrieved target format indicator indicates a target format based on a target calendar system; and converting the date information from the storage format to the target format.

Abstract: A system and method for managing a domain comprised of a plurality of database systems, wherein each of the database systems performs database queries to retrieve data stored by the database systems. There are one or more virtual regulators for managing the domain and one or more closed-loop system management (CLSM) regulators for managing each of the database systems in the domain. Both the virtual regulators and CLSM regulators perform parallel virtual optimization of the database queries performed by the database systems.

Abstract: A method, apparatus, and article of manufacture provide the ability to deploy a data management application to a target computer system. Metadata for a master data management (MDM) application is stored in a deployment database. The metadata is representative of business rules and process workflows that manage business data from multiple sources and a model definition for a model for a central business database. Configuration settings for the MDM application are stored in the deployment database. The metadata and configuration settings are retrieved from the deployment database. Installation instructions of the MDM application are confirmed based on input into a graphical user interface. The master data management application is installed on the target computer system based on the installation instructions, metadata, and configuration settings.

Abstract: A method, apparatus, and article of manufacture is configured to define a structured view of data in a computer system. A relational database management system (RDBMS) stores information in the computer system. As part of a process and framework, a series of business rules and process workflows that manage data (that is hierarchical in nature) that resides in one or more RDBMS tables are maintained. User input is accepted that defines a hierarchical structure that is projected onto the data. The hierarchical structure is stored as metadata in the RDBMS. The hierarchical structure is utilized to graphically visualize, manage, and manipulate the data.

Abstract: A Value Analyzer system is a data-driven computer-facilitated financial model that provides accurate and consistent profitability calculations using account and event data stored in a relational database managed by a relational database management system (RDBMS), wherein the account data comprises attributes of the accounts being measured and the event data comprises attributes of account-related transactions. A selector function uses selection criteria to select accounts and events from the relational database in order to generate a number of inputs for profitability calculations.

Abstract: A method, system and computer program for mapping business concepts related to the processing of requests on a database system to database system feature settings is disclosed. Rules limit the requests that will be submitted to the database system for processing and establish workload definitions that can be used to map each request submitted to the database system for processing to database feature settings, based on business concepts associated with each request.

Abstract: A method and computer program for reducing the restart time for a parallel application are disclosed. The parallel application includes a plurality of parallel operators. The method includes repeating the following: setting a time interval to a next checkpoint; waiting until the time interval expires; sending checkpoint requests to each of the plurality of parallel operators; and receiving and processing messages from one or more of the plurality of parallel operators. The method also includes receiving a checkpoint. request message on a control data stream, waiting to enter a state suitable for checkpointing, and sending a response message on the control data stream.

Abstract: A multi-node processing system includes a plurality of nodes in which various software components may be executed. To coordinate the control of the software components in the plural nodes, an instance of a manager module may be started in each of the nodes. In one example arrangement, the manager module may include a WINDOWS® NT or WINDOWS® 2000 service control manager. In the WINDOWS® NT or WINDOWS® 2000 environment, the software components that are controlled through the service control manager may be services. To perform control of the various software components, requests may be sent to the manager module instance in each of the nodes. The manager module then launches one or more server services in each node to perform the desired control task, which may be start the software component, monitor the software component, or terminate the software component.

Abstract: Techniques are presented for automatic search query generation and results set management. A searcher makes selections from metadata; the metadata is associated with a particular lexicon or industry. Furthermore, the selections are mapped to fields associated with a data source. A thread-safe or unique search query is generated in response to the fields. The thread-safe search query is in a query language format which can query the data source. In an embodiment, the thread-safe search query is executed against the data source and the results returned are customized to rank the results, to sort the results, to filter the results, and/or to acquire a random sampling of the results.

Abstract: An application includes a variety of metadata and operations that may process the metadata. Selective portions of the metadata are identified and various combinations of available operations are automatically generated for the selective metadata. Each generated operation is then individually validated for syntax and semantics, without actually executing the operation.

Abstract: A Value Analyzer system is a data-driven computer-facilitated financial model that provides accurate and consistent profitability calculations using account and event data stored in a relational database managed by a relational database management system (RDBMS), wherein the account data comprises attributes of the accounts being measured and the event data comprises attributes of account-related transactions. A selector function uses selection criteria to select accounts and events from the relational database in order to generate a number of inputs for profitability calculations.

Abstract: The subject mater herein relates to database management and, more particularly, to selective database statistics recollection. Various embodiments provide one or more of system, methods, and software that identify database column and index states when statistics become stale to a point where query execution plans against respective columns and indexes fail to be efficient. These and other embodiments provide a way to update column and index statistics only when the statistics are determined to be stale. As a result, adverse database performance as a result of needless updating of database statistics is mitigated.

Abstract: A method, computer program, and database system are disclosed for executing database queries. The database includes a first table (T1) having a primary key (PK) column and a first correlated value column (CV1) and a second table (T2) having a foreign key (FK) column related to the primary key column of the first table and a second correlated value column (CV2). One implementation of the method includes preparing a database query for execution based at least in part on application of a derived constraint rule (DCR) having the form, (PK=FK)?CV2+C1?CV1?CV2+C2, where C1 and C2 are constants and “?” means “implies,” to produce an execution plan. A frequency of errors due to changes in DCRs is taken into account when preparing the execution plan. The plan is then executed.

Abstract: A collection of data is processed and information arising from the processing can be distributed in a variety of ways to support a decision-making process. A query-analyze-distribute approach can be used, and queries, analysis directives, and distribution directives can be associated into a sequence and shared. Access to interim processing is provided, allowing recipients of information to more easily understand and refine the processing. Unbound queries, unbound analysis directives, and unbound distribution directives can be used and shared so that the queries, analysis directives, and distribution directives can be tailored to a particular situation via binding. The query, analysis, and distribution processing can be loosely-coupled to allow easy interchange and combination of sequence elements. A sequence can be scheduled for periodic execution, and distribution of data can be limited to instances when data falls outside of certain expected values.

Abstract: A computer implemented system and method includes obtaining a query referring to rows in a relational database. A sparse index of the database that has a set of rows that is a subset of the rows referred to in the query is obtained. Rows referred to in the query that are not in the sparse index are then obtained and a union of such rows and the rows of the sparse index is performed to obtain a complete row set for processing the query.

Abstract: A system and method include obtaining a query and identifying an aggregate join index (AJI) at a high level of aggregation. The dimension table may be rolled-up with the grouping key being the union of the grouping key in the AJI and the grouping key of the query. The identified AJI is joined with the rolled-up dimension table to obtain columns in the query that are not in the identified AJI. The joined AJI and rolled-up dimension table are then rolled up to answer the query.

Abstract: A system and method include defining a snapshot join index using a sparse condition in a join index definition. A new sparse condition of the snapshot join index is compared with an old sparse condition. Rows in a base table are identified as a function of the comparing, and the join index table is updated using the identified rows.

Abstract: Techniques are presented for mapping a physical table to multiple virtual tables. One or more fields within a results set from a query are mapped or associated to one or more virtual tables. The virtual tables are organized as sub graphs and connected together as a set. A reference to the set is provided to a table join analysis service and a join is performed against the set to produce a single logical reference to a table. The single table reference may be treated as a single table for purposes of subsequent search and retrieval by a searcher.

Abstract: Methods, systems, and data stores are provided for managing interactions between applications and a data store. Threaded applications do not directly read from or write to the data store. An extract utility performs an initial query against the data store on behalf of multiple instances of the applications. The query results service the applications from an application queue. The applications produce application data from processing the query results. The application data is streamed to a load queue and streamed out of the load queue for purposes of creating a temporary table. The temporary table is then merged into an application table of the data store, once all instances of the applications finish processing.

Abstract: A system and method of rewriting a database query where the query contains an aggregate includes the following. If one or more aggregate materialized views are considered, rewriting the query using an aggregate materialized view. If one or more non-aggregate multi-table materialized views are considered, the query is rewritten using a multi-table materialized view. A join cost is determined for each such non-aggregate multi-table materialized view. If one or more non-aggregate single table materialized views are considered, the query is rewritten using the single table materialized view. A join cost is determined for each such non-aggregate single table materialized view. Finally, a current total cost is determined for use of various materialized views as a function of join cost, aggregation cost and spool cost to select a rewritten query.