 




<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Oracle Hash Partitioning.</title>
	<atom:link href="http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/feed/" rel="self" type="application/rss+xml" />
	<link>http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/</link>
	<description></description>
	<lastBuildDate>Fri, 24 May 2013 16:35:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	
	<item>
		<title>By: Oracle Hash Partitioning (Q/A) &#124; Seek The Sun Slowly</title>
		<link>http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/#comment-108155</link>
		<dc:creator>Oracle Hash Partitioning (Q/A) &#124; Seek The Sun Slowly</dc:creator>
		<pubDate>Fri, 08 Jun 2012 05:51:13 +0000</pubDate>
		<guid isPermaLink="false">#comment-108155</guid>
		<description><![CDATA[[...] Address: http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/        (0) Comments   Read [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Address: <a href="http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/" rel="nofollow">http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/</a>        (0) Comments   Read [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pelaez</title>
		<link>http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/#comment-44893</link>
		<dc:creator>pelaez</dc:creator>
		<pubDate>Fri, 14 Oct 2005 03:35:24 +0000</pubDate>
		<guid isPermaLink="false">#comment-44893</guid>
		<description><![CDATA[Considering all you have said, probably neither range-hash nor range-list is a good solution for your DW.

I would try to 
A) Identifiy another candidate key for hash- or list-partitioning.
B) If not possible, you might try to increase the number of partitions decreasing the range (e.g.: if partitioning by year, repartitioning by month).]]></description>
		<content:encoded><![CDATA[<p>Considering all you have said, probably neither range-hash nor range-list is a good solution for your DW.</p>
<p>I would try to<br />
A) Identifiy another candidate key for hash- or list-partitioning.<br />
B) If not possible, you might try to increase the number of partitions decreasing the range (e.g.: if partitioning by year, repartitioning by month).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: techanalyst10</title>
		<link>http://itknowledgeexchange.techtarget.com/itanswers/oracle-hash-partitioning/#comment-44894</link>
		<dc:creator>techanalyst10</dc:creator>
		<pubDate>Thu, 13 Oct 2005 05:00:08 +0000</pubDate>
		<guid isPermaLink="false">#comment-44894</guid>
		<description><![CDATA[Hi  pelaez,

     Thanks for the response. But list partitioning may not be useful in my case. The reason is, there are around 180 distinct (partiton) key values and the volume of data is high for some of the key values and low for the other key values. Hence, if I keep the list partitioning, the number of partitions would be more. Also, for some of the partitions, tablespaces may get wasted due to the volume of data (based on key value) would be less and if I keep the tablespace as minimum with autoextend ON, my performance would degrade increasing the tablespace size while data loading.

    I read that in HASH clustering there is an option to use your own HASH funtion. Do you know, any similar workaround in HASH partitioning.

Thanks and Regards,
Rohit.
]]></description>
		<content:encoded><![CDATA[<p>Hi  pelaez,</p>
<p>     Thanks for the response. But list partitioning may not be useful in my case. The reason is, there are around 180 distinct (partiton) key values and the volume of data is high for some of the key values and low for the other key values. Hence, if I keep the list partitioning, the number of partitions would be more. Also, for some of the partitions, tablespaces may get wasted due to the volume of data (based on key value) would be less and if I keep the tablespace as minimum with autoextend ON, my performance would degrade increasing the tablespace size while data loading.</p>
<p>    I read that in HASH clustering there is an option to use your own HASH funtion. Do you know, any similar workaround in HASH partitioning.</p>
<p>Thanks and Regards,<br />
Rohit.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using memcached
Database Caching 6/9 queries in 0.019 seconds using memcached
Object Caching 295/298 objects using memcached

Served from: itknowledgeexchange.techtarget.com @ 2013-05-24 16:37:37 -->