Abstract: A method, apparatus, and article of manufacture provide the ability to import a first data model into a meta-data representation in one or more computers. An import wizard or graphical user interface is invoked and guides a user through a process of importing the first data model into the meta-data representation. A source is selected that specifies database connectivity information of a source database containing the first data model. A schema is selected from the selected source, from which tables will be imported into the meta-data representation. A list of all table names within the selected schema is retrieved and displayed. Tables are selected from the list of all table names to import into the meta-data representation. Table information, for all of the selected tables, is populated into the meta-data representation.

Abstract: A query is received to perform a temporal aggregate on at least one attribute of a temporal table. In response to the query, value changes of the at least one attribute at timestamps are computed, and the value changes are aggregated to produce an aggregate value for the query.

Abstract: A method and system for performing logical partial declustering in a shared-nothing database environment. The solution defines a partial declustering technique that can be used to dynamically adapt the declustering of base tables or intermediate result sets. The partial declustering technique is defined to limit the number of partitions (P) involved in an operation. The technique is defined to limit the operation to a subset of the system partitioning map (SPM). There are two components: the association between the data values and partitions is altered by restricting the data values to P? partition values where P? is less than P; and the actual partitions of the SPM selected are then derived based on a seed derived from a dynamic parameter, such as a session number, or a static parameter, such as a table identifier. In the case of intermediate result sets the number of P? partitions selected is a cost based decision based on the estimated number of rows in the input intermediate result sets.

Abstract: A SQL query that includes an IN-List is optimized by utilizing an array insert to insert the IN-List into a spool and piggybacking IN-List rows into a join step.

Abstract: An improved method for forecasting and modeling product demand for a product during promotional periods. The forecasting methodology employs a multivariable regression model to model the causal relationship between product demand and the attributes of past promotional activities. The model is utilized to calculate the promotional uplift from the coefficients of the regression equation. The methodology utilizes a mathematical formulation that transforms regression coefficients, a combination of additive and multiplicative coefficients, into a single promotional uplift coefficient that can be used directly in promotional demand forecasting calculations.

Abstract: Techniques are presented for managing fraud information. Metadata defines user profiles, security levels, fraud cases, and presentation information. One or more queries or reports are processed against disparate data store tables and the results are aggregated into a repository. The repository is also defined by the metadata. Furthermore, operations associated with sharing, viewing, and accessing the results from the repository is defined and controlled by the metadata. In an embodiment, portions of the metadata may be viewed and navigated in a hierarchical and graphical formatted presentation.

Abstract: A method, computer program, and database system are disclosed for storing element-based descriptions of documents in a database. The database system includes one or more nodes. Each of the one or more nodes provides access to one or more of a plurality of CPUs. Each of the one or more CPUs provides access to one or more of a plurality of virtual processes. Each virtual process is configured to manage data stored in one of a plurality of data-storage facilities. The data stored in the plurality of data-storage facilities includes data representing a database table. A row of the table corresponds to an element of the element-based document description and includes: data describing the element, an order identifier corresponding to the element, and a range identifier corresponding to the element.

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.

Abstract: A query enhancer module providing a unique method to modify user submitted queries within a web-based, multi-tier enterprise solution. The user submitted query specifies data to be retrieved from a database. Without any user interaction the query enhancer module rewrites the query to specify a subset of the data specified in the user submitted query. This rewritten query is then executed against the database to retrieve the subset of the data. Generally, the subset set of the data comprises the amount of data that can be displayed on a single web page.

Abstract: A technique for managing storage of a data object in a storage device involves receiving the data object (A) to store in the storage device, where the data object has an indicator bit pattern (P). Successive compression data transformations are applied to data object A to obtain respective corresponding compressed data objects, and one of these compressed data objects is selected, such that the selected compressed data object (C) has the shortest length with respect to the remaining compressed data objects. Compression information (I) is then associated with the compression data transformation used to generate data object C, and a threshold value T is calculated at least partly from the length of compression information I. If length (C)+T?length (A), then the indicator bit pattern of data object A is reset and the data object A is written to the storage device.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Techniques for dynamic resource management are presented. A World-Wide Web (WWW) page is acquired on first access to a WWW site and rendered with a script tag. When a browser loads the WWW page, the script tag is processed to remotely execute a script on the WWW site. The script produces a single file having code for the resources that are referenced in the WWW page. The single file is provided back to the browser where it is cached so that when any of the resources are accessed via the WWW page, the needed code for those resources are available for execution within the cache of the browser.

Abstract: Methods and systems for processing collaterals are described. A method may include receiving qualifying criteria from a client. The qualifying criteria may define assignments of one or more collaterals. An assignment tool may be generated based on the qualifying criteria. The assignment tool may include a number of stored attributes and one or more interaction attribute to be determined based on a customer interaction. The assignment tool may be used to assign a collateral to a customer. Additional methods and systems are disclosed.

Abstract: Methods and systems for setting goals and modifying segment criteria counts are described. A method may include displaying to a user a graphical user interface (GUI) to enable the user to combine multiple search criteria having variable parameters, used in searching of a database, to produce a predefined count of search results. User selections of the multiple search criteria, values for the variable parameters, and Boolean operations to combine the search criteria may be received from the user. As the received user selections change, a count of search results retrieved from the database, based on the user selections, may be dynamically displayed. Additional methods and systems are disclosed.

Abstract: Apparatus, systems, and methods may operate to acquire an original data set comprising a series of data points having an independent portion and a dependent portion, the dependent portion representing a measure of device performance that depends on at least one device characteristic represented by the independent portion. Additional activity may include identifying outlier data points in the series by determining, in comparison with all other members of the series, whether the outlier data points conform to a known trend of the series; transforming the original data set into a transformed data set by removing the outlier data points from the series; and publishing the transformed data set. Other apparatus, systems, and methods are disclosed.

Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Abstract: A technique for providing an updatable result set from multiple joined tables derived from a plurality of databases includes testing for at least one unique index from each of the multiple joined tables. A technique for providing an updatable result set from multiple joined tables that may include null values for outer-joined tables includes testing for a connection to the unique indexes and the null values.

Abstract: Techniques for precedence based storage are presented. Storage for a database is organized into storage pools; collections of pools form storage classes. The storage pools within a particular class are organized in a precedence-based order so that when storage for the database is needed, the storage pools are used in the defined order of precedence. Additionally, each storage pool or storage class can be circumscribed by security limitations, quality of service limitations, and/or backup procedures.

Abstract: Methods and systems that implement enhanced user interactions with a grid are described. A method may include generating a grid of cells arranged in a number of rows and columns. Each row may correspond to a data record of a database. The grid may be displayed to a user while identifying one or more cells as editable cells. Input data may be received from the user for each of the editable cells. The input data may be validated using predefined criteria to identify incorrect input data and errors associated with the incorrect input data may be displayed to the user. Additional methods and systems are disclosed.