Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.
Type:
Grant
Filed:
July 10, 2007
Date of Patent:
December 16, 2014
Assignee:
Teradata US, Inc.
Inventors:
Michael Chaves, Kasturi Belur, Scott Shelton, Henry Fu
Abstract: A system and method of massively parallel data processing are disclosed. In an embodiment, a method includes generating an interpretation of a customizable database request which includes an extensible computer process and providing an input guidance to available processors of an available computing environment. The method further includes automatically distributing an execution of the interpretation across the available computing environment operating concurrently and in parallel, wherein a component of the execution may be limited to at least a part of an input data. The method also includes automatically assembling a response using a distributed output of the execution.
Abstract: To determine a system condition, temperature information from at least one temperature sensor in the system is received, along with second information from at least a second type of sensor in the system. An out-of-range temperature condition is detected according to the received temperature information. According to the second information, one of plural potential causes of the out-of-range temperature condition is selected.
Abstract: A join plan creates an intermediate table from two or more database tables within a database. In doing so, at least one projected and compressible column within one of the database tables is identified, where the column contains data values to which the application of a compression data transformation results in a reduction in the size of the data values. The frequency of occurrences of at least some unique values in the compressible column is identified, and then the two or more database tables are joined. The results of the join are then stored in the intermediate table such that the compression data transformation is applied to at least some of the unique values in the compressible column for which the frequency has been identified.
Abstract: Graphical User Interfaces for custom lists and labels are provided. A database includes fields that define views when processed by an application server on behalf of a user. At least one view permits the user to supply criteria for custom defining lists or sets of labels, which are also retrieved from the database by the application server.
Type:
Grant
Filed:
April 17, 2007
Date of Patent:
November 4, 2014
Assignee:
Teradata US, Inc.
Inventors:
Linette Draper, Thomas Kevin Ryan, Brian J. Wasserman, Paul H. Phibbs
Abstract: A system and method for compressing and decompressing multiple types of character data. The system and method employ multiple encoding tables, each designed for encoding a subset of character data, such as numeric data, uppercase letters, lowercase letters, Latin, or UNICODE data, to perform compressions and decompression of character data, and. The compression solution also provides for the creation of new encoding tables on the fly, and accommodates the compression of lengthy character streams using multiple different general compression algorithms, automatically choosing a suitable general compression algorithm for specific input data.
Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.
Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.
Type:
Grant
Filed:
April 7, 2008
Date of Patent:
October 14, 2014
Assignee:
Teradata US, Inc.
Inventors:
Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Corwin, Ravi Krishnamurthy, Kapil Surlaker, James Shau, Joseph I. Chamdani
Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.
Abstract: An event tap associated with a server, such as a Web server, at a machine can transform a server event into a tuple, select a database node for the tuple, and place the tuple in a queue for that database node, and then flush the queue periodically directly into database nodes. The use of an event tap can thus reduce the computational burden on the database while keeping the server event data in the database relatively fresh.
Type:
Grant
Filed:
December 19, 2006
Date of Patent:
September 30, 2014
Assignee:
Teradata US, Inc.
Inventors:
George Candea, Anastasios Argyros, Mayank Bawa
Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.
Abstract: Probabilistic record linking methods and a system are provided. Selections are acquired; the selections identify the two data sources, column identifiers from each of the two data sources, pairs of column identifiers from each of the two data sources, a confidence values for matching each record associated with each pair. The selections are used to compare data housed in the two data sources. Based on the comparison, matched records and non matched records are identified from the two data sources.
Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.
Abstract: Techniques for data integration are provided. Source attributes for source data are interactively mapped to target attributes for target data. Rules define how records from the source data are merged, selected, and for duplication detection. The mappings and rules are recorded as a profile for the source data and processed against the source data to transform the source attributes to the target attributes.
Type:
Application
Filed:
September 30, 2013
Publication date:
September 18, 2014
Applicant:
Teradata US, Inc.
Inventors:
Thomas Kevin Ryan, Achal Patel, Neelesh Bansode, Arvind Kumar, Anand Louis
Abstract: Techniques for data modeling are provided. Enterprise data is organized into reference data for entities that an enterprise wants to track and monitor. Relationship data is created that establishes relationships among the various entities within the enterprise data. The reference data and the relationship data are published within an enterprise data warehouse for accessing the enterprise data.
Abstract: Data cleansing and standardization techniques are provided. A user interactively defines rules for cleansing and standardizing data of a source dataset. The rules are applied to the data and varying degrees of results and metrics associated with applying the rules are presented to the user for inspection and analysis.
Abstract: Techniques for mapping a virtual R-Tree to an extensible-hash based file system for databases are provided. Spatial data is identified within an existing file system, which stores data for a database. Rows of the spatial data are organized into collections; each collection represents a virtual block. The virtual blocks are used to form an R-Tree spatial index that overlays an existing index for the database on the existing file system. Each row within its particular virtual block includes a pointer to its native storage location within the existing file system.
Abstract: A system, method, and computer-readable medium that facilitate dynamic skew avoidance are provided. The disclosed mechanisms advantageously do not require any statistic information regarding which values are skewed in a column on which a query is applied. Query selectivity is evaluated at a check point and thereby facilitates accurate detection of an overloaded processing module. The successful detection of an overloaded processing module causes other processing modules to stop sending more skewed rows to the overloaded processing module. Detection of an overloaded processing module is made when the overloaded processing module has received more rows than a target number of rows. Further, skewed rows that are maintained locally rather than redistributed to a detected processing module may result in more processing modules becoming overloaded. Advantageously, the disclosed mechanisms provide for a final redistribution adjustment to provide for even distribution of rows among all processing modules.
Abstract: A system, method, and computer-readable medium that facilitate counting the number of distinct values in several columns of a table utilizing parallel aggregation mechanisms.
Abstract: A database system includes an optimizer to generate resource estimates regarding execution of a request in the database system, and a regulator to monitor execution of a request and to adjust a priority level of the request based on the monitored execution and based on the resource estimates provided by the optimizer. The regulator is executable to further feed back statistics regarding execution of the request to the optimizer to improve accuracy of resource estimates provided by the optimizer.
Type:
Grant
Filed:
June 11, 2009
Date of Patent:
August 26, 2014
Assignee:
Teradata US, Inc.
Inventors:
Douglas P. Brown, Anita Richards, Louis M. Burger, Stephen A. Brobst