<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://sqlserver.ro/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Intrebari generale</title><link>http://sqlserver.ro/forums/16/ShowForum.aspx</link><description /><dc:language>en</dc:language><generator>CommunityServer 2.1 SP2 (Build: 61129.1)</generator><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/522.aspx</link><pubDate>Wed, 25 Oct 2006 09:36:04 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:522</guid><dc:creator>xmldeveloper</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/522.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=522</wfw:commentRss><description>De fapt e&amp;nbsp;o simulare&amp;nbsp;a unei&amp;nbsp;partitii hash folosind partitionare range.</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/521.aspx</link><pubDate>Wed, 25 Oct 2006 08:25:57 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:521</guid><dc:creator>cretzu</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/521.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=521</wfw:commentRss><description>&lt;p&gt;Deci sa inteleg ca o partitionare hash ar putea sa fie ca ceva de genu:&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--modificarea
structurii tabelului pentru a permite inserarea unei coloane,&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--calculata
folosind o functie de hash simpla pe coloanele SECTIA si ANUNIV&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;ALTER&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; &lt;span style="color:blue;"&gt;TABLE&lt;/span&gt; Studenti_Note_Dub &lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal" style="text-indent:0.5in;"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;ADD&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; HashResult &lt;span style="color:blue;"&gt;INT&lt;/span&gt;
&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;GO&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--
trebuie sa calculam rezultatul functie hash definita mai jos &lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--
rezultat ce tebuie sa fie retinut in HashResult&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;UPDATE&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;
Studenti_Note_Dub &lt;span style="color:blue;"&gt;SET&lt;/span&gt; HashResult &lt;span style="color:gray;"&gt;=&lt;/span&gt; &lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&lt;span&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;/span&gt;&lt;span style="color:gray;"&gt;(&lt;/span&gt;&lt;span style="color:fuchsia;"&gt;CAST&lt;/span&gt;&lt;span style="color:gray;"&gt;(&lt;/span&gt;SECTIA &lt;span style="color:blue;"&gt;AS&lt;/span&gt; &lt;span style="color:blue;"&gt;INT&lt;/span&gt;&lt;span style="color:gray;"&gt;)&lt;/span&gt; &lt;span style="color:gray;"&gt;+&lt;/span&gt; &lt;span style="color:fuchsia;"&gt;CAST&lt;/span&gt;&lt;span style="color:gray;"&gt;(&lt;/span&gt;ANUNIV &lt;span style="color:blue;"&gt;AS&lt;/span&gt; &lt;span style="color:blue;"&gt;INT&lt;/span&gt;&lt;span style="color:gray;"&gt;))&lt;/span&gt; &lt;span style="color:gray;"&gt;%&lt;/span&gt; 2&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;GO&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;br /&gt;&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--
definim functia si schema de partitionare in functie de coloana HashResult&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;CREATE&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; &lt;span style="color:blue;"&gt;PARTITION&lt;/span&gt; &lt;span style="color:blue;"&gt;FUNCTION&lt;/span&gt;
EvidScolStudentiNoteDubHASHPFN&lt;span style="color:gray;"&gt;(&lt;/span&gt;&lt;span style="color:blue;"&gt;INT&lt;/span&gt;&lt;span style="color:gray;"&gt;)&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;AS&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; &lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&lt;span&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;/span&gt;&lt;span style="color:blue;"&gt;RANGE&lt;/span&gt; &lt;span style="color:gray;"&gt;LEFT&lt;/span&gt; &lt;span style="color:blue;"&gt;FOR&lt;/span&gt; &lt;span style="color:blue;"&gt;VALUES&lt;/span&gt; &lt;span style="color:gray;"&gt;(&lt;/span&gt;0&lt;span style="color:gray;"&gt;,&lt;/span&gt; 1&lt;span style="color:gray;"&gt;)&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;GO&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--
schema&lt;span&gt;&amp;nbsp; &lt;/span&gt;este&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:green;"&gt;--------------------------------------------------&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;CREATE&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; &lt;span style="color:blue;"&gt;PARTITION&lt;/span&gt; &lt;span style="color:blue;"&gt;SCHEME&lt;/span&gt;
[EvidScolStudentiNoteDubHASHPScheme]&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';color:blue;"&gt;AS&lt;/span&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt; &lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;&lt;span&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;/span&gt;&lt;span style="color:blue;"&gt;PARTITION&lt;/span&gt;
EvidScolStudentiNoteDubHASHPFN&lt;span&gt;&amp;nbsp; &lt;/span&gt;&lt;span style="color:gray;"&gt;ALL&lt;/span&gt; &lt;span style="color:blue;"&gt;TO&lt;/span&gt; &lt;span style="color:gray;"&gt;(&lt;/span&gt;[PRIMARY]&lt;span style="color:gray;"&gt;)&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class="MsoNormal"&gt;&lt;span style="font-size:8pt;font-family:'Courier New';"&gt;GO&lt;/span&gt;&lt;/p&gt;

&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/514.aspx</link><pubDate>Wed, 25 Oct 2006 05:35:51 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:514</guid><dc:creator>cretzu</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/514.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=514</wfw:commentRss><description>&lt;p&gt;Va multumesc mult amandorura pentru raspunsuri si pentru promptitudine. O sa iau ca atare. Am citit niste articole si de acolo a venit chestia de partitionare hash (ma pregatesc petnru un referat la doctorat). Evident ca inainte de a pune pe forum intrebarea am scotocit bine SQL Server dar cum nu am gasit am zis ca poate exista dar nu am gasit eu. Oricum o sa emulez partitionarea hash pentru ca sa vad ce rezultate am &lt;img src="http://sqlserver.ro/emoticons/emotion-2.gif" alt="Big Smile" /&gt;. &lt;/p&gt;&lt;p&gt;Daniel S.&amp;nbsp;&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/512.aspx</link><pubDate>Tue, 24 Oct 2006 18:52:20 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:512</guid><dc:creator>ggciubuc</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/512.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=512</wfw:commentRss><description>&lt;p&gt;Dupa exemplul lor &lt;/p&gt;&lt;p&gt;DECLARE @HashThis nvarchar(max);&lt;br /&gt;SELECT @HashThis = CONVERT(nvarchar,&amp;#39;dslfdkjLK85kldhnv$n000#knf&amp;#39;);&lt;br /&gt;SELECT HashBytes(&amp;#39;SHA1&amp;#39;, @HashThis);&lt;/p&gt;&lt;p&gt;Apar urmatoarele rezultate:&lt;br /&gt;--SHA1&lt;br /&gt;--0x61E00587A759D7009F4C3A46C14E32FD3E11FB43&lt;br /&gt;--SHA&lt;br /&gt;--0x61E00587A759D7009F4C3A46C14E32FD3E11FB43&lt;br /&gt;--MD5&lt;br /&gt;--0x8FE2945A258B416B9F98D424E69DAE23&lt;br /&gt;--MD4&lt;br /&gt;--0xB9F6E8D0C1CD6B78CE79BF0CD099C60C&lt;br /&gt;--MD2&lt;br /&gt;--0xC93EE95343C6D0A002AF80B94503E6AF&lt;/p&gt;&lt;p&gt;iar &lt;br /&gt;DECLARE @HashThis nvarchar(max);&lt;br /&gt;SELECT @HashThis = CONVERT(nvarchar,&amp;#39;Gigi&amp;#39;);&lt;br /&gt;SELECT HashBytes(&amp;#39;SHA1&amp;#39;, @HashThis);&lt;br /&gt;--SHA1&lt;br /&gt;0x78E63717D95939ED46C5347E9DAC9CBEF2D6B29F&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/510.aspx</link><pubDate>Tue, 24 Oct 2006 18:14:20 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:510</guid><dc:creator>ggciubuc</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/510.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=510</wfw:commentRss><description>&lt;p&gt;Trebuie sa fii atent ce scoate functia hash pt ca rezultatele desemneaza&amp;nbsp;bornele prestabilite, discrete pentru partitii; de exemplu HashBytes ( &amp;#39;&amp;lt;algorithm&amp;gt;&amp;#39;, { @input | &amp;#39;input&amp;#39; } ) cate valori scoate, ca dupa astea, se construiesc partitiile in ss 2005 ?&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/507.aspx</link><pubDate>Tue, 24 Oct 2006 18:05:18 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:507</guid><dc:creator>xmldeveloper</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/507.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=507</wfw:commentRss><description>Alta solutie ar fi o coloana calculata persistata folosind functia &lt;span id="nsrTitle"&gt;&lt;a href="http://msdn2.microsoft.com/en-us/library/ms174415.aspx" target="_blank"&gt;HashBytes&lt;/a&gt;.&lt;/span&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/506.aspx</link><pubDate>Tue, 24 Oct 2006 16:19:27 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:506</guid><dc:creator>ggciubuc</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/506.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=506</wfw:commentRss><description>&lt;p&gt;Da, se poate emula si obtine o partitie de tip hash insa trebuie sa ai grija ce fel de functie hash folosesti: pentru ca functia hash impartire modulo 10 scoate partitiile &amp;lt;0, 0-1,1-2, ..., 7-8,&amp;gt;8 adica vreo 10 partitii daca nu gresesc; asta inseamna 10 filegroup-uri.&lt;/p&gt;&lt;p&gt;Aici &lt;a href="http://whatis.techtarget.com/definition/0,289893,sid9_gci212230,00.html"&gt;http://whatis.techtarget.com/definition/0,289893,sid9_gci212230,00.html&lt;/a&gt;&amp;nbsp;se da , pe langa o explicatie exacta a ceea ce inseamna hashing,&lt;/p&gt;&lt;p&gt;(pentru cine nu stie &lt;img src="http://sqlserver.ro/emoticons/emotion-1.gif" alt="Smile" /&gt; ) , si o lista de functii hash simple (una a folosit-o Cristi). Parerea mea e ca nu trebuie sa fortam limitele atinse de SQL in zona de partitii, nu ne ramane decat sa modelam corespunzator problema folosirii partitiilor.&amp;nbsp;&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/504.aspx</link><pubDate>Tue, 24 Oct 2006 15:36:29 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:504</guid><dc:creator>xmldeveloper</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/504.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=504</wfw:commentRss><description>&lt;p&gt;Din pacate nu hash partition nu reprezinta nimic pentru mine (nu cunosc tehnologia Oracle) insa ce vreti sa realizati?&lt;/p&gt;&lt;p&gt;Din cate stiu puteti obtine ceva similar si cu range partition:&lt;/p&gt;&lt;p&gt;De exemplu daca aveti coloana PersonID INT puteti adauga o coloana calculata persistata avand urmatoarea definitie:&lt;/p&gt;&lt;p&gt;PartitionKey AS (PersonID % 10) PERSISTED&lt;/p&gt;&lt;p&gt;Puteti face partitonarea pe PartitionKey.&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/502.aspx</link><pubDate>Tue, 24 Oct 2006 14:12:20 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:502</guid><dc:creator>ggciubuc</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/502.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=502</wfw:commentRss><description>&lt;p&gt;It is a&amp;nbsp;dream, wake up!&lt;/p&gt;&lt;p&gt;La Oracle se pot face partitii hash (si nu numai) aicea mai asteptam!&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/499.aspx</link><pubDate>Tue, 24 Oct 2006 13:28:40 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:499</guid><dc:creator>cretzu</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/499.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=499</wfw:commentRss><description>&lt;p&gt;As dori sa va mai intreb cum as putea crea un index, I1 on colomns (l_shipdate, l_returnflag, l_linestatus, l_quantity) hash partitioned on (l_returnflag, l_linestatus). Daca poate cine sa ma ajute cu ceva linii de cod ... ar fi supper. Ce am incercat si mi-a reusit a fost sa creez un index, partitionat range dupa l_shipdate. Aici am creat o functie de partitionare care sa aibe ca si tip de date datetime, o schema de partitionare folosind un singur filegroup pentru toate partitiile create de functie, si apoi un clustered index pe acea schema. Problema este ca aceasta este o partitionare range, cum se poate face cea de mai sus, adica o partitionare hash dupa coloanele&amp;nbsp;(l_returnflag, l_linestatus).&lt;/p&gt;&lt;p&gt;CREATE PARTITION FUNCTION SalesPFN(datetime)&lt;br /&gt;AS &lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; RANGE LEFT FOR VALUES (&amp;#39;20041001&amp;#39;)&lt;br /&gt;GO&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;CREATE PARTITION SCHEME [SalesPScheme]&lt;br /&gt;AS &lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; PARTITION SalesPFN&amp;nbsp; ALL TO ([PRIMARY])&lt;br /&gt;GO &lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;CREATE CLUSTERED INDEX CI_INDEX_ANUNIV_SECTIA_DATA_NOTA_DUB&lt;br /&gt;ON [dbo].[Sales](&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; [ l_returnflag] ASC,&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; [l_linestatus] ASC,&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; [l_shipdate] ASC,&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; [l_quantity] ASC&lt;br /&gt;)&lt;br /&gt;WITH (SORT_IN_TEMPDB = OFF, DROP_EXISTING = OFF, IGNORE_DUP_KEY = OFF, ONLINE = OFF) &lt;br /&gt;ON [SalesPScheme](&amp;nbsp; [l_shipdate]  ) &lt;br /&gt;&lt;/p&gt;&lt;p&gt;Sper ca m-am explicat destul de clar.&amp;nbsp;&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;Merci mult, &amp;nbsp;&lt;/p&gt;&lt;p&gt;Daniel S.&amp;nbsp;&lt;/p&gt;</description></item><item><title>Re: indexi</title><link>http://sqlserver.ro/forums/thread/427.aspx</link><pubDate>Thu, 19 Oct 2006 07:47:21 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:427</guid><dc:creator>xmldeveloper</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/427.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=427</wfw:commentRss><description>&lt;p&gt;Un index este o structura B-Tree (un arbore balansat).&lt;/p&gt;&lt;p&gt;Clustered inseamna ca toata tabela este organizata dupa index (sa zicem&amp;nbsp;cartea de telefoane indexata clustered dupa nr pagina) si non-clustered o structura separata (gen index de cuvinte de la sfarsitul unei carti - backup pg 2, pg 34 trigger pg 15, pg 56 etc).&lt;/p&gt;&lt;p&gt;Continuarea aici: &lt;a class="l" href="http://msdn2.microsoft.com/en-us/library/ms190457.aspx"&gt;&lt;strong&gt;&lt;font color="#0000cc"&gt;Index Basics&lt;/font&gt;&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description></item><item><title>indexi</title><link>http://sqlserver.ro/forums/thread/425.aspx</link><pubDate>Thu, 19 Oct 2006 07:39:11 GMT</pubDate><guid isPermaLink="false">963f3a18-65dd-4aad-905c-b785cfe1d7c7:425</guid><dc:creator>cretzu</dc:creator><slash:comments>0</slash:comments><comments>http://sqlserver.ro/forums/thread/425.aspx</comments><wfw:commentRss>http://sqlserver.ro/forums/commentrss.aspx?SectionID=16&amp;PostID=425</wfw:commentRss><description>&lt;p&gt;Salut,&lt;/p&gt;&lt;p&gt;Imi poate cineva explica care este diferenta intre clustered index si non-clustered index, si in ce context ii putem folosi ?&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;Multumesc,&lt;/p&gt;&lt;p&gt;Daniel&amp;nbsp;&lt;/p&gt;</description></item></channel></rss>