Concept of Indexing

Hello Experts
I have some doubts, please make my doubts clear.
I have a process chain on a cube, and there is also variant for Drop Index & create Index. Now I want to know that if we remove these index process variants, what will be the impact. As far as I know , I think the Index deletion & creation process must be for only once time where rite now it is processing daily on the whole cube data instead of delta or it is neccessary to delete & create index for whole data daily .
I searched for the same in Forums but not cleared.
Thanks in advance
Neha

Hi,
an index is a copy of a database table that is reduced to certain fields. This copy is always in sorted form. Sorting provides faster access to the data records of the table, for example, when using a binary search. A table has a primary index and a secondary index. The primary index consists of the key fields of the table and is automatically created in the database along with the table
For more info Go through the below link
http://help.sap.com/saphelp_nw04/helpdata/EN/cc/7c58b369022e46b629bdd93d705c8c/content.htm
Regards,
Marasa.

Similar Messages

Unable to understand the concept of Indexing

Hi,
I searched for indexing.I only understood that it is used for performance tuning.Means a indexed query will run faster ,as compared to other query that is not indexed .But i did'nt understand how it is working .It seems i have known nothing about Oracle Index. Any idea?

user12222356 wrote:
Suppose i have a small table, with two or three columns, and a few data inserted into it. Then suppose i create an index on any column, what effect will be seen here ? Correlating with books index , we are intelligent enough to understand what we are searching for .we see related topic and go to that page.Note related topic.Even we did'nt find actual topic we try to find related topics.
As for oracle tables,each columns have values, and storing info about each column will generate anther table(as i think).So two table now.So will both the tables now be queered?Such a small table can be compared with a book that has only half a page with text. You don't need any index for that book. It is faster simply to read the whole book (it is only half a page long!). In database terms this would be a full table scan (FTS).
You need an index if the book is 100 pages thick. Usually most books will have several indexes. One at the start that tells you about the differnt chapters. And a glossary at the end, where you can look up certain keywords and you also get to know on wich page those keywords had been mentions.
Lets say you have a book about animals in Africa.
So when you search for a certain keyword you have two options. You keyword would be rhino.
FTS (Full table scan)
Either read the whole book from page 1 turning to page 2 and so on until you find the keyword. And if you find it you have to read on, because maybe the keyword is mentioned again at the very last page. You need to read the whole book.
You will find some parts about white and some parts about black rhinos.
Or
Index access
You go to the glossary and search for the rhino keyword there.
Since the glossary is ordered you'll find it very fast. You will also know that you don't have to read the full glossary because it is sorted alphabetically. You then go to the page in the book (=ROWID of the table) where you find the keyword. If the glossary mentioned several pages, then you need go to all of the pages to get the full picture.
it will even more efficient if you search for a keyword like "tiger". Since a tiger does not live in Africa you would need to read the whole book just to find out that there is no "tiger"-content inside. If you use the glossary then you can fast scan the two glossary pages to see that nothing about "tiger" inside.
So an index is very efficient in telling you where to find something, but sometimes also in telling you what you will not find.
Edited by: Sven W. on Jul 13, 2010 11:12 AM

Indexing of external links in repositories

Hello,
I have a doubt regarding the concept of indexing of external links in FS repositories. When we set indexContentOfExternalLink and showWithoutDatasource
to true how does this actually work?The help documentation does not provide much information .
I have a FS rep where I have links to some external pages.
a)Will search pick up terms in the target of these links(i.e in these pages)
b)Also if the target is a html page which has further hyperlinks on that , will a search for those hyper links work ?
This feature is also not returning any results for links now ..
I dont want to use a web Rep for this .
Hope someone can clear this up.
Rgds

Had seen somewhere that if the target has javascript it is not picked up. But the target of the link is a html page which has only href tags , and None of these are also picked up by search.
Only the link is picked up by Trex jst like it displays normal files.Also would Trex pick up links to docs on other FS repositories ?
There are no crawler errors.
Inviting any comments on this , because I quite lonely on this thread.
Rgds

2222:Index name is not unique

Hi Chris
We find some TT6003 errors in foreground, and tterrors.log shows waiting for "Index VEASMS.B2CPOLICY_CW_2_CANCEL". I feel there may be the reseason for the error and try to drop and create this index( if this index is unsuable),but when drop the index there an another error 2222:Index name is not unique.
Could you please suggest how can we address this problem?
Thank you!
Regards
Li
18:03:59.95 Warn:    : 10254: 13516/0x2abdb864fdb0: ConnId=207 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=227 (java) PID 13516, now 1 secs 18:03:59.95 Warn:    : 10254: 13516/0x2abdc03be8c0: ConnId=75 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=227 (java) PID 13516, now 1 secs 18:03:59.96 Warn:    : 10254: 13516/0x2abdb0643170: ConnId=288 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=227 (java) PID 13516, now 1 secs 18:03:59.99 Warn:    : 10254: 13516/0x1d8cac50: ConnId=85 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=227 (java) PID 13516, now 1 secs 18:04:01.31 Warn:    : 10254: 13516/0x1ebf2c10: ConnId=227 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=207 (java) PID 13516, now 1 secs 18:04:01.42 Warn:    : 10254: 13516/0x1d8cac50: ConnId=85 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=207 (java) PID 13516, now 1 secs 18:04:01.42 Warn:    : 10254: 13516/0x2abdc03be8c0: ConnId=75 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=207 (java) PID 13516, now 1 secs 18:04:03.32 Warn:    : 10254: 13516/0x2abdb0643170: ConnId=288 (java) waiting for shared latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), now 1 secs 18:04:03.34 Warn:    : 10254: 13516/0x1ebf2c10: ConnId=227 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=288 (java) PID 13516, now 1 secs 18:04:03.42 Warn:    : 10254: 13516/0x1d8cac50: ConnId=85 (java) waiting for latch "Index VEASMS.B2CPOLICY_CW_2_CANCEL"(2374632), Holder=288 (java) PID 13516, now 1 secs Command> SELECT ixname,ixowner,ixid,tblid,ixtype FROM sys.INDEXES WHERE IXNAME='B2CPOLICY_CW_2_CANCEL' ; < B2CPOLICY_CW_2_CANCEL          , VEASMS                         , 2642328, 1798240, 1 > 1 row found. Command> SELECT tblname,tblowner,TBLID FROM SYS.TABLES where TBLID='1798240'; < B2CPOLICY_CW_2_CANCEL          , VEASMS                         , 1798240 > 1 row found. Command> drop Index VEASMS.B2CPOLICY_CW_2_CANCEL; 2222: Index name is not unique The command failed. Command>

Hi Li,
Sorry, I replied too quickly :-) Error 2222 can occur in two circumstances:
1.   If the index is the primary key index; as you have found you cannot drop a primary key index in TimesTen.
2.   If you have indexes with identical names on different tables; in this case you need to use the FROM owner.table qualifier on the DROP INDEX statement.
If you want to drop the primary key index then you will have to drop the entire table to do that. TimesTen does not have any concept of 'index status' and an index can never become unusable in TimesTen. The daemon log messages that you originally posted simply indicate that some process is waiting to acquire a latch on the index but is unable to because some other process is still holding it. Normally a latch should only be held for a very short time so if something waits much longer (in this case 1 second) we print these warning messages. So the real question here is why do you have such heavy latch contention on this index...
What exact TimesTen release is this? If it is an 11.2.2 release, you should consider using B-Trees for the range indexes rather than T-Trees as they offer much better concurrency. If you decide to do that, be sure to upgrade to 11.2.2.8.2 or later first.
Chris

Dreamweaver 8 'Brace balancing' bug

One of the worst features of php is the reliance on braces
for flow control.
Although I try to carefully indent my code to indicate where
I am, I frequently
get into trouble because I have overlooked some brace
somewhere. Dreamweaver's
'Brace balancing' feature is a great help, but unfortunately
in Dreamweaver 8 it
suffers from a serious bug, in that it will balance on braces
in comments, or
even mistakenly placed in HTML code. It usually seems to
ignore brackets, but
this morning it is being thrown into confusion by a left
bracket inside an
assignment statement: $test_str = 'if(';
Naturally this is in a complicated piece of code in which I
have made some
stupid mistake, and it makes the Brace balancing completely
useless.
Can anyone tell me if the latest version also suffers from
this bug?
Clancy

.oO(Clancy)
>Michael Fesser <[email protected]> wrote:
>
>>Have you considered to use SQL instead? You don't
even need a full DBMS,
>>SQLite should be enough in this case.
>
>This question is very relevant to my next question about
saving files.
>
> I have actually got MySQL installed on my system, but
after a quick look I
>realised it would probably take me a month to learn how
to use it, and I decided
>I didn't really need it yet.
It might take some time to get used to it and to grasp the
various
concepts like indexing and normalization for example, but
then SQL is a
really powerful tool with a rather surprisingly simple
syntax.
I was suggesting it because you're doing pretty much the
same, just your
own way. Currently you're building an 'if' statement
on-the-fly to cater
for a variable number and type of conditions to check
against. You can
do the very same thing with SQL and create complex queries
from small
different pieces. The condition part of such a query could
then look
like this:
status > 3 AND status < 6 OR class = 'student'
This is equal to
status >= 4 AND status <= 5 OR class = 'student'
which can also be written with a special operator to keep the
query a
bit more readable:
status BETWEEN 4 AND 5 OR class = 'student'
>Also, rightly or wrongly, I am under the
>impression that databases tend to be rather cumbersome
(an impression reinforced
>by Microsoft outlook professional, which I foolishly
installed, and which takes
>five seconds to load an address from my database of a few
hundred entries).
A real database is optimized to handle such things. If the
tables are
properly indexed, a search for all matching records is very
fast and
efficient, especially if you also want to sort the output or
want to do
something fancy with the data before you further process it
in your
script. Searching for an address in thousands or even
millions(!) of
entries can be done within the blink of an eye.
SQL can also be used to analyze the data or even extract and
create new
informations from the existing records. For example I have a
user
database, which stores firstname, lastname and birthname if
available
(besides a lot of other stuff). In my scripts I often want to
simply
print out the full name with the optional birthname in
parentheses:
Jane Bar (Foo)
John Doe
I could do it in the script, but it's much more efficent to
let the
database do this and have it return an additional field in
the result
set that already contains this full name in the required
format. So SQL
can easily return informations that are not directly stored
in the DB,
but generated on-the-fly. And this was just a very simple
example.
You should definitely give it a try if you find the time.
Micha

How does the CBO calculate the selectivity for range predicates on ROWID ?

Hi all,
I'm wondering how the CBO estimate the selectivity for range predicates based on ROWID columns.
For example, for the following query the CBO estimates there's going to be 35004 rows returned instead of 7:
SQL> SELECT count(*)
FROM intsfi i
WHERE
ROWID>='AAADxyAAWAAHDLIAAB' AND ROWID<='AAADxyAAWAAHDLIAAH'; 2    3    4
COUNT(*)
         7
Elapsed: 00:00:02.31
SQL> select * from table(dbms_xplan.display_cursor(null,null,'iostats last'));
PLAN_TABLE_OUTPUT
SQL_ID aqbdu2p2t6w0z, child number 1
SELECT count(*)   FROM intsfi i WHERE ROWID>='AAADxyAAWAAHDLIAAB' AND
ROWID<='AAADxyAAWAAHDLIAAH'
Plan hash value: 1610739540
| Id | Operation             | Name    | Starts | E-Rows | A-Rows |   A-Time   | Buffers |
|   0 | SELECT STATEMENT      |         |      1 |        |      1 |00:00:02.31 |   68351 |
|   1 | SORT AGGREGATE       |         |      1 |      1 |      1 |00:00:02.31 |   68351 |
|* 2 |   INDEX FAST FULL SCAN| INTSFI2 |      1 | 35004 |      7 |00:00:02.31 |   68351 |
Predicate Information (identified by operation id):
   2 - filter((ROWID>='AAADxyAAWAAHDLIAAB' AND ROWID<='AAADxyAAWAAHDLIAAH'))According to Jonathan Lewis' book, for a normal column the selectivity would have been:
(value_column1-value_column2)/(high_value-low_value)+1/num_distinct+1/num_distinct
But here with the ROWID column, how does the CBO make its computation ?
SINGLE TABLE ACCESS PATH
Single Table Cardinality Estimation for INTSFI[I]
Table: INTSFI Alias: I
    Card: Original: 14001681.000000 Rounded: 35004 Computed: 35004.20 Non Adjusted: 35004.20

Hi Jonathan,
Some Clarifications
=============
DELETE /*+ ROWID(I) */ FROM INTSFI I WHERE
(I.DAVAL<=TO_DATE('12032008','DDMMYYYY') AND (EXISTS(SELECT 1 FROM
INTSFI S WHERE S.COINT=I.COINT AND S.NUCPT=I.NUCPT AND S.CTSIT=I.CTSIT
AND NVL(S.RGCID,-1)=NVL(I.RGCID,-1) AND S.CODEV=I.CODEV AND
S.COMAR=I.COMAR AND S.DAVAL>I.DAVAL) AND I.COMAR IN (SELECT P.COMAR
FROM PURMAR P WHERE P.NUPUR=1))) AND ROWID>='AAADxyAAWAAHDLIAAB' AND
ROWID<='AAADxyAAWAAHDLIAAH'
Plan hash value: 1677274993
| Id | Operation                      | Name    | Starts | E-Rows | A-Rows |   A-Time   | Buffers | OMem | 1Mem | Used-Mem |
|   0 | DELETE STATEMENT               |         |      1 |        |      0 |00:00:05.94 |   53247 |    |          |          |
|   1 | DELETE                        | INTSFI |      1 |        |      0 |00:00:05.94 |   53247 |    |          |          |
|* 2 |   HASH JOIN SEMI               |         |      1 |   9226 |      7 |00:00:05.94 |   53180 |   783K|   783K| 471K (0)|
|   3 |    NESTED LOOPS                |         |      1 |   9226 |      7 |00:00:00.01 |      10 |    |          |          |
|* 4 |     TABLE ACCESS BY ROWID RANGE| INTSFI |      1 |   9226 |      7 |00:00:00.01 |       6 |    |          |          |
|* 5 |     INDEX UNIQUE SCAN          | PURMAR1 |      7 |      1 |      7 |00:00:00.01 |       4 |    |          |          |
|   6 |    INDEX FAST FULL SCAN        | INTSFI1 |      1 |     14M|   7543K|00:00:01.73 |   53170 |    |          |          |
Predicate Information (identified by operation id):
   2 - access("S"."COINT"="I"."COINT" AND "S"."NUCPT"="I"."NUCPT" AND "S"."CTSIT"="I"."CTSIT" AND
              NVL("S"."RGCID",(-1))=NVL("I"."RGCID",(-1)) AND "S"."CODEV"="I"."CODEV" AND "S"."COMAR"="I"."COMAR")
       filter("S"."DAVAL">"I"."DAVAL")
   4 - access(ROWID>='AAADxyAAWAAHDLIAAB' AND ROWID<='AAADxyAAWAAHDLIAAH')
       filter("I"."DAVAL"<=TO_DATE(' 2008-03-12 00:00:00', 'syyyy-mm-dd hh24:mi:ss'))
   5 - access("P"."NUPUR"=1 AND "I"."COMAR"="P"."COMAR")
When I force the NESTED LOOP SEMI JOIN the query runs faster:
DELETE /*+ ROWID(I) */ FROM INTSFI I WHERE
(I.DAVAL<=TO_DATE('12032008','DDMMYYYY') AND (EXISTS(SELECT /*+ NL_SJ
*/ 1 FROM INTSFI S WHERE S.COINT=I.COINT AND S.NUCPT=I.NUCPT AND
S.CTSIT=I.CTSIT AND NVL(S.RGCID,-1)=NVL(I.RGCID,-1) AND S.CODEV=I.CODEV
AND S.COMAR=I.COMAR AND S.DAVAL>I.DAVAL) AND I.COMAR IN (SELECT P.COMAR
FROM PURMAR P WHERE P.NUPUR=1))) AND ROWID>='AAADxyAAWAAHDLIAAB' AND
ROWID<='AAADxyAAWAAHDLIAAH'
Plan hash value: 2031485112
| Id | Operation                      | Name    | Starts | E-Rows | A-Rows |   A-Time   | Buffers |
|   0 | DELETE STATEMENT               |         |      1 |        |      0 |00:00:00.01 |      94 |
|   1 | DELETE                        | INTSFI |      1 |        |      0 |00:00:00.01 |      94 |
|   2 |   NESTED LOOPS SEMI            |         |      1 |   9226 |      7 |00:00:00.01 |      27 |
|   3 |    NESTED LOOPS                |         |      1 |   9226 |      7 |00:00:00.01 |       9 |
|* 4 |     TABLE ACCESS BY ROWID RANGE| INTSFI |      1 |   9226 |      7 |00:00:00.01 |       5 |
|* 5 |     INDEX UNIQUE SCAN          | PURMAR1 |      7 |      1 |      7 |00:00:00.01 |       4 |
|* 6 |    INDEX RANGE SCAN            | INTSFI1 |      7 |     14M|      7 |00:00:00.01 |      18 |
Predicate Information (identified by operation id):
   4 - access(ROWID>='AAADxyAAWAAHDLIAAB' AND ROWID<='AAADxyAAWAAHDLIAAH')
       filter("I"."DAVAL"<=TO_DATE(' 2008-03-12 00:00:00', 'syyyy-mm-dd hh24:mi:ss'))
   5 - access("P"."NUPUR"=1 AND "I"."COMAR"="P"."COMAR")
   6 - access("S"."COINT"="I"."COINT" AND "S"."NUCPT"="I"."NUCPT" AND
              "S"."CTSIT"="I"."CTSIT" AND "S"."CODEV"="I"."CODEV" AND "S"."COMAR"="I"."COMAR" AND
              "S"."DAVAL">"I"."DAVAL")
       filter(NVL("S"."RGCID",(-1))=NVL("I"."RGCID",(-1)))the above post is from Ahmed AANGOUR
Case 1 - . If you check Plan hash value: 16772749938
=====
TABLE ACCESS BY ROWID RANGE| INTSFI For every row access from INTSFI - it fetches a record from INDEX UNIQUE SCAN | PURMAR1
If we check A-rows = 9226
9226 * 7 = 64582 request across the table - perhaps with hint of rowid it fetches exact rows from PURMAR1
in this case i think going for hash join with ordered hints (jonathan as you suggest go for leading hint's instead of ordered) - from INTSFI - PURMAR1 - instead of going for IN clause would get the rows that satifies the ("P"."NUPUR"=1 AND "I"."COMAR"="P"."COMAR")
|* 2 |   HASH JOIN SEMI               |         |      1 |   9226 |      7 |00:00:05.94 |   53180 |   783K|   783K| 471K (0)|
|   3 |    NESTED LOOPS                |         |      1 |   9226 |      7 |00:00:00.01 |      10 |    |          |          |
|* 4 |     TABLE ACCESS BY ROWID RANGE| INTSFI |      1 |   9226 |      7 |00:00:00.01 |       6 |    |          |          |
|* 5 |     INDEX UNIQUE SCAN          | PURMAR1 |      7 |      1 |      7 |00:00:00.01 |       4 |    |          |          |My understanding with above plan would change to
HASH JOIN
TABLE ACCESS BY ROWID RANGE| INTSFI
INDEX UNIQUE SCAN | PURMAR1
HASH JOIN
INDEX FAST FULL SCAN | INTSFI1
Which migt be feasible.
2 .
DELETE /*+ ROWID(I) */ FROM INTSFI I WHERE
(I.DAVAL<=TO_DATE('12032008','DDMMYYYY') AND (EXISTS(SELECT /*+ NL_SJ
*/ 1 FROM INTSFI S WHERE S.COINT=I.COINT AND S.NUCPT=I.NUCPT AND
S.CTSIT=I.CTSIT AND NVL(S.RGCID,-1)=NVL(I.RGCID,-1) AND S.CODEV=I.CODEV
AND S.COMAR=I.COMAR AND S.DAVAL>I.DAVAL) AND I.COMAR IN (SELECT P.COMAR
FROM PURMAR P WHERE P.NUPUR=1))) AND ROWID>='AAADxyAAWAAHDLIAAB' AND
ROWID<='AAADxyAAWAAHDLIAAH'Ahmed AANGOUR, modified the query by /*+ NL_SJ */ hint, Instead of that in to remove the most of the rows as we join the tables using subquery, I still doubt it
to go push_predicate hints - still doubt it.
Jonathan your comments are most valuable in the above two cases..
Looking forward to calrify my understanding with concepts of indexes for above test cases
- Pavan Kumar N

Finding stuff in "private" folder?

Hi!
Is there some way to put a folder into "privacy" (Spotlight prefPane), so that usual Spotlight-searches won't search it, but have a way of finding stuff in that folder nevertheless (say, by using Finder's searchbar)?
I have several thousands of articles from my favorite computer mag in html-format on my HD and I don't want Spotlight to search through them all the time because that gets awfully slow.
On the other hand, I'd like to find some article in that folder from time to time.
(re-indexing and de-indexing that folder each time is NOT considered an option)

Leonard,
I agree with John. Complaints about Spotlight are widespread and persistent, and unless this is impressed firmly on Apple, they will probably do nothing since, as John says, they seem to think the concept is great.
The concept of indexing everything (or rather, NOT everything) and then searching in that index (and not finding) seems to be inherently stupid.
Since it is often repeated that no Apple employees with decision-making power ever visit these forums, the only way to get Apple's attention is to write them a firm email directly.
I did this a long time ago and, unfortunately cannot remember to what address I sent the email. Maybe someone else can tell you.

Multiple inputs from a user using the same variable !

Hi Folks,
I am trying out the following code block,which should ask the users to enter 3 different names using '&' operator & assign it to a variable v_ename every time the loop executes.
declare
type ename_table_type is table of
emp.ename%type
index by binary_integer
ename_table ename_table_type
begin
for i in 1..3 loop
ename_table( i ):= '&v_ename';
dbms_output.put_line(ename_table(i));
end loop;
end
The above code accepts a single input from the user & assigns the same input 3 times to "ename_table".thus the output shows the same name 3 times.
Is it possible that we can have the user input 3 different names & then print them using the concept of Index by binary_integer ?
Please help
Thanks
Om

Server side PL/SQL is NOT designed for this kind of user interaction.
the "&" character is intrepreted by the SQL*Plus application and before the PL/SQL block is submitted to the DB by the SQL*Plus application, it replaces each appearance of the &variable with the value entered. Once the block gets to the database, all it sees is a constant value - no more a variable name.
&variable_name is a SQL*Plus application thing, not the database.
Where will this type of logic will be eventually used? What client application will interact with the server side PL/SQL? You need to code this input logic in that client application.

How to decide threshold parameter in creating IOT

I am creating a index organized table that would contain more than 680 million rows which has just 4 columns.
Can i know how we decide the value of PCTTHRESHOLD parameter in creating IOT.
Moazzam

From concepts doc,
Index-Organized Tables with Row Overflow Area B-tree index entries are usually quite small since they only consist of the pair <key, ROWID>. In index-organized tables, however, the B-tree index entries can be very large since they consist of the pair <key, non_key_column_values>. If the index entry gets very large, then the leaf nodes may end up storing one row or row-piece, thereby destroying the dense clustering property of the B-tree index.
Oracle provides an OVERFLOW clause to handle this problem. You can specify an overflow tablespace as well as a threshold value. The threshold is specified as a percentage of the block size (PCTTHRESHOLD).
If the row size is greater than the specified threshold value, then the non-key column values for the row that exceeds the threshold are stored in the specified overflow tablespace. In such a case the index entry contains a <key, rowhead> pair, where the rowhead contains the beginning portion of the rest of the columns. It is like a regular row-piece, except it points to an overflow row-piece that contains the remaining column values.
And read this also from Admin guide,
http://download.oracle.com/docs/cd/B19306_01/server.102/b14231/tables.htm#i1007046
HTH
Aman....
Edited by: Aman.... on Oct 10, 2008 5:23 PM

Concept about Primary Key index

I have a partitioned table as follow:
CREATE TABLE TEST
(TEST_KEY NUMBER(10,0) NOT NULL
,FOREIGN_KEY NUMBER(10,0) NOT NULL
,PARAM_ID NUMBER(10,0)
,PARAM_VALUE VARCHAR2(256)
PARTITION BY HASH (operation_key) PARTITIONS 15
STORE IN (TEST_R1_TS, TEST_R2_TS, TEST_R3_TS, TEST_R4_TS, TEST_R5_TS)
CACHE
I also created a partitioned index for the TEST_KEY to be used as primary key index.
CREATE INDEX TEST_PK_IDX ON PARAMETER_1(TEST_KEY) LOCAL
STORE IN (TEST_i1_ts, TEST_i2_ts, TEST_i3_ts, TEST_i4_ts, TEST_i5_ts);
When I try to run alter table to add primary key, I got index not exist error?
SQL> alter table TEST add (constraint test_pk primary key (test_key) using index test_pk_idx);
alter table parameter_1 add (constraint pa1_pk primary key (parameter_key) using index pa_pk_idx)
ERROR at line 1:
ORA-01418: specified index does not exist
BUT, I could find my index in the USER_INDEXES table...
SQL> select index_name from user_indexes where index_name like '%TEST_PK%';
INDEX_NAME
TEST_PK_IDX
Why? Help is very appreciated.
Thank you in advanced.

check the names of the tables in the script you give ... they are different for the table and the index. When you add the constraint the table name and column name mysteriously change in the error message, so I think that you aren't showing us what actually happened.

Indexes concept

hi, i am new for this module
can anyone explain me .
what are indexes?.
regards,
ibrahim.

<removed_by_moderator>
Edited by: Julius Bussche on Aug 21, 2008 2:47 PM

Hi what is Node Indexer concept?

I created a xml file "com.day.cq.wcm.core.impl.servlets.contentfinder.NodeNameIndexerImpl" in my project under 'config.author' folder. i done this to enable Auto-Suggestions when i try to search for something. After adding this patch the Auto-Suggest is working pretty fine. Now i want to know how this change enables the auto-suggests, i dont know what is going behind the screen. Can anyone help me out in this...

I created a xml file "com.day.cq.wcm.core.impl.servlets.contentfinder.NodeNameIndexerImpl" in my project under 'config.author' folder. i done this to enable Auto-Suggestions when i try to search for something. After adding this patch the Auto-Suggest is working pretty fine. Now i want to know how this change enables the auto-suggests, i dont know what is going behind the screen. Can anyone help me out in this...

Different b/w index rebuild and index rebuild online

hi..guys could u plz tel me difference between index rebuild and index rebuild online

There is no difference in both the commands. Both will rebuild the index structure from the scratch.But in the first case with only Rebuild, as long as the index, its temporary segment is not prepared and merged together, index is not available for the other users for use. The Online clause makes the index available for others even while being rebuild.
Rebuilding index online has the same concept of creating them online to some extent,
http://download.oracle.com/docs/cd/B10501_01/server.920/a96521/indexes.htm#3062
HTH
Aman....

Difference Between Radio Button Group By Index and Key

what is main difference between RadioButtonGroupByIndex and RadioButtonGroupByKey ? And In which situvation we go for RBGBIndex and RBGBKey?

They do not differ from each other when displayed on the screen. However, the data binding model for the two UI elements is compeletely different. Index & Key Binding concepts are very elaborately explained in the following <a href="http://help.sap.com/saphelp_erp2005vp/helpdata/en/d7/f08841e3af1609e10000000a155106/frameset.htm">SAP Help</a>
~Suresh

Difference between a partition and index

In BW how does an index differ from a partition? Thanks

Hi,
Partitioning works on the Binary Search functionality.The data is divided into parts and stored logically.Depending on the variable input the data is fetched intelligently through Data Mining concept.
For eg: if you have 120 records of Customer say 10 records per month and you have done a partition on 0CALMONTH.
So now the data will be stored in 12 sets of 10 each for a year data.Now depending upon your input say you put June month along with other selection then it will hit only the set for June month.So instead of searching for all over 120 records it will search only in that 1 set of 10 records.This improves query performance.
However, the restriction is that partitioning can be done only on time variable.
Whereas, Indexing works like the Primary Index or Key field of an R/3 table.
More the Index better the search and query performance.But again the flip side is it will complicate the design to provide Index on many fields and data loading time would be increased.Any changes and you would require to drop the index then reload and then again rebuild the Index.The number of Indexes to be used to improve query performance is a compromise between designs.
Hope this helps.

Concept of Indexing

Similar Messages

Maybe you are looking for