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: Tools for defining and using custom analysis modules are presented. A generic graphical user interface (GUI) custom analysis tool is presented to a user. The generic GUI custom analysis tool is adapted to receive selections and inputs from the user that define many-to-many relationships in a data store and that include user-defined measures. The inputs are used to generate an instance of a custom analysis module that is capable of being processed against the data store. The instance of the custom analysis module may be stored, recalled, executed, and/or modified from the generic GUI custom analysis tool.
Type:
Grant
Filed:
December 4, 2006
Date of Patent:
October 4, 2011
Assignee:
Teradata US, Inc.
Inventors:
Scott Shelton, David Carmer, Henry Fu, Jason Figge, Leslie Mannion, Michael Chaves, Claud Teeter, Robert Baril
Abstract: Techniques for asynchronous command processing within a parallel processing environment are provided. A command is raised or received within a parallel processing data warehousing environment. A job or a component of the job is dynamically monitored, controlled, or modified in response to the real-time processing of the command. The job is actively processing within the parallel processing data warehousing environment when the command is received and processed against the job or the component of the job.
Abstract: Techniques are presented for embedding testing and debugging features within a service. A user service is modified to include record and playback features. When a record feature is activated, actions and state transitions, which occur within the user service, are monitored and recorded. These actions and transitions are represented within a script. During playback, the actions and state transitions are automatically replayed within the user service by accessing operations of the user service that are represented or mapped within the script.
Abstract: Techniques for independent column detection in selectivity estimations are provided. Values for database statistics are sampled and two independent tests are performed against the values for a first column and a second column. When each test determines that the first and second columns are independent, the first and second columns are said to be independent columns for selectivity estimation.
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.
Type:
Application
Filed:
March 15, 2011
Publication date:
September 8, 2011
Applicant:
TERADATA US, INC.
Inventors:
JEREMY BRANSCOME, MICHAEL CORWIN, LIUXI YANG, JOSEPH I. CHAMDANI
Abstract: A database system that has a plurality of nodes determines whether each node has a first version of database software. A broadcast message is sent from a first node of the database system to other nodes of the database system. In response to the broadcast message, at least each of at least some of the other nodes starts a software module to perform a task with respect to the database software executable in each node.
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.
Type:
Grant
Filed:
December 19, 2007
Date of Patent:
August 30, 2011
Assignee:
Teradata US, Inc.
Inventors:
Thomas K. Ryan, Brian J. Wasserman, Yabing Bi
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 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.
Type:
Grant
Filed:
September 27, 2006
Date of Patent:
August 23, 2011
Assignee:
Teradata US, Inc.
Inventors:
James Carlson, Grace Au, Bhashyam Ramesh, Haiyan Chen
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: 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.
Type:
Grant
Filed:
November 13, 2007
Date of Patent:
August 9, 2011
Assignee:
Teradata US, Inc.
Inventors:
Arash Bateni, Edward Kim, Harminter Atwal, Jean-Philippe Vorsanger
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: 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.
Type:
Grant
Filed:
August 20, 2010
Date of Patent:
August 9, 2011
Assignee:
Teradata US, Inc.
Inventors:
Karen Papierniak, Linette Draper, Paul Cereghini, George R. Hood, Mike Chiufang Hsiao, Gordon Douglas Brooks, Jr., Brian J. Wasserman, Thomas Kevin Ryan
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 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.
Type:
Grant
Filed:
September 19, 2006
Date of Patent:
July 12, 2011
Assignee:
Teradata US, Inc.
Inventors:
John Mark Morris, Criselda Carrillo, P. Keith Muller
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.
Type:
Grant
Filed:
July 2, 2007
Date of Patent:
July 12, 2011
Assignee:
Teradata US, Inc.
Inventors:
Farhan Qazi, Siamak Safarian, YanJun An, Galina Modilevski
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.
Type:
Application
Filed:
March 15, 2011
Publication date:
July 7, 2011
Applicant:
TERADATA US, INC.
Inventors:
JEREMY BRANSCOME, MICHAEL CORWIN, LIUXI YANG, JOSEPH I. CHAMDANI
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.
Type:
Application
Filed:
March 15, 2011
Publication date:
July 7, 2011
Applicant:
TERADATA US, INC.
Inventors:
JEREMY BRANSCOME, MICHAEL CORWIN, LIUXI YANG, JOSEPH I. CHAMDANI
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.