<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/atom10full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:blogger="http://schemas.google.com/blogger/2008" xmlns:georss="http://www.georss.org/georss" xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr="http://purl.org/syndication/thread/1.0" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" gd:etag="W/&quot;DUMCQnY_fCp7ImA9WhBbGEQ.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734</id><updated>2013-05-18T22:47:43.844+05:30</updated><category term="Teradata" /><category term="Unix program" /><category term="microsoft sql server installation" /><category term="writing file" /><category term="visual basic tutorial" /><category term="C" /><category term="as3" /><category term="finalize" /><category term="java Exception handling" /><category term="java reading" /><category term="CodeIgniter" /><category term="algorithms" /><category term="javascript tutorial" /><category term="polymorphism java" /><category term="runge kutta" /><category term="DOM" /><category term="symbol table code" /><category term="flash application" /><category term="excel formulas" /><category term="advance computer architecture" /><category term="static java tutorial" /><category term="data-types" /><category term="Data Warehouse" /><category term="review" /><category term="ucertify" /><category term="facebook" /><category term="java modifiers" /><category term="code 2 learn" /><category term="aes" /><category term="servlets tutorial" /><category term="java graphics tutorial" /><category term="html tutorial" /><category term="excel graphs" /><category term="karel the robot tutorial" /><category term="eclipse basics" /><category term="class in java" /><category term="codelobster" /><category term="insertion sort" /><category term="java array tutorial" /><category term="java writing" /><category term="php tutorial" /><category term="heapsort algorithm" /><category term="excel tutorial" /><category term="internet marketing" /><category term="android code" /><category term="jdbc tutorial" /><category term="problems" /><category term="android tutorial" /><category term="Layouts" /><category term="OOP" /><category term="final" /><category term="Inheritance java" /><category term="methods" /><category term="ubuntu" /><category term="java code" /><category term="excel charts" /><category term="heapsort java code" /><category term="computer graphics tutorial" /><category term="segmentation" /><category term="identifiers. keywords" /><category term="java methods" /><category term="histogram equalization" /><category term="java graphics basics" /><category term="insertion sort java" /><category term="image processing tutorial" /><category term="apple" /><category term="python tutorial" /><category term="insertion sort code" /><category term="java arrays" /><category term="GUI" /><category term="public static void main explained" /><category term="kaju katli andoid" /><category term="Encapsulation java" /><category term="kaju katli" /><category term="h1 tags" /><category term="steve jobs" /><category term="merger sort java" /><category term="eclipse ide" /><category term="edge detection" /><category term="sortableStack implementation" /><category term="TD tag" /><category term="oose design concept tutorial" /><category term="microsoft sql server" /><category term="cloud computing" /><category term="finally" /><category term="java tutorial" /><category term="insalling python" /><category term="sql basics" /><category term="morphology" /><category term="encryption java" /><category term="seo" /><category term="final keyword" /><category term="merge sort code" /><category term="java android" /><category term="multilingual" /><category term="reading file" /><category term="good practices" /><category term="java aes" /><category term="linked list" /><category term="drupal" /><category term="linked list java" /><category term="numbers" /><category term="static keyword" /><category term="java exceptions" /><category term="decryption java" /><category term="sql tutorial" /><category term="keywords" /><title>Code 2 Learn</title><subtitle type="html">We at Code 2 Learn share our knowledge which is priceless, so take this opportunity and Learn, Code, Share.</subtitle><link rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml" href="http://www.code2learn.com/feeds/posts/default" /><link rel="alternate" type="text/html" href="http://www.code2learn.com/" /><link rel="next" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default?start-index=6&amp;max-results=5&amp;redirect=false&amp;v=2" /><author><name>farhan khwaja</name><uri>https://plus.google.com/103681193096122122382</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="32" height="32" src="//lh5.googleusercontent.com/-C_u8nBnnSao/AAAAAAAAAAI/AAAAAAAABCU/1iCm2Fp30ow/s512-c/photo.jpg" /></author><generator version="7.00" uri="http://www.blogger.com">Blogger</generator><openSearch:totalResults>126</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>5</openSearch:itemsPerPage><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/atom+xml" href="http://feeds.feedburner.com/Code2Learn" /><feedburner:info uri="code2learn" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><feedburner:emailServiceId>Code2Learn</feedburner:emailServiceId><feedburner:feedburnerHostname>http://feedburner.google.com</feedburner:feedburnerHostname><entry gd:etag="W/&quot;DU4EQX45cSp7ImA9WhBVFEk.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734.post-7303486869977170784</id><published>2013-04-20T14:21:00.001+05:30</published><updated>2013-04-20T14:21:40.029+05:30</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2013-04-20T14:21:40.029+05:30</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="Teradata" /><title>Indexes in Teradata</title><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/7303486869977170784?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/7303486869977170784?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/Code2Learn/~3/dA7VWCLoBvg/indexes-in-teradata.html" title="Indexes in Teradata" /><author><name>farhan khwaja</name><uri>https://plus.google.com/103681193096122122382</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="32" height="32" src="//lh5.googleusercontent.com/-C_u8nBnnSao/AAAAAAAAAAI/AAAAAAAABCU/1iCm2Fp30ow/s512-c/photo.jpg" /></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="http://3.bp.blogspot.com/-SUFQEm8KZRM/UXJPZGWQEXI/AAAAAAAABEo/t-2UARZpImM/s72-c/PI.JPG" height="72" width="72" /><content type="html">

Teradata as we all know is a Relational Database Management System (RDBMS) for the world's largest commercial databases. It is the market leader in  Data Warehousing. Its architecture is so designed that it takes advantage of the concept of parallelism.



Almost every Database has what we know as KEY i.e. Primary Key, Foreign Key etc defined while implementing the DDL of a table. But in &lt;div class="feedflare"&gt;
&lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:yIl2AUoC8zA"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=yIl2AUoC8zA" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:-BTjWOF_DHI"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=dA7VWCLoBvg:t38mvVZlAYE:-BTjWOF_DHI" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:TzevzKxY174"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=TzevzKxY174" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:V_sGLiPBpWU"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=dA7VWCLoBvg:t38mvVZlAYE:V_sGLiPBpWU" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:qj6IDK7rITs"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=qj6IDK7rITs" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=dA7VWCLoBvg:t38mvVZlAYE:gIN9vFwOqvQ"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=dA7VWCLoBvg:t38mvVZlAYE:gIN9vFwOqvQ" border="0"&gt;&lt;/img&gt;&lt;/a&gt;
&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/Code2Learn/~4/dA7VWCLoBvg" height="1" width="1"/&gt;</content><feedburner:origLink>http://www.code2learn.com/2013/04/indexes-in-teradata.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CkYHQXo8fSp7ImA9WhBQF0o.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734.post-3824803307696500986</id><published>2013-03-20T10:52:00.001+05:30</published><updated>2013-03-20T14:32:10.475+05:30</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2013-03-20T14:32:10.475+05:30</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="internet marketing" /><title>Google plus for companies, soon allowed the nicknames</title><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/3824803307696500986?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/3824803307696500986?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/Code2Learn/~3/647uOv3-ciw/google-plus-for-companies-soon-allowed.html" title="Google plus for companies, soon allowed the nicknames" /><author><name>Todd Kosher</name><uri>https://plus.google.com/104564199959761898954</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="16" height="16" src="http://img2.blogblog.com/img/b16-rounded.gif" /></author><content type="html">
&amp;lt;!--[if gte mso 9]&amp;gt;
 
  
  
 
&amp;lt;![endif]--&amp;gt;



In
anticipation of the company profiles + Google opens up to nickname

Google has
announced that on your social network will soon be possible to sign up using
nicknames or pseudonyms, a step towards the company profiles on Google plus.



The social
network Google Plus still under the spotlight, after the announcements
(more or less truthful) about &lt;div class="feedflare"&gt;
&lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:yIl2AUoC8zA"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=yIl2AUoC8zA" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:-BTjWOF_DHI"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=647uOv3-ciw:yllLUc65tCo:-BTjWOF_DHI" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:TzevzKxY174"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=TzevzKxY174" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:V_sGLiPBpWU"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=647uOv3-ciw:yllLUc65tCo:V_sGLiPBpWU" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:qj6IDK7rITs"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=qj6IDK7rITs" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=647uOv3-ciw:yllLUc65tCo:gIN9vFwOqvQ"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=647uOv3-ciw:yllLUc65tCo:gIN9vFwOqvQ" border="0"&gt;&lt;/img&gt;&lt;/a&gt;
&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/Code2Learn/~4/647uOv3-ciw" height="1" width="1"/&gt;</content><feedburner:origLink>http://www.code2learn.com/2013/03/google-plus-for-companies-soon-allowed.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CkINQXg4fSp7ImA9WhBTGU0.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734.post-7442321032107720011</id><published>2013-02-11T11:44:00.001+05:30</published><updated>2013-02-15T09:26:30.635+05:30</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2013-02-15T09:26:30.635+05:30</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="algorithms" /><title>QuickSort Algorithm Tutorial</title><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/7442321032107720011?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/7442321032107720011?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/Code2Learn/~3/USJ9cCA6kJo/quick-sort-algorithm-tutorial.html" title="QuickSort Algorithm Tutorial" /><author><name>farhan khwaja</name><uri>https://plus.google.com/103681193096122122382</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="32" height="32" src="//lh5.googleusercontent.com/-C_u8nBnnSao/AAAAAAAAAAI/AAAAAAAABCU/1iCm2Fp30ow/s512-c/photo.jpg" /></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="http://1.bp.blogspot.com/--9x3QrYCYvE/URiL6Bfds6I/AAAAAAAABEQ/_oYdmJGo5zY/s72-c/Quicksort-example.gif" height="72" width="72" /><content type="html">

We have already done tutorial on Merge Sort and a tutorial on Heap Sort (Array Based) with both having a time complexity of O(n*log n). Here is another algorithm which has a time complexity of O(n*log n) and it's called QuickSort.




QuickSort as we all know has a similar approach to Merge Sort i.e. it uses Divide-and-Conquer recursive algorithm to sort the values. The difference being is it's&lt;div class="feedflare"&gt;
&lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:yIl2AUoC8zA"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=yIl2AUoC8zA" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:-BTjWOF_DHI"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=USJ9cCA6kJo:J3jjetiPjwI:-BTjWOF_DHI" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:TzevzKxY174"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=TzevzKxY174" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:V_sGLiPBpWU"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=USJ9cCA6kJo:J3jjetiPjwI:V_sGLiPBpWU" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:qj6IDK7rITs"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=qj6IDK7rITs" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=USJ9cCA6kJo:J3jjetiPjwI:gIN9vFwOqvQ"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=USJ9cCA6kJo:J3jjetiPjwI:gIN9vFwOqvQ" border="0"&gt;&lt;/img&gt;&lt;/a&gt;
&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/Code2Learn/~4/USJ9cCA6kJo" height="1" width="1"/&gt;</content><feedburner:origLink>http://www.code2learn.com/2013/02/quick-sort-algorithm-tutorial.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CUcGSX8-fyp7ImA9WhBTFU8.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734.post-4757138932110774939</id><published>2013-02-10T17:51:00.002+05:30</published><updated>2013-02-11T00:33:48.157+05:30</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2013-02-11T00:33:48.157+05:30</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="algorithms" /><title>Binary Search Tree (BST) Algorithm Tutorial</title><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/4757138932110774939?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/4757138932110774939?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/Code2Learn/~3/82sFE26rfeQ/binary-search-tree-bst-algorithm.html" title="Binary Search Tree (BST) Algorithm Tutorial" /><author><name>farhan khwaja</name><uri>https://plus.google.com/103681193096122122382</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="32" height="32" src="//lh5.googleusercontent.com/-C_u8nBnnSao/AAAAAAAAAAI/AAAAAAAABCU/1iCm2Fp30ow/s512-c/photo.jpg" /></author><content type="html">
Earlier we had a tutorial on Binary Seach Tree Basics, which you can check for refreshing the knowledge about it. Today we will be taking a look on BST algorithm and implementing it using Java.

Binary Search Tree is node based binary tree data structure with the following properties:

* The Left subtree contains the nodes with keys less than the node's key.
* The Right subtree contains the &lt;div class="feedflare"&gt;
&lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:yIl2AUoC8zA"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=yIl2AUoC8zA" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:-BTjWOF_DHI"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=82sFE26rfeQ:R0TSBIZhr_s:-BTjWOF_DHI" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:TzevzKxY174"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=TzevzKxY174" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:V_sGLiPBpWU"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=82sFE26rfeQ:R0TSBIZhr_s:V_sGLiPBpWU" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:qj6IDK7rITs"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=qj6IDK7rITs" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=82sFE26rfeQ:R0TSBIZhr_s:gIN9vFwOqvQ"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=82sFE26rfeQ:R0TSBIZhr_s:gIN9vFwOqvQ" border="0"&gt;&lt;/img&gt;&lt;/a&gt;
&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/Code2Learn/~4/82sFE26rfeQ" height="1" width="1"/&gt;</content><feedburner:origLink>http://www.code2learn.com/2013/02/binary-search-tree-bst-algorithm.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CU8FR3o_fSp7ImA9WhNbFko.&quot;"><id>tag:blogger.com,1999:blog-4091247733454378734.post-4656106630353155022</id><published>2013-01-06T23:30:00.000+05:30</published><updated>2013-01-20T14:53:36.445+05:30</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2013-01-20T14:53:36.445+05:30</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="Data Warehouse" /><title>Data Warehouse Design Approaches</title><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/4656106630353155022?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/4091247733454378734/posts/default/4656106630353155022?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/Code2Learn/~3/bfuj4xPIRe4/data-warehouse-design-approaches.html" title="Data Warehouse Design Approaches" /><author><name>farhan khwaja</name><uri>https://plus.google.com/103681193096122122382</uri><email>noreply@blogger.com</email><gd:image rel="http://schemas.google.com/g/2005#thumbnail" width="32" height="32" src="//lh5.googleusercontent.com/-C_u8nBnnSao/AAAAAAAAAAI/AAAAAAAABCU/1iCm2Fp30ow/s512-c/photo.jpg" /></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="http://3.bp.blogspot.com/-_6GRtl7NP-g/UOk7p1aKfUI/AAAAAAAABBw/VUUuCOX4iJw/s72-c/TopDownApproach.gif" height="72" width="72" /><content type="html">

In our previous posts we have got to learn about Data Warehousing Objects, different kinds of Data Warehouse schemas and Data Warehouse Basics. Now it time we learn about how to build or design a Data Warehouse. 



Designing or Building of a Data Warehouse can be done following either one of the approaches. These approaches are notably known as:



* The Top-Down Approach

* The Bottom-Up &lt;div class="feedflare"&gt;
&lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:yIl2AUoC8zA"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=yIl2AUoC8zA" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:-BTjWOF_DHI"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=bfuj4xPIRe4:ft_IvjVa6is:-BTjWOF_DHI" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:TzevzKxY174"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=TzevzKxY174" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:V_sGLiPBpWU"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=bfuj4xPIRe4:ft_IvjVa6is:V_sGLiPBpWU" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:qj6IDK7rITs"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?d=qj6IDK7rITs" border="0"&gt;&lt;/img&gt;&lt;/a&gt; &lt;a href="http://feeds.feedburner.com/~ff/Code2Learn?a=bfuj4xPIRe4:ft_IvjVa6is:gIN9vFwOqvQ"&gt;&lt;img src="http://feeds.feedburner.com/~ff/Code2Learn?i=bfuj4xPIRe4:ft_IvjVa6is:gIN9vFwOqvQ" border="0"&gt;&lt;/img&gt;&lt;/a&gt;
&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/Code2Learn/~4/bfuj4xPIRe4" height="1" width="1"/&gt;</content><feedburner:origLink>http://www.code2learn.com/2013/01/data-warehouse-design-approaches.html</feedburner:origLink></entry></feed>
