Abstract: In a database system, compression user-defined data types (UDTs) are defined to enable compression of data. Each compression UDT is associated with one or more UDT methods to compress data according to one or more respective compression algorithms. Also, one or more data structures are associated with data stored according to each compression UDT to store values pertaining to the compression of the data.
Abstract: A system, method, and computer-readable medium for optimizing join operations in a parallel processing system are provided. A respective set of rows of a first table and a second table involved in a join operation are distributed to each of a plurality of processing modules. The join operation comprises a join on a first column of the first table and a second column of the second table. Each of the plurality of processing modules redistributes at least a portion of the rows of the first table distributed thereto substantially equally among the other processing modules and duplicates at least a portion of the rows of the second table distributed thereto among the plurality of processing modules. The disclosed optimization mechanisms provide for reduced spool space requirements for execution of the parallel join operation.
Abstract: A system, method, and computer-readable medium that facilitate workload management in a computer system are provided. A workload's system resource consumption is adjusted against a target consumption level thereby facilitating maintenance of the consumption to the target consumption within an averaging interval by dynamically controlling workload concurrency levels. System resource consumption is compensated during periods of over or under-consumption by adjusting workload consumption to a larger averaging interval. Further, mechanisms for limiting, or banding, dynamic concurrency adjustments to disallow workload starvation or unconstrained usage at any time are provided.
Abstract: Techniques are presented for skew exception detection within a parallel processing environment. A potential exception is detected when a highest load of a processor within the parallel processing environment exceeds an average load within the parallel processing environment by a given threshold. The potential exception can become a legitimate exception when it exists for a qualified period or time or when it exists and no qualified period of time is noted. In an embodiment, checks for the potential exception occur and are wholly contained within a given configurable interval.
Type:
Grant
Filed:
October 17, 2006
Date of Patent:
January 17, 2012
Assignee:
Teradata US, Inc.
Inventors:
Hoa Tran, Anita Richards, Douglas Brown, Choung Kim
Abstract: A system, such as a database system, includes a shared library having plural routines. A linking procedure is used in which a routine (referred to as a “first routine”) is linked to a stub library containing stub programs corresponding to other routines that the first routine is authorized to invoke. If no linking error occurs, the first routine is then linked to the shared library. In some implementations, the first routine is one of a user-defined method (UDM), user-defined function (UDF), or stored procedure created in response to a database query language (e.g., Structured Query Language or SQL) statement.
Abstract: Apparatus, systems, and methods may operate to receive a set of ordered user-selected compression rules as a compression rule set comprising at least one compression threshold condition, to create or transform a database object with rows to be selectively compressed according to the compression rules in the compression rule set (providing a transformed object), and to publish at least a portion of the transformed object to one of a storage medium or a display screen. Other apparatus, systems, and methods are disclosed.
Type:
Application
Filed:
June 29, 2010
Publication date:
December 29, 2011
Applicant:
Teradata US, Inc.
Inventors:
Congnan Luo, Like Gao, Yu Long, Judy Wu, Michael Leon Reed
Abstract: Apparatus, systems, and methods may operate to receive requests to execute a plurality of compression and/or decompression mechanisms on one or more database objects; to execute each of the compression and/or decompression mechanisms, on a sampled basis, on the database objects; to determine comparative performance characteristics associated with each of the compression and/or decompression mechanisms; and to record at least some of the performance characteristics and/or derivative characteristics derived from the performance characteristics in a performance summary table. The table may be published to a storage medium or a display screen. Other apparatus, systems, and methods are disclosed.
Type:
Application
Filed:
June 29, 2010
Publication date:
December 29, 2011
Applicant:
Teradata US, Inc.
Inventors:
Congnan Luo, Like Gao, Yu Long, Judy Wu, Michael Leon Reed
Abstract: A hierarchical arrangement of nodes is provided to represent Extensible Markup Language (XML) data. In response to a keyword search query containing query keywords, sets of nodes in the hierarchical arrangement are identified for respective query keywords. A smallest of the sets of nodes is identified, and starting with the smallest of the sets of nodes, a stack-based algorithm is applied to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement.
Abstract: A data warehouse system and application which analyzes historical sales and product data contained within a data warehouse to determine the best product prices across a set of products for a retailer. The application analyzes historical sales and product data contained in a database to determine an opportunity score for multiple products sold by a retailer, the opportunity score indicating potential benefit to said business from changing the pricing of a product; and analyzes historical sales data contained in the database to determine an ability to change score for each product, the ability to change score indicating potential risk of lost sales for the retailer from changing the pricing of a product. Results of the analyses are displayed in a scatter plot graph with the graph axes being the opportunity scores and ability to change scores, respectively.
Type:
Grant
Filed:
May 30, 2007
Date of Patent:
December 20, 2011
Assignee:
Teradata US, Inc.
Inventors:
Paul M. Cereghini, Judy Bayer, Enrico Galimberti, Thomas Ryan
Abstract: A computer-implemented apparatus, method, and article of manufacture provide the ability to manage a plurality of database systems. A domain contains the database systems, and a database in one of the systems has segmented global memory partitions. A virtual monitor partition provides logon access to the segmented global memory partitions in a form of a virtual database. Open application programming interfaces (API) enable logon access to the virtual monitor partition to access data in the virtual database. A multi-system regulator manages the domain and utilizes the open APIs to access data in the virtual data base.
Type:
Grant
Filed:
November 19, 2007
Date of Patent:
December 20, 2011
Assignee:
Teradata US, Inc.
Inventors:
Douglas Brown, Todd Walter, Anita Richards, Debra Galeazzi
Abstract: A computer-implemented apparatus, method, and article of manufacture provide the ability to manage a plurality of database systems. A domain contains a plurality of database systems. A system event monitor, on each of the database systems, monitors the database systems' system conditions and operating environment events within the domain. A multi-system regulator manages the domain, communicates with the system event monitor, and creates a dynamic event on one of the database systems based on the system conditions and operating environment events. The dynamic event causes an adjustment to a state of the database system.
Abstract: A method for determining when a database system query optimizer should employ join skew avoidance steps. The method includes dynamically calculating the worst-case anticipated frequency distribution for a particular relation along a particular set of join column(s) at query execution time. The calculated frequency distribution value is compared to a skew threshold, the skew threshold representing the number of rows on the same distinct value that would lead to avoidable processing inefficiencies. It is then determined that the database system query optimizer should employ join skew avoidance steps if the calculated frequency distribution value exceeds the skew threshold.
Abstract: A system and method for managing a complex information process. The system includes an interface for allowing a user to manipulate identifiers indicative of respective information processes to create a user-defined process order; and a processor responsive to the interface for compiling the information processes in accordance with the user-defined process order to define a complex information process. The method includes the steps of manipulating identifiers indicative of respective information processes to create a user-defined process order; and compiling the information processes in accordance with the user-defined process order to define a complex information process.
Abstract: User Defined Functions (UDFs) for a parallel database system are enhanced by making memory persist even when the UDFs terminate. The memory can be shared between different instances of the UDF and the memory can be custom mapped, encrypted, and use custom security.
Abstract: In a database system, a query to perforin an ordered analytic function is received. The query contains a clause specifying creation of dynamic partitions, where the clause contains a partitioning condition to specify the dynamic partitions. During processing of the query, the dynamic partitions are identified based on evaluating the partitioning condition.
Abstract: The subject matter herein relates to database management systems and, more particularly, to decoupled logical and physical data storage within a database management system. Various embodiments provide systems, methods, and software that separate physical storage of data from logical storage of data. These embodiments include a mapping of logical storage to physical storage to allow data to be moved within the physical storage to increase database responsiveness.
Type:
Grant
Filed:
November 30, 2009
Date of Patent:
October 18, 2011
Assignee:
Teradata US, Inc.
Inventors:
Peter Frazier, Paul Andersen, Gary Boggs, Criselda Carrillo, Donn Holtzman, John Mark Morris, P. Keith Muller, Paul Rubio
Abstract: A computer-implemented method, system and article of manufacture for managing workloads in a computer system, comprising monitoring system conditions and operating environment events that impact on the operation of the computer system, using an n-dimensional state matrix to identify at least one state resulting from the monitored system conditions and operating environment events, and initiating an action in response to the identified state.
Abstract: In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations.
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.
Type:
Application
Filed:
May 13, 2011
Publication date:
October 6, 2011
Applicant:
TERADATA US, INC.
Inventors:
Liuxi Yang, Kapil Surlaker, Ravi Krishnamurthy, Michael Corwin, Jeremy Branscome, Krishnan Meiyyappan, Joseph I. Chamdani
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