Similar Questions

• Index Bitmap and MV in Standard edition

  Salvation of DBA
  
  I have an enterprise edition 10.2.0.3 database which can be transformed into 11.2.0.3 EE. There many Materialized view with activated query rewrite. If I downgrade to the standard edition, what will be the impact? I know the rewrite of the query is a feature of EA and not SE and SEO. It is also the index Bitmap in the database which I think must be re-created as the normal b-tree index.
  
  I know that bitmap is not a feautre of the SE. One advantage that I see that updates will be faster if there is a normal index as DML are slow, if there is a Bitmap index.
  
  What will be the impact on the performance of the database if there is standard edition which does not rewrite of the query and the characteristics of Bitmap?
  
  Thank you
  
  DBA is the hero behind the screen, while developers are heroes on the screen.

  user13368428 wrote:
  I went through this table before posting my first post. I don't know there are a lot of tables in my EE database that contains bitmap indexes. In the past, I turned on the control over some of them, and they have been used. Also, I have seen queries that are rewritten to use the MV table instead of the base of fact tables.

  Yes. Really, I need to test in decommissioning and annexing the request to it. But I wanted to know if anyone has experienced this. What were their experiences do not use Bitmap indexes, function index and Query rewrite.

  Your response was very useful.

  Thank you.

  The Oracle Server Standard edition supports function based indexes (I think since version 8.1.5). Bitmap indexes are not supported and treat B * index of tree as the index of the bitmap to bitmap join operations are also not supported. You can partially determine the impact of not having the second option by editing a hidden at the session level setting (obvious caveat on masked editing settings apply here):

  ALTER SESSION SET "_B_TREE_BITMAP_PLANS" = FALSE;
  

  I'm fairly certain that the Standard Edition supports materialized views - automatic query simply not rewrite for possibly enjoy this feature based on cost.

  There may be a few other surprises, here is part 1 of 4 that explores the potentially unexpected differences between Standard Edition and Enterprise Edition (the differences are version and OPTIMIZER_FEATURES_ENABLED load):
  http://hoopercharles.WordPress.com/2010/11/21/different-performance-from-Standard-Edition-and-Enterprise-Edition-1/

  Good luck to you with the project.

  Charles Hooper
  http://hoopercharles.WordPress.com/
  IT Manager/Oracle DBA
  K & M-making Machine, Inc.

• Index BITMAP and NOT NULL

  Hi all
  Is it possible to use the Index BITMAP for a NOT NULL condition?
  
  
  >
  
  CREATE a BITMAP of INDEX x_ix FOR tab (x);
  
  SELECT *.
  TAB
  WHERE x IS NOT NULL
  
  >
  
  Thank you!

  user3646231 wrote:
  You say that :) to hope

  Here it is:

  Your test is a good effort - but it needs a little more.

  Your question is "is it possible...". «, not "If Oracle always...» »

  Your demonstration showed an example where the choice of plan Oracle has surprised you (and me). Now, you need run the query with index indicator (because if the indexed access path is legal, must be taken an indexed correctly suggested path).

  I just ran a similar test (1 line of 100,000), with the following results:

  SQL> select * from table(dbms_xplan.display_cursor);
  
  PLAN_TABLE_OUTPUT
  ------------------------------------------------------------------------------
  SQL_ID  52q6gxkscvg9v, child number 0
  -------------------------------------
   select /*+ index(t1(n1)) */ * from t1 where n1 is not null
  
  Plan hash value: 2828957992
  
  ----------------------------------------------------------------------
  | Id  | Operation                    | Name  | Rows  | Bytes | Cost  |
  ----------------------------------------------------------------------
  |   0 | SELECT STATEMENT             |       |       |       |  1859 |
  |   1 |  TABLE ACCESS BY INDEX ROWID | T1    |     1 |   118 |  1859 |
  |   2 |   BITMAP CONVERSION TO ROWIDS|       |       |       |       |
  |*  3 |    BITMAP INDEX FULL SCAN    | T1_N1 |       |       |       |
  ----------------------------------------------------------------------
  
  Predicate Information (identified by operation id):
  ---------------------------------------------------
  
     3 - filter("N1" IS NOT NULL)
  

  You will notice that the cost of the query is unreasonable - and without the suspicion my test showed Oracle taking the full analysis at a much lower cost.
  If your test has actually demonstrated a bug in the costing, explaining why Oracle does not automatically take a path that seems reasonable.

  The above output comes from 11.2.0.3, but I had the same thing with 11.1.0.7

  Concerning
  Jonathan Lewis
  http://jonathanlewis.WordPress.com
  Author: core Oracle

• index bitmap and separate key

  Hi guys,.
  
  If the separate keys is very low (for example 20) and my index finger has more than 12,000 lines, should I consider using a bitmap index instead?
  
  Thank you

  OracleGuy777 wrote:
  But that say our table was very fragmented, would not--what it means that the bitmap index entries would be to store much more information than necessary? Say so we had a table with only 1000 entries and the first rowid is 1, and the last was 1000000 and then eventually we have 999000 additional entries for each bitmap index entry!

  Bitmap indexes are well compressed. So, this usually isn't a problem. An example...

  SQL> create table t as select rownum id from dual connect by level <= 1000000;
  
  SQL> execute dbms_stats.gather_table_stats(user,'t')
  
  SQL> select blocks from user_tables where table_name = 'T';
  
      BLOCKS
  ----------
        1557
  
  SQL> delete t where id between 500 and 999500;
  
  999001 rows deleted.
  
  SQL> commit;
  
  SQL> create bitmap index i on t (id);
  
  SQL> select distinct_keys, blevel, leaf_blocks from user_indexes where index_name = 'I';
  
  DISTINCT_KEYS     BLEVEL LEAF_BLOCKS
  ------------- ---------- -----------
            999          1           4
  

  Notice how the index has only 4 blocks of leaves...

  So you're saying something like

  FEMALE 1 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 0 0 0 1

  could be stored as

  FEMALE 1 0 0 0 1 1 0 1 0 1 for rowid a to j
  FEMALE 0 1 1 1 1 0 0 1 0 0 0 1 for rowid k - w

  Yes.

  HTH
  Chris Antognini

  Troubleshooting Oracle, Apress 2008 performance
  http://top.Antognini.ch

• Question index bitmap

  Guys,
  
  I have a general question about the bitmap index. I develop a data model for a new system.
  
  I have a table that will get close to 20,000 files per year. There are 4 broad categories, and each row in this table is covered by one of these 4 categories. I'll use the category several times field to search all the records in the system.
  
  Don't you think that a Bitmap index on the category column will be a great help? A comment I received from my internal staff member is that: Bitmap can be an overkill for this kind of small table
  
  All comments or suggestions would be a great help...
  
  -Raj

  Hello

  I see no points you must have an index on that column bitmap if you encounter one single index bitmap for this table. Other columns are also a good candidate for the bitmap index?

  For such a small record 20,000 per year (assuming that the size of each line is normal) and with four distinct values, I doubt that you will get no gain performance between full table scan and bitmap.

  Even with 20,000 lines and four distinct values and are filled at the same time that you create a tree index b top as the grouping factor is very low. Still, he would not give a lot of benefits.

  And if most of the research is run on this table, I see it as a good candidate to keep bool in the buffer cache.

  Concerning
  Anurag

• Index bitmap for FKs on fact tables

  Hi all
  
  We have a database of DWH (Star Dimesions and the tables schema) running with OBIEE 11 g (11.1.1.1.6) on the oracle 11 g (11.2.0.1) database. I read in one of the best practical paper, creating index Bitmap on the Fks of all fact tables will help performance.
  
  I created indexes for the less than 2500 separate keys, but we have 2 dimesions tables where there are great number of records (size 14 g and 10 g). Can I go ahead and create indexes of bitmap for 2 tables establishments (mainly account_key and customer_keys are the columns)?
  
  Worried about creating index bitmap for large tables where they could affect the ETL process.
  
  Ref: http://www.oracle.com/technetwork/database/bi-datawarehousing/twp-dw-best-practies-11g11-2008-09-132076.pdf (page 20)
  
  Help, please.
  
  Thank you and best regards,
  Anand.

  >
  I created indexes for the less than 2500 separate keys, but we have 2 dimesions tables where there are great number of records (size 14 g and 10 g). Can I go ahead and create indexes of bitmap for 2 tables as well
  . . .
  Worried about creating index bitmap for large tables where they could affect the ETL process.
  >
  You put the cart before the horse!

  Don't create index unless you have a reason documented for them.

  Why did you choose the index bitmap for cardinality less than 2500? Perhaps based on a long-standing myth, but discredited on the cardinality?

  See also Richard Foote two articles where he explodes the myths about bitmap indexes and considerations of cardinality
  http://richardfoote.WordPress.com/2010/02/18/myth-bitmap-indexes-with-high-distinct-columns-blow-out/
  http://richardfoote.WordPress.com/2010/03/03/1196/

  Re your concern about the tables with the 'large' number of records and affecting ETL.

  You are right to be concerned about these issues, but you need to document your particular situation taking into account the architecture.

  The fact tables and dimension tables can have a large number of records. If using the bitmap index is indicated, then the most records are most effective, they will be.

  ETL is affected because the DML (INSERT, UPDATE, DELETE) operations on the tables with bitmap indexes can have serious performance because of the involved serialization issues. Updated single bitmap of a column value (e.g., am ' to 'F' gender) requires that the two index bitmap blocks must be blocked until the update is complete. An index of stored bitmap ranges ROWID (rowid min - max rowid) that can span many, many files. The "range" of ROWID is locked in order to change a value.

  To change: 'follow her' rowid beach so that a row is locked and ID should be removed from the range by turning off the bit. Change to the 'F', the rowid id range 'F' must be found, locked and the bit set that corresponds to this rowid. No another row with ROWID in the range cannot be changed, because it is a transaction in the series. If the range includes 1000 lines and they all need changed it takes 1000 series.

  For anything other that a very small number of documents the bitmap index would be deleted and rebuilt after the ETL operations. That is why the data warehouse designs try to minimize update and implement insertions and deletions using partitioning when possible; Adding a new day by adding a new partition.

  There is also a big difference between a bitmap index and a bitmap join index. The white paper you quoted does not really indicate what type are used or recommended.

  Learn more about the difference - see Using Bitmap indexes in data warehouses in the doc of Data Warehousing
  http://docs.Oracle.com/CD/B28359_01/server.111/b28313/indexes.htm

• Index BITMAP Advisor Advisor access SQL on the Partition key

  I ran SQL and SQL Access Advisor as below he recommends index bitmap on p_key... Given that the cust table is partitioned on the p_key, does make sense to create indexes on p_key?
  
  Not sure if SQL Access Advisor look just in ' where clause conditions/predicates "and the cardinality of such columns and not look at whether the table is partitioned or not. T it?
  
  Is it wise to create BITMAP indexes on the partition key? If so what scenario would be beneficial?
  

  SELECT * FROM cust
  WHERE 
      'T' = 'T' AND 
      part_key IN 
      (   2, 3, 4 )) AND 
      (   p_key, act_key) IN ( select p_key, act_key from account where act_type = 'PENDING' and p_key in (2,3,4) )

  user4529833 wrote:
  Jonathan, I have exactly one value per partition for the partition key.   However, most SQLs use 'IN' as predicate of partitioning pruning so overall stats are always used and they are always a bit bland compared to the partition level stats. Then this led SQL Access advisor recommendations?

  Yes, the Counselor also recommended to create Bitmap indexes on act_type... Given this does make sense to have the Bitmap index on the partition key?

  I'll post the execution plan as soon as I have access to the system...

  The fact that statistics are "a little stale" was not much of a difference.

  The fact that Oracle has probably used statistics at the level of the tables is likely to be the underlying issue. Is the partitioned table list or you have rigged it with partitioning range: If you faked list partitioning using partitioning of the range which MAY have contributed to the issue (but it's an assumption that I have not tested).

  Unofficially, the optimizer has said something like:

  + "There are 25 possible values for pkey, there are 4 possible values for act_type, there seems to be 100 different combinations - so your query will pick up X lines. 80% of these lines will be packed in Y blocks and 20% of them will be scattered through the Z blocks if we have two bitmap index, and we will have to do sequential reading of the db file SSS. If we do an analysis through the affected partitions, we do MMM db file scattered reads. What are those cheaper. » +

  You know how false it's - if you know that you need not the pkey index. You also know what is the efficiency of the column act_type is in the identification of data, so you can decide whether or not an index on act_key may be useful.

  Concerning
  Jonathan Lewis
  http://jonathanlewis.WordPress.com
  http://www.jlcomp.demon.co.UK

  "The premature temptation to theories of shape on the lack of data is the scourge of our profession."
  Sherlock Holmes (Sir Arthur Conan Doyle) in "the Valley of fear."

• problem with coordinates and child index

  

  Hi guys,.

  In my application I view contacts as card according to the image, so, for example, if the user clicks "Contact 2" he should come to "communicate with 3" position and "Touch 3" should return to "Contact 2" s.

  I've been swapping coordinated and child index of these sprites, but it didn't work like I wanted...

  can someone suggest a better logic?

  Thanks in advance

  Hi guys,.

  I solved it myself, silly me!

  All I had to do was:

  1. move the child 'index' to numChildren - 1

  2. move the numChildren child - 2 to "index".

  Phew!!!!!!!!!!!!!!!!

• How to add expand all trees and collapse all buttons tree in Oracle JDeveloper?

  Hello

  I want to add two buttons on my page. I got a tree and add two buttons to expand and collapse all tree nodes. When the user clicks on expand all the button he will develop any node of the tree, and when the user clicks on reducing all the button, it will collapse all the tree how...?

  I have JDeveloper 11 g R2 version...

  Put your tree in an af:panelCollection that has this feature out of the box.

  Timo

• spatial index and normal index

  Hi space specialists,.

  I have a question for spatial index performance and how Oracle manages queries that have a space and regular condition combined. We are on the Oracle 10 g Enterprise Edition Release 10.2.0.4.0 database

  Take a query like this one (not a real query but based on the type of query that is generated by ArcGIS):

  Select objectid

  attribute

  geometry

  table

  where mdsys.sdo_filter (geometry, mdsys.sdo_geometry (: gtype1,: srid1, null,: elem_info1,: ordinates1), 'querytype = window') = 'TRUE '.

  and attribute = value

  In our scenario, we have a lot of rows in the table (2 million), but we have only a few lines (2000) where attribute = value.

  It seems that there is a scenario where the performance is really bad. It takes 5 seconds for the query to return the results and you're just too slow for our needs. There is a spatial index on a geometry and a normal index on the field for the attribute. The plan of the explain command shows that both the spatial index and the index of the attribute are used.

  Of course, we can break to the top of the table in separate tables by object type. This would make the index space datamodel much more efficient, but at the expense of our current simple, abstract.

  Do you have suggestions on how we can improve performance without too much impact on our datamodel? Oracle for example has an option where you can create a spatial index on a subset of the data in a table?

  Thank you!

  Rob

  Do not know whether or not the following works for your case:

  use the column range-key attribute to create a partitioned table Beach and then create a local spatial index.

• improved Photoshop CC script for tree and photo frame templates

  flame, tree and photo frame models are missing from my drop-down list in the fill window. They are in the

  Folder design, as is the filling of the symmetry, all with the javascript extensions, but symmetry filling is the only watch in my menu drop-down. Can someone help me solve this problem?

  Hi Kmjc,

  If you use the version of Photoshop CC 2014, you must click the filter menu and choose rendering and you will be able to see the flame, frame photo and the tree options.

  Please post on the Adobe Forums.

• With photoshop 2014 cc 2.0 in edit, fill, pattern, script, I get only 6 options. Trees and executives have disappeared.

  With photoshop 2014 cc 2.0 in edit, fill, pattern, script, I get only 6 options. Trees and executives have disappeared and I only get the filling of symmetry, filling of brick, cross weave, place along the path, random fill and spiral. This is normal or is my corrupted photoshop version?

  options are passed to the FILTER - RENDERED

• removed and replaced index page old index is always on the web

  removed and replaced index page old index is always on the web. I just after a new website, but BusinessCatalyst blinking an error message to fast as follows by saying I can't. I thought Muse for coders and technicians.

  Steven,

  The page could be cached in other places, such as cache network or your internet provider.  These are rare cases, but they happen, and you have no control over it.  Best to have friends / colleagues check from another place, this page has been replaced by fact.  If you have several locations showing the same old page, which means the page was either not removed properly, or home page of the site is perhaps used a different directory than where you are currently working.  It is common for people to create several directories test when booting with web creation programs and forget the one that serves content for the online site.

• overlap of 2 controls and z index control at run time

  I would like to have a box and place a drop-down list in the same place that one is on the other and z index and development of control at run time. Dreamweave has this behavior to create?

  Your information and help is much appreciated,

  Kind regards

  Iccsi,

  Hello Iccsi,

  you think of something like this:

  
  
  
  

  
  

  first
   

  
      D: 2
   
  
    second: text text text text text...
  Text text
  Text text text
  Text text text text
  Text text text text text text text
  Text text text text text text text
  Text text
  Text text text text text text
  Text text text text text text

  
  

  Hans-Günter

• Problems using collection ArrayCollection as a DataProvider for trees and the menu bar, possibly bug?

  Hi guys,.

  I'm having some troble using a collection ArrayCollection as a DataProvider for a tree and a menu bar...

  I read some Adobe documents on this subject, and I read that two components read the dataProvider in the same way.

  but my current works of DataProvider well on the tree, but not on the MenuBar component...

  My dataProvider is an ArrayCollection collection of a custom class (which extends from ArrayCollection collection), and among its assets is a children's collection: ArrayCollection, so the hierarchy can be read correctly.

  When I use the component of the tree it works, but the menu bar do not display the branches...

  Can someone help me?

  Here's the function that create my dataprovider:

  
  private function fnFillDP (): void {}
  for (var i: int = 0; admResult.length > i; i ++) {}
  If (.nivel JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]) == 0) {}
  var novoMenu:CL_ArrayMenu = new CL_ArrayMenu();
  novoMenu.idMenu = .idMenu JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenu.titulo = .titulo JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenu.parent = .parent JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenu.nivel = .nivel JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenu.ordem = .ordem JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  
  dataProvider.addItem (novoMenu);
  } ElseIf (.nivel JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]) == 1) {}
  for (var j: int = 0; dataProvider.length > j; j ++) {}
  {If (CL_ArrayMenu(dataProvider[j]).idMenu == {JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]) .parent})}
  var novoMenuChildren:CL_ArrayMenu = new CL_ArrayMenu();
  novoMenuChildren.idMenu = .idMenu JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenuChildren.titulo = .titulo JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenuChildren.parent = .parent JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenuChildren.nivel = .nivel JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  novoMenuChildren.ordem = .ordem JV_MenuAdm (JV_AuxMenuAdm(admResult[i]).menuAdm [0]);
  If (dp.length > 0) {}
  If (CL_ArrayMenu (dp.getItemAt (0)) .parent == novoMenuChildren.parent) {}
  dp.addItem (novoMenuChildren);
  } else {}
  DP = new ArrayCollection();
  dp.addItem (novoMenuChildren);
  }
  } else {}
  dp.addItem (novoMenuChildren);
  }
  
  CL_ArrayMenu (DataProvider [j]). Children = dp;
  break;
  }
  }
  }
  }
  tree.dataProvider = dataProvider;
  menu.dataProvider = dataProvider;
  }

  Sorry for the bad English...

  Hello

  You can try using xml as the dataprovider of the Menu bar instead of going for the Arraycollection collection.

  Thank you

  Roman