From: "Eliober Cleger Despaigne" <ecleger@uci.cu>
To: <pgsql-sql@postgresql.org>
Subject: about LEFT and INNER JOIN
Date: Tue, 23 May 2017 14:38:45 -0400
Message-ID: <012301d2d3f3$cf464bd0$6dd2e370$@uci.cu>
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_0124_01D2D3D2.4834ABD0"
Thread-Index: AdLT8v9ciwkyeX5ARFGTPJVLMK3f5g==
Content-Language: es
Precedence: bulk
Sender: pgsql-sql-owner@postgresql.org

This is a multipart message in MIME format.

------=_NextPart_000_0124_01D2D3D2.4834ABD0
Content-Type: text/plain;
	charset="us-ascii"
Content-Transfer-Encoding: 7bit

Grettings 

I need to know which algorithm uses the INNER JOIN and LEFT JOIN. If would
be possible, I need to know their costs too in O(n) notation.


﻿La @universidad_uci es Fidel. Los jóvenes no fallaremos.
#HastaSiempreComandante
#HastalaVictoriaSiempre
------=_NextPart_000_0124_01D2D3D2.4834ABD0
Content-Type: text/html;
	charset="us-ascii"
Content-Transfer-Encoding: quoted-printable

<html xmlns:v=3D"urn:schemas-microsoft-com:vml" =
xmlns:o=3D"urn:schemas-microsoft-com:office:office" =
xmlns:w=3D"urn:schemas-microsoft-com:office:word" =
xmlns:m=3D"http://schemas.microsoft.com/office/2004/12/omml" =
xmlns=3D"http://www.w3.org/TR/REC-html40"><head><meta =
http-equiv=3DContent-Type content=3D"text/html; =
charset=3Dus-ascii"><meta name=3DGenerator content=3D"Microsoft Word 15 =
(filtered medium)"><style><!--
/* Font Definitions */
@font-face
	{font-family:"Cambria Math";
	panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
	{font-family:Calibri;
	panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
	{margin:0cm;
	margin-bottom:.0001pt;
	font-size:11.0pt;
	font-family:"Calibri","sans-serif";
	mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
	{mso-style-priority:99;
	color:#0563C1;
	text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
	{mso-style-priority:99;
	color:#954F72;
	text-decoration:underline;}
span.EstiloCorreo17
	{mso-style-type:personal-compose;
	font-family:"Calibri","sans-serif";
	color:windowtext;}
span.alt-edited
	{mso-style-name:alt-edited;}
.MsoChpDefault
	{mso-style-type:export-only;
	font-family:"Calibri","sans-serif";
	mso-fareast-language:EN-US;}
@page WordSection1
	{size:612.0pt 792.0pt;
	margin:70.85pt 3.0cm 70.85pt 3.0cm;}
div.WordSection1
	{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext=3D"edit" spidmax=3D"1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext=3D"edit">
<o:idmap v:ext=3D"edit" data=3D"1" />
</o:shapelayout></xml><![endif]--></head><body lang=3DES =
link=3D"#0563C1" vlink=3D"#954F72"><div class=3DWordSection1><p =
class=3DMsoNormal>Grettings <o:p></o:p></p><p class=3DMsoNormal><span =
class=3Dalt-edited><span lang=3DEN>I need to know which algorithm uses =
the INNER JOIN and LEFT JOIN. If would be possible, I need to know their =
costs too in O(n) notation.</span></span><span =
lang=3DEN-US><o:p></o:p></span></p></div>
<br>=
<body>=0A<html>=0A<hr align=3D"left" noshade=3D"noshade" size=3D"2" width=3D"80%" />=0ALa @universidad_uci es Fidel. Los j&oacute;venes no fallaremos.=0A#HastaSiempreComandante=0A#HastalaVictoriaSiempre=0A<br>=0A<div style=3D"clear:both"> </div>=0A</body>=0A</html>=0A
<br>=
</body></html>
------=_NextPart_000_0124_01D2D3D2.4834ABD0--