2009Unpublished venueRequires access

Exploring PROC SQL ® Joins and Join Algorithms

Kirk Paul Lafler

Open publisher page 2 citations

Abstract

Real systems rarely store all their data in one large table. To do so would require maintaining several duplicate copies of the same values and could threaten the integrity of the data. Instead, IT departments typically split their data among several different tables. As a result, a method is needed to access two or more tables to help answer the interesting questions about our data. This presentation describes the various join algorithms as well as the join processes including Cartesian product joins, inner joins, and outer joins.

About this research paper

What this paper is about

Real systems rarely store all their data in one large table. To do so would require maintaining several duplicate copies of the same values and could threaten the integrity of the data. Instead, IT departments typically split their data among several different tables. As a result, a method is needed to access two or more tables to help answer the interesting questions about our data. This presentation describes the various join algorithms as well as the join processes including Cartesian product joins, inner joins, and outer joins.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Real systems rarely store all their data in one large table. To do so would require maintaining several duplicate copies of the same values and could threaten the integrity of the data. Instead, IT departments typically split their data among several different tables. As a result, a method is needed to access two or more tables to help answer the interesting questions about our data. This presentation describes the various join algorithms as well as the join processes including Cartesian product joins, inner joins, and outer joins.

Key concepts: Joins, Join (topology), Computer science, SQL, Sort-merge join, Database, Cartesian product, Table (database)

Related papers

Back to paper searchBrowse research topicsOriginal source
Exploring PROC SQL ® Joins and Join Algorithms — Research Paper | ScholarLens