full table scans with hash partitioning
- From: ryan.gaffuri@xxxxxxxxxxx
- To: oracle-l@xxxxxxxxxxxxx
- Date: Mon, 16 Aug 2004 19:54:23 +0000
I have never used hash partitions. are there performance problems with hash
partitions and full table scans? It actually took longer do do a 'count(*)' on
a table with 16 hash partitions than it did to create a global index on the
same table.
noone else is online?
also what does the following mean in my explain plan:
1 0 PARTITION HASH (ALL)
next line is table access (full).
----------------------------------------------------------------
Please see the official ORACLE-L FAQ: http://www.orafaq.com
----------------------------------------------------------------
To unsubscribe send email to: oracle-l-request@xxxxxxxxxxxxx
put 'unsubscribe' in the subject line.
--
Archives are at //www.freelists.org/archives/oracle-l/
FAQ is at //www.freelists.org/help/fom-serve/cache/1.html
-----------------------------------------------------------------
Other related posts:
- » full table scans with hash partitioning
