Question on Indexing

I have created an index, however upon reviewing I have noticed some entries are showing up under other entries. For example, I have an entry called New Account Screening.......shows fine with page numbers except there are two additional page numbers that should are associated with an index tag of Non-U.S. Citizen. For the life of me I can't get Non US Citizen to show up on it's own line with the associated page numbers. I have located with ALT+CTRL and deleted the tag...started over...even tried Non US Cititzen without the hyphen. I have had this on a couple of entries. The markers look fine in the doc, but then they show up without their marker category and just the pages applied to a totally separate topic. Any advice would be so appreciated at this point!!!!

Sure thing -
I am using Frame 8.0p236. On thing I did htis morning after reading another post was to delete all my spacing. Didn't realize that might cause an issue since most populated fine in the index. Deleted all spaces and updated the book, but still having the same couple of problems. One as I said before....topics marked not showing in there own label, but the page shows under a different topic.
Here is an example of the marker - Sales Express Account Opening:Consumer:Non US Citizen and it fall in the index as New Account Screening, 3-33, 3-117 (but 3-117 is Non US Citizen and 3-33 is New Account Screening) No Topic label is created in the index for Non US Citizen. The hyperlink will take you to the Non US Citzen page it is for some reason associating itself with New Account Screening.
The other issue is some display on their own line with no topic. For example the marker is: Sales Express Account Opening:Customer Search and it displays inthe index as , 3.9 (no topic in front)
Thanks for any advice!

Similar Messages

Questions about Indexing and Using an Indexing POA

Although I have only about 50 users, at least 15 of them have in excess of 100,000 messages in their accounts and the POA (version 7.0.2) is regularly slowing to a crawl. (I just know that plans for revolution are fomenting!) I have embarked on a campaign to reduce these accounts by archiving everything off to get mail accounts down to 3000 or fewer pieces. I have achieved user buy-in, but have worked on only a few users so far.
In another closely related thread, it was suggested to me that the PO speed issues relate to broken indexes. And I suspect that given so many messages, the indexes were never getting fully rebuilt with the default QF POA settings. I am trying to fix that situation in addition to reducing mail account sizes. So, I have set up a second POA on another server and dedicated it to the indexing task. The /qfinterval is set for 1 hour, other /qf switches at default. The POA-QF does no mail delivery, but it does do nightly user upkeep.
The POA-QF seems to be steadily working away and making progress at reducing the number of unindexed messages. However, I have questions about what I am seeing and what more I can do:
1. Is the progress I am seeing real progress? For example I have a user with over 100,000 messages to be indexed and every time I check the logs, the count drops by about 500 messages per hourly QF cycle. I assume that if I just let it keep running, it will eventually get caught up and fixed. Not only with this user, but with all the others as well. Will my patience (and theirs) be rewarded? Are there any gotchas I need to prepare for?
2. One user has recently had virtually all of her messages successfully moved to archive. I can see them in the Archive, and do not see them in the online account. However, now over a week later, QF still shows >130,000 items still left to index for that user. The POA-QF is making slow, steady progress reducing that number, but why is this user's QF count still so high? Does it just need more time, or is there something amiss for this user?
3. I may want to rebuild indexes for single users from scratch. I have seen the TID 3105742 which tells how to do this: Essentially you turn off mail delivery functions, and make some other switch changes to dedicate the POA to indexing for just a single user, and then you let the POA rebuild the indexes. The implication of that scenario is that the POA is now enjoying exclusive access to the user's databases.
If I want to use my secondary POA-QF to rebuild a user's index from scratch, does the main POA have to be offline and the user out of GWise? That is, Does the QF process require exclusive access in order to rebuild indexes from scratch?
Thanks for any thoughts or suggestions.
Peter Smick

pgsmick wrote:
> 1. Is the progress I am seeing real progress? For example I have a user with
> over 100,000 messages to be indexed and every time I check the logs, the count
> drops by about 500 messages per hourly QF cycle. I assume that if I just let
> it keep running, it will eventually get caught up and fixed. Not only with
> this user, but with all the others as well. Will my patience (and theirs) be
> rewarded? Are there any gotchas I need to prepare for?
Set this switch for this indexing POA - /qflevel=999 - this will index
everything in one run. It will take a long time, but with no qflevel switch you
are indeed only indexing 500 messages at a time, and if the user has that much
mail, it might never really catch up.
>
> 2. One user has recently had virtually all of her messages successfully moved
> to archive. I can see them in the Archive, and do not see them in the online
> account. However, now over a week later, QF still shows >130,000 items still
> left to index for that user. The POA-QF is making slow, steady progress
> reducing that number, but why is this user's QF count still so high? Does it
> just need more time, or is there something amiss for this user?
>
This is odd, because really the index count should drop to nothing, but with the
above switch this might get resolved as well.
> 3. I may want to rebuild indexes for single users from scratch. I have seen
> the TID 3105742 which tells how to do this: Essentially you turn off mail
> delivery functions, and make some other switch changes to dedicate the POA to
> indexing for just a single user, and then you let the POA rebuild the indexes.
> The implication of that scenario is that the POA is now enjoying exclusive
> access to the user's databases.
Not really - the POA is not enjoying exclusive access to the user's database,
the indexer is just avoiding an attempt to index anything else.
> If I want to use my secondary POA-QF to rebuild a user's index from scratch,
> does the main POA have to be offline and the user out of GWise? That is, Does
> the QF process require exclusive access in order to rebuild indexes from
> scratch?
No - QF never requires exclusive access. That said, you may find that an
extremely vigorous QF can cause slowdowns for the user.
Danita
Novell Knowledge Partner
Moving GroupWise to Linux?
http://www.caledonia.net/gwmove.html

Question about Index in data selection

Hi experts,
I am reading the documents about index today and find there are some questions confused me. Plz help, thx!
1 What is the technical structure of index?
For example, I have a table ztable with 5 fields, F1(key), F2(key). F3. F4.F5. If I create a index on F3,F4, the system will create a copy of this table. Is the structure of this copy as follow?
F3, F4, pointer(for the lineno of the recorder)
So this copy will have fewer lines than the ZTABLE and is sorted. If the DB optimizer choose this index in selection, it will be fast for the 2 reasons?
2 By what is the sequence of the fields in the index determined? I read a BLOG about permance, the author make a example with DB05, and say if the distinct values of certain field is between 1-1000 lines, it is good to set a secondary index for the field.
I wonder, if the F3 has only 5 distinct value for all the data in the ZTABLE, and the F4 has 100 distinct value. Which one should be the first field in the index and why?
Thx!!~

Hi,
1 What is the technical structure of index?
For example, I have a table ztable with 5 fields, F1(key), F2(key). F3. F4.F5. If I create a index on F3,F4, the system will create a copy of this table. Is the structure of this copy as follow?
F3, F4, pointer(for the lineno of the recorder)
So this copy will have fewer lines than the ZTABLE and is sorted. If the DB optimizer choose this index in selection, it will be fast for the 2 reasons?
2 By what is the sequence of the fields in the index determined? I read a BLOG about permance, the author make a example with DB05, and say if the distinct values of certain field is between 1-1000 lines, it is good to set a secondary index for the field.
I wonder, if the F3 has only 5 distinct value for all the data in the ZTABLE, and the F4 has 100 distinct value. Which one should be the first field in the index and why?
You seem to be correct for some but not all.
Struture of index will
for unique key index F3, F4, row id of database
it could have only one row id when your where condition match with the index then it goes to only index table first and read the row id and read record directly from the row id.
But for non unique key table store all the F3, F4, row id of record which math value of F1 and F4. It can have multiple value.
When your where condition math with condition partially ie left part of the key or whole part key then read all match record from the index table and then read the database physical table and check for addation where condition if any.
Index is determine on basis of the where condtion which is most left part of index will match.
if your where condition F4 and in your index has f3 f4 then index will not consider, It create gap between index condition and read whole table database. But if you consider f3 then only it consider the index to read because it match the left most part with index fields.
For more details How to create secondary index ? Search for blog in sdn I reply many time.

Question about index in Hana

As far as i know that hana can automatically create a "reverted index" in column table. i also notice in SQL reference guide, that there also "create index" and also we can chage "revert index type (hash/value) " in unique constrains.
so my quesiton is:
1. what is the use case of sentence "create index", whether this index is hana's inverted index or classical DB's index
2. in which case, we should mannually create or build index to replace the one hana automatically create for us.
any hint is very appreciate

Hi Jerry,
Thanks for your response. does Hana create reverted index for each column in one table.
because from one document i catch these words
HANA automatically creates an index for all key columns. Columns with index are marked with ‚Index Type = FULL‛ in the table definition window:
Having an index for all key columns is usually sufficient as queries will typically put filter conditions on key columns. In use cases where filter conditions are on non-key fields and tables have many records, creating an index on this non-key field might improve the performance.
The syntax to create an index is
CREATE INDEX <name> ON <table> (<column>)
i guess it maybe a bit out-of-date, but i am also has 2 questions: (1) what is the key column; (2) how can i found these automatically index generated by Hana
very appreciate your kindly help
Regards,
William

A question about indexes

When I am at it, I can ask another thing I have been wondering for the longest time.
Sometimes our indexes are 2 rows. Everything works perfectly, except for when the text in the marker is so long that it takes up more than 1 line in the index. I have to manually break the line and add a tab for these lines to look good.
Example:
I want it to look like this:
The only way that can happen is if I go in and manually add the - and the linebreak and then add a tab. It's easy to forget.
Anybody have a solution? Frame 7.2b128
Lena

Michael and Johannes.
Thank you both for your answers. Strangely enough I didn't get a notice about you answering my question until now, 3 days after...
Yes, I am talking about TOC. Sorry, English is not my first language. We call it index, so I just wrote that. Johannes solution sounds interesting. Right now I am working on a book without a TOC, but I will look back here and implement your suggestion when I go back to the other book again!
Thanks again!

Question on indexing foreign key for replicated table

Hi everybody,
I have 2 tables with following script
create table
parent(parent_id number(2) not null,
parent_name varchar(20),
constraint parent_pk primary key(parent_id))
create table child(child_id number(2) not null,
parent_id number(2) not null,
child_name varchar2(20),
constraint pk_child primary key(child_id,parent_id),
constraint fk_child foreign key (parent_id) references parenr(parent_id)
I want to replicate them and I know to replicate these 2 tables i should add them to my replication group, my question is that the child_id has foreign key so as below link says
http://dbataj.blogspot.com/2007/11/advance-replication-part-ii-master.html
I should put an index on the foreign key.What type of index should it be and is the following script correct for my purpose?
CREATE BITMAP
INDEX "fk_child"
ON child ("PARENT_ID")
TABLESPACE "USERS"
I would appreciate your help in advance.
Mery

A bitmap index is almost certainly not the sort of index you'd want to create. You would normally want just a normal index, i.e.
CREATE INDEX fk_child
ON child( parent_id )on the master database just to support normal DML operations (otherwise, deleting a row from the parent table requires doing a full table scan on the child table to see if there are any orphaned child records).
If you are trying to set up a multi-master replication environment, you would also need to replicate this index, since you'll want to support basic DML on both nodes.
Justin

Question: create index indextype is ctxsys.context whith NOLOGGING

Dear All,
I would like to ask a question about
CREATE INDEX <index_name> ON <table_name> ( <index_col> ) INDEXTYPE IS CTXSYS.CONTEXT PARAMETERS ( ... )maybe you experienced that ctxsys.context index creation takes long time.
When you create a ctxsys.context index it is obvious to reduce the workload of the RDBMS. In this case I would like to reduce the I/O load with NOLOGGING option.
Firstly, I try to put the index into a tablespace with no logging option. I don't know why but it is not working. Watching the alert.log file I diagnose that redo log generated simultaneously while index generated (there are no other activity on RDBMS).
Q1 (optional): Why generating redo on object of NOLOGGING tablaspace ?
I think there are better solution: use the NOLOGGIN option of the create index command which is very simple to use at column indexes.
Which unclear to me how should I use in CREATE INDEX .. INDEXTYPE IS CTXSYS.CONTEXT command.
Fllowing the CREATE INDEX command syntax seems oubvious - but it provides sytax error.
Maybe this is why CREATE INDEX .. INDEXTYPE IS CTXSYS.CONTEXT needs something different for options: PL/SQL
example captured (for options):
begin
ctx_ddl.create_preference ('mystore', 'BASIC_STORAGE');
ctx_ddl.set_attribute ('mystore', 'I_INDEX_CLAUSE', 'tablespace users storage (initial 32k) compress 2');
end;
CREATE INDEX docs_idx ON my_docs(doc) INDEXTYPE IS CTXSYS.CONTEXT PARAMETERS ('STORAGE mystore');Q: How can I specify NOLOGGING option? In the index command? In the attribute? What is the exact syntax if NOLOGGING is allowed at ctxsys.context?
Oracle version: 11.1.0.6.0
Any advice, highly appreciated.
Istvan

You have to specify nologging in storage preference.
See Avoiding Redo Logging for an Oracle Text Domain Index (Doc ID 432762.1)
Example:
begin
ctx_ddl.drop_preference('my_storage');
end;
begin
ctx_ddl.create_preference('my_storage','BASIC_STORAGE');
end;
begin
ctx_ddl.set_attribute('my_storage', 'i_table_clause','tablespace foo1 storage (initial 5M next 10M pctincrease 0 freelists 24 freelist groups 24) nologging');
ctx_ddl.set_attribute('my_storage', 'k_table_clause','tablespace foo2 storage (initial 5M next 10M pctincrease 0) nologging');
ctx_ddl.set_attribute('my_storage', 'r_table_clause','tablespace foo3 storage (initial 5M next 10M pctincrease 0) lob(DATA) store as (nocache nologging) nologging');
ctx_ddl.set_attribute('my_storage', 'n_table_clause','tablespace foo4 storage (initial 5M next 10M pctincrease 0) nologging');
ctx_ddl.set_attribute('my_storage', 'p_table_clause','tablespace foo5 storage (initial 5M next 10M pctincrease 0) nologging');
ctx_ddl.set_attribute('my_storage', 'i_index_clause','tablespace foo6 storage (initial 5M next 10M pctincrease 0) compress 2 nologging');
end;

Detail questions about indexes?

We are trying to reduce coherence index heap use in our application using partitioned cache (we use near but it is the partitioned back tier that holds the indexes) and therefore needs to better understandand some details (we are right now using version 3.6 but will eventually change to 3.7 so if any of the answer are different for the two please indivcate that):
1. Are any indexes (or some part of them) maintained per partition (would be my guess since it is possible to efficiently apply PartitionFilter) or are they all per node?
2. Are any part of the indexes in binary form or are both the keys and values in the form of "java objects"?
Best Regards
Magnus

MagnusE wrote:
Thanks for the info.
I got a bit confused about your description of the forward and reverse indexes - I would have assumed that what is referred to as "forward index" would map keys to values provided by the extractor and the "reverse index" map values returned by extractors to possibly multiple keys that have extractors returning this value but it seems like it is the other way around or?!
Hi Magnus,
what you wrote first is correct.
The forward index is a map of internal (binary) keys to extracted values. This has the could be stored in the backing map entry, but I don't think it is done as that would make plugging in index implementation with IndexAwareExtractor much more problematic. Too bad, as it would have been a nice optimization.
The reverse index is a map of extracted values as keys to values of a collection or array (logically a set) of internal (binary) keys of entries the extracted value was extracted from.
So if you have a NamedCache<K,V> and extracted value type is X, then forward index is Map<Binary<K>,X> and reverse index is a Map<X,Set<Binary<K>>> for unsorted indexes and SortedMap<X,Set<Binary<K>>> in case of sorted indexes.
The map and set implementations may differ from implementation version to implementation version.
I don't know what you refer to which would describe it the other way round.
In our case the indexes seem to occupy a lot more heap than the data itself(!!!). That is quite conceivable if you have attributes which can take lots of different values, as in that case the reverse index will also have many entries, each entry value being a set which is not exactly a lean thing either.
It is in particular an index containing information about what cache objects that reference what other cache objects (we use this to answer "where used" questions i.e. what objects contains references to object X) that seem to occupy LOTS of space...
Again, that is lots of different values thus lots of entries in reverse index.
Do you think that your analysis can be easily extended to extractors returning a collection (as is the case for our "gigantic" index) or do they require more investigation?A collection is just a value. If two collections do not equal by the equals() method, then they will have different reverse index entries. It is quite feasible to implement a forward-only index in case you don't need to filter for equality, but you just want to avoid deserialization.
>
With 3.6.1.4 we have done some preliminary tests with different number of partitions and it seems (not fully verified) that it makes a significant difference (fewer partitions = lower index size) so maybe they something has changed from 3.5 (with your analysis I do not see any indication that number of partitions should affect index size or have I missed something to that effect)...
Number of partitions do not affect index size at the moment, indexes are not partitioned in 3.6. (Probably not even in 3.7). The only case when they would influence index size would be if you had partitioned reverse index (and that would make reverse index footprint possibly worse, but definitely not better) analogously to having more nodes causes higher total index footprint.
It is a pity that Oracle don't provide this kind of technical information in the documentation - for a this kind of product it is often essential for developers / architects to have as detailed info as possible...
I don't see what documentation you are really missing. Coherence indexes are instances of SimpleMapIndex which class has a Javadoc. Alexey and I have several times described the structure of indexes on the forum and in the blog. The Coherence book quite aptly describes it. All those descriptions are still valid as index strutures have not significantly changed since 3.0 except that starting with 3.6 you can plug in your own implementation of MapIndex instead of SimpleMapIndex. There was an optimization around 3.5-3.6 time (as far as I remember in one of the 3.5.x patch releases and 3.6) which ensured that you don't have multiple references to the equaling extracted objects (after a request Alexey submitted after one of his blog entries describing index usage), but really that is all, and even that was not a structural change. Semantically, having sparse indexes and forward-only indexes became possible with 3.6 (by plugging in your own implementation), and I don't remember which version introduced not indexing null values which cuts down on size a bit if nulls are frequent and not interesting.
Best regards,
Robert

Newbie question on indexing XML type

I cannot get a query to use an index I created for an XML type. Here is my setup:
create table XmlTest( id number,
data_xml XMLType)
XmlType data_xml STORE AS CLOB;
I inserted 10,000 records like this ( each record has a unique id):
insert into XmlTest(id, data_xml) values
( 1
, XMLType('<company>
<department>
<id>10</id>
<name>Accounting</name>
</department>
</company>'));
I then created this index:
CREATE INDEX xmltest1
ON xmltest (extractValue(data_xml, '/company/department/id'));
When I run this query, it takes a long time - 12 seconds.
SELECT id from xmltest
WHERE EXISTSNODE( data_xml, '/company/department[id="37500"]') = 1;
it is doing a full table scan. What is wrong with my index?
Thanks!

I've yet to have the opportunity to work with indexes on XML data but I suspect it is because your index alone cannot satisfy the results of the query and the data you want is from every row in the table so a FTS is the best approach.
To restate, you are asking for the id value from the table where the XML contains a certain node. This node exists in every entry in the index, so why use the index if you have to go get data from the table.
Or it is because EXISTSNODE is checking for a different condition then your index was defined on. I suspect if you do something like /company/department/id[. = '10'] in your EXISTSNODE, it should use the index.
All this is a guess and the best place for you to look is the {forum:id=34} forum and also [Marco's Blog|http://www.liberidu.com/blog/]

Question regarding index function in fortran

Hi guys,
we are currently migrating to F90 from F77 fortran.
When I link the code, I get link error on index function with f90 compiler, but it works fine with F77.
Symbol not found error
__f_index_a dbg/driver.o
Can you please tell where can I find the symbol definition.
-Prabhu

As I mentioned before, the value of a constant that does not fit in the space allocated for it is undefined. Different compilers will handle it differently.
Sun's f77 compiler was derived from the BSD UNIX f77 compiler, which in turn was derived from AT&T's f77 compiler. AT&T's f77 compiler was written by Stuart Feldman while he was at Bell Labs. Perhaps influenced by the C programming language, he chose to increase the space allocated for an integer constant if its value did not fit in the space that would normally be allocated for it, up to the size of the largest supported integer type.
Sun's f90 and f95 compilers were derived from the CraySoft f90 compiler. The CraySoft compiler chopped off the high-order bits of integer values that did not fit in the available space.
Sun's Fortran team recognized that the behavior of Sun f90 and f95 in this regard would be a problem for some users. We devised a scheme that would resolve the problem in most cases. The scheme has been partially implemented, but there is still a lot of work left to be done.
Robert Corbett

Question about INDEX

What is the difference between two following create table statements ?
CREATE TABLE emp (
empno NUMBER(5) PRIMARY KEY)
ENABLE PRIMARY KEY USING INDEX
AND
CREATE TABLE emp (
empno NUMBER(5) PRIMARY KEY)
Thanks in advance

The second statement is explicit whereas the first statement relies on the defaults. As can be seen below the primary key works in both cases.
SQL> CREATE TABLE emp (
2 empno NUMBER(5) PRIMARY KEY)
3 ENABLE PRIMARY KEY USING INDEX
4 /
Table created.
SQL> insert into emp values (1)
2 /
1 row created.
SQL> r
1* insert into emp values (1)
insert into emp values (1)
ERROR at line 1:
ORA-00001: unique constraint (APC.SYS_C009929) violated
SQL> drop table emp
2 /
Table dropped.
SQL> CREATE TABLE emp (
2 empno NUMBER(5) PRIMARY KEY)
3 /
Table created.
SQL> insert into emp values (1)
2 /
1 row created.*
SQL> r
1* insert into emp values (1)
insert into emp values (1)
ERROR at line 1:
ORA-00001: unique constraint (APC.SYS_C009930) violated
SQL>By the way, it's a good idea to explicity name your constraints. It's a lot easier to work with EMP_PK than with SYS_C009930.
Cheers, APC
blog: [http://radiofreetooting.blogspot.com]

Question about index for some condition

Hello expert,
I have following condition in the where subclause, will you please tell if it will use index for transaction_log_fk ?
pp.transaction_log_fk < p_transaction_log_fk
Many Thanks,

You'll have to check out the execution plan if you want to know if Oracle's Optimizer will use the index.
It depends on the selectivity of your data, table statistics etc.
If your query returns a lot of records then a FTS would be obvious, for example.
Here's some more:
http://asktom.oracle.com/pls/apex/f?p=100:11:0::::P11_QUESTION_ID:9422487749968
And you should read these links from the SQL and PL/SQL FAQ:
SQL and PL/SQL FAQ
Read the following threads from there:
- When your query takes too long...
- How to post a SQL statement tuning request
They explain it all.
Edited by: hoek on Jun 24, 2011 4:48 PM

Easy question about indexes

Hello,
I have a table of 100000 rows:
MyTable
MyID number(4,0),
Otherfields ,
Name varchar2(30),
LastName varchar(35),
If I query and just select 60 rows from a total of 100000 rows:
SELECT MyID, OtherFields, Name,LastName
FROM MyTable
WHERE MyID=11
ORDER BY LastName,Name
Actually I need an index for MyID field. But would I need an index for LastName and Name? I think I don't, because I'm not using those fields for filtering. Am I correct?
Thanks!

With this you could see more in detail the issues to consider at the time to index a table.
SQL>
SQL> create table mytable
2 (
3 myid number(4,0),
4 name varchar2(30),
5 lastname varchar(35));
Table created.
SQL>
SQL> explain plan for
2 select * from
3 mytable where
4 myid=11
5 order by lastname, name;
Explained.
SQL> select * from table ( dbms_xplan.display );
PLAN_TABLE_OUTPUT
| Id | Operation            | Name       | Rows | Bytes | Cost |
|   0 | SELECT STATEMENT     |             |       |       |       |
|   1 | SORT ORDER BY       |             |       |       |       |
|   2 |   TABLE ACCESS FULL | MYTABLE     |       |       |       |
Note: rule based optimization, 'PLAN_TABLE' is old version
10 rows selected.
SQL> create index i1 on mytable(myid);
Index created.
SQL> explain plan for
2 select * from
3 mytable where
4 myid=11
5 order by lastname, name;
Explained.
SQL> select * from table ( dbms_xplan.display );
PLAN_TABLE_OUTPUT
| Id | Operation                    | Name       | Rows | Bytes | Cost |
|   0 | SELECT STATEMENT             |             |       |       |       |
|   1 | SORT ORDER BY               |             |       |       |       |
|   2 |   TABLE ACCESS BY INDEX ROWID| MYTABLE     |       |       |       |
|   3 |    INDEX RANGE SCAN          | I1          |       |       |       |
Note: rule based optimization, 'PLAN_TABLE' is old version
11 rows selected.
SQL>
SQL>
SQL> create index i2 on mytable(myid,lastname, name);
Index created.
SQL> explain plan for
2 select * from
3 mytable where
4 myid=11
5 order by lastname, name;
Explained.
SQL> select * from table ( dbms_xplan.display );
PLAN_TABLE_OUTPUT
| Id | Operation                    | Name       | Rows | Bytes | Cost |
|   0 | SELECT STATEMENT             |             |       |       |       |
|   1 | SORT ORDER BY               |             |       |       |       |
|   2 |   TABLE ACCESS BY INDEX ROWID| MYTABLE     |       |       |       |
|   3 |    INDEX RANGE SCAN          | I1          |       |       |       |
Note: rule based optimization, 'PLAN_TABLE' is old version
11 rows selected.
SQL>
SQL> drop index i1;
Index dropped.
SQL>
SQL> explain plan for
2 select * from
3 mytable where
4 myid=11
5 order by lastname, name;
Explained.
SQL> select * from table ( dbms_xplan.display );
PLAN_TABLE_OUTPUT
| Id | Operation            | Name       | Rows | Bytes | Cost |
|   0 | SELECT STATEMENT     |             |       |       |       |
|   1 | SORT ORDER BY       |             |       |       |       |
|   2 |   INDEX RANGE SCAN   | I2          |       |       |       |
Note: rule based optimization, 'PLAN_TABLE' is old version
10 rows selected.
SQL>Creating the index i1 you will have pros and cons regarding to the creation of the index i2 and viceversa. If you want to what are them, you could reply
Joel PÃ©rez
http://www.oracle.com/technology/experts

JTable question regarding Index/ID's from a VB guy

Greets!
So i am coming from VB6 where i use an ActiveX object table to display data from a SQL database table. When populating the table i include the 'ID' field from the database table as a hidden column. So when a user selects a row, i pull the hidden column's ID# and use that to do whatever (bring up another edit form, etc)
So here i am in Java now, i've been playing with jTable for a while now and seem to be getting the hang of the basics, but when i replicated the above scenario, hiding the ID column had weird results (cursor would dissappear when i scroll over with the arrow keys). I also saw another post where another person said that along with populating the jTable i should also have an array that stores the ID that matches the RowIndex from the jTable itself.
This is the table model that i am using:
public class jTableModel extends AbstractTableModel {
    private double xTotal;
    private int colnum;
    private int rownum;
    private String[] colNames;
    private ArrayList<Object[]> ResultSets;
    private Icon zIcon;
    /** Creates a new instance of FoodTableModel */
    public jTableModel(ResultSet rs,frmMain frm) {
      ResultSets=new ArrayList<Object[]>();
      Icon icon1 = new ImageIcon(getClass().getResource("/main/images/bullet_ball_glass_blue.png"));
      Icon icon2 = new ImageIcon(getClass().getResource("/main/images/bullet_ball_glass_red.png"));
      Icon icon3 = new ImageIcon(getClass().getResource("/main/images/bullet_ball_glass_green.png"));
      try{
        while(rs.next()){
            switch (rs.getInt("Type")) {
                case 1: zIcon = icon1; break;
                case 2: zIcon = icon2; break;
                case 3: zIcon = icon3; break;
            Object[] row={zIcon,rs.getString("Name"),rs.getString("Description"),rs.getString("ID")};
            ResultSets.add(row);
        String[] zNames={
            "","Name","Description","ID"
        colNames = zNames;
        colnum=4;
      catch(Exception e){
          System.out.println("(jTableModel: There was an error: " + e);
    public Object getValueAt(int rowindex, int columnindex) {
       Object[] row=ResultSets.get(rowindex);
       return row[columnindex];
    public int getRowCount() {
        return ResultSets.size();
    public int getColumnCount() {
        return colnum;
    @Override
    public String getColumnName(int param) {
       return colNames[param];
    public double getTotal() {
        return xTotal;
    @Override
    public Class getColumnClass(int column) {
     return getValueAt(0, column).getClass();
    }Can anyone give me any tips in this area or point me in the right direction?
Any help would be appreciated.

Dear Poster,
As no response has been provided to the thread in some time I must assume the issue is resolved, if the question is still valid please create a new thread rephrasing the query and providing as much data as possible to promote response from the community.
Best Regards,
SDN SRM Moderation Team

Question about indexes

Hi all,
Given a table T, an index I on T, and a row R of the table T, is it possible to know the index leaf block in the index I containing an entry for the row R ?
And ,given a table T, an index I on T, and an index leaf block B in this index I, is it possible to know all the rows in the table T to which the entries in B refer to ?
Thanks in advance for your ideas.

Hi,
yes, it's possible, but you'll have to dump some index blocks. See http://richardfoote.wordpress.com/2010/02/08/index-block-dumps-and-treedumps-part-i-knock-on-wood/
for general guidance and specific examples.
Best regards,
Nikolay

Question on Indexing

Similar Messages

Maybe you are looking for