Skip to main content

Home/ eDBA Services - Oracle & MySQL/ Group items tagged partitioning

Rss Feed Group items tagged

Dariusz Owczarek

Hash partitioning - 0 views

  • - instead of having a 100 gig tablespace to backup, you have 100, 1 gig tablespaces. (each tablespace spends less time in backup mode, reduces the amount of potential extra redo, reduces the amount of manual recovery you need to do if the instance failes during backup). same with restores.
  • every single admin option you do to a partition applies to a hash partition
  • Say you do a join on the hash partition key -- we can do parallel partition wise elimination on the join
  • ...6 more annotations...
  • Hash partitioning -- all of admin features of range partitions and many of the partition elimination/query features as well.
  • With a harsh partition, we are attempting to achieve an EVEN distribution of data across all of the partitions while at the same time supporting partition elimination and other features.
  • you want an ALMOST unique or unique value to hash on
  • with hashing -- all rows with the same key by definition hash to the same partition -- that is the very essence of hash partitioning
  • you would just drop/truncate the oldest partition and if you do this with the option to maintain the indexes, it'll not impose any sort of rebuild
  • with hash partitions, you want to hash on something that is almost unique (or at least has lots of values) and into powers of 2 you want 2, 4, 8, 16, 32, 64, 128, .... partitions. 50 is not going to work (you'll always get a bell shape with the partitions at the front and end having the least and the ones in the middle having the most)
  •  
    Hash partitioning
Dariusz Owczarek

SQL SELECT Syntax - 0 views

  •  
    SQL SELECT statement or subquery is used to retrieve data from one or more tables, object tables, views, object views, or materialized views.
Dariusz Owczarek

Oracle ASSM Performance - 0 views

  • Cons of ASSM: §         Slow for full-table scans: Several studies have shown that large-table full-table scans (FTS) will run longer with ASSM than standard bitmaps. ASSM FTS tablespaces are consistently slower than freelist FTS operations. This implies that ASSM may not be appropriate for decision support systems and warehouse applications unless partitioning is used with Oracle Parallel Query. §        Slower for high-volume concurrent inserts: Numerous experts have conducted studies that show that tables with high volume bulk loads perform faster with traditional multiple freelists. §         ASSM will influence index clustering: For row ordered tables, ASSM can adversely affect the clustering_factor for indexes. Bitmap freelists are less likely to place adjacent tows on physically adjacent data blocks, and this can lower the clustering_factor and the cost-based optimizer's propensity to favor an index range scan.
  • Pros of ASSM: §          Varying row sizes: ASSM is better than a static pctused. The bitmaps make ASSM tablespaces better at handling rows with wide variations in row length. §         Reducing buffer busy waits: ASSM will remove buffer busy waits better than using multiple freelists. When a table has multiple freelists, all purges must be parallelized to reload the freelists evenly, and ASSM has no such limitation. §         Great for Real Application Clusters: The bitmap freelists remove the need to define multiple freelists groups for RAC and provide overall improved freelist management over traditional freelists.
  • Cons of ASSM: §         Slow for full-table scans: Several studies have shown that large-table full-table scans (FTS) will run longer with ASSM than standard bitmaps. ASSM FTS tablespaces are consistently slower than freelist FTS operations. This implies that ASSM may not be appropriate for decision support systems and warehouse applications unless partitioning is used with Oracle Parallel Query. §          Slower for high-volume concurrent inserts: Numerous experts have conducted studies that show that tables with high volume bulk loads perform faster with traditional multiple freelists. §          ASSM will influence index clustering: For row ordered tables, ASSM can adversely affect the clustering_factor for indexes. Bitmap freelists are less likely to place adjacent tows on physically adjacent data blocks, and this can lower the clustering_factor and the cost-based optimizer's propensity to favor an index range scan.
  •  
    Oracle ASSM Performance pros and cons
Dariusz Owczarek

Oracle announces availability of Oracle Database 11g Release 2 - 0 views

  • In this release, Edition-based Redefinition is introduced to allow customer database applications to be upgraded online; this removes the need for separate upgrade environments.
  • This release also delivers enhanced query performance with the ability to transparently execute a query against data stored in memory across all the servers in a grid.
  • In this release, Oracle Automatic Storage Management is extended to support a general-purpose cluster file system to help customers reduce their storage management costs.
  • ...1 more annotation...
  • The combination of Oracle Database 11g Release 2 Advanced Compression and Partitioning support the reduction of storage costs by compressing data as much as 2-4x and simplifying use of lower cost storage tiers.
1 - 4 of 4
Showing 20 items per page