Partitioning or an index organized table. Suggestion required.

Similar Questions

• Delete Performance index organized Tables

  Hello
  
  We are experiencing some performance problems with one of our tables.
  
  We have a table (test), which contains 9 columns:
  
  A number (10) not null not pk,.
  B number (10),
  C number (10),
  D number (10),
  E number (10),
  F varchar2 (30),
  F varchar2 (2),
  G varchar2 (2),
  H varchar2 (250).
  
  The table test is an ITO (Index Organized Table) in configuration of default ITO.
  All columns are often necessary for we can not all overflows.
  
  The table has currently 8 m records, which is roughly 1/2 years of a data value, so insignificant.
  Inserts and updates are fine, but it takes 40 + seconds to delete a single line!
  
  (remove test where a = 3043 ;))
  
  If I convert this table in a standard table, deletes are only 0.5 of a second?
  
  No idea why the delete statement takes an excessively long time on the IOT, or what I could do wrong?
  
  Thank you
  Victoria
  
  Oracle Enterprise version 10.2.0.1.0
  Oracle XE version 10.2.0.1.0

  It seems as if the PK on this table of ITO is referenced by a FK on a child table (big enough) but the FK does not have an associated index.

  Deleting a line in this table, Oracle is required to perform a FTS on the child table to make sure that there is no matching FK.

  Find out if you have indeed a FK that refers to this table, and if CF is indexed.

  Just a guess, of course. A long track during the delete operation should be noted where Pio come just to be sure.

  See you soon

  Richard Foote
  http://richardfoote.WordPress.com/

• Index organized Tables

  What is logical rowid in IOT? are they kept physically somwhere like physical rowId
  
  What are secondary indexes?
  
  what he meant by leaves block splits? When and how it happens?
  
  and the primary key for a table in index constraint cannot be abandoned, delayed or off, is this true, if yes then Y
  
  How overflow works? how the two clauses are implemented PCTTHRESHOLD and INCLUDING.how they work?
  
  Published by: Juhi on October 22, 2008 13:09

  I'm sort of tempted to simply point you in the direction of the official documentation (concepts guide would be a start. See http://download.oracle.com/docs/cd/B28359_01/server.111/b28318/schema.htm#sthref759)

  But I would say one or two other things.

  First, physical ROWID not is not physically stored. I don't know why you would think they were. Certainly the ROWID data type can store a rowid if you choose to do, but if you do something like "select rowid from scott.emp", for example, you will see the ROWID that are generated on the fly. ROWID is a pseudo-column, not physically stored anywhere, but calculated each time as needed.

  The difference between a physical rowid and logic used with IOT boils down to a bit of relational database theory. It is a rule in melting of relational databases that a line, once inserted into a table, must never move. In other words, the identifier that is assigned at the time of his first insertion, must be the rowid he "keeps" for ever and ever. If you ever want to change the assigned lines in an ordinary table ROWID, you must export them, truncate the table, and then reinsert them: Insert charges, fees rowid. (Oracle bend this rule for various purposes of maintenance and management, according to which 'allow the movement of line"allows lines without a table, but the general case is still valid for most).

  This rule is obviously hopeless for the index structures. It was true, an index entry for "Bob" which is updated to "Robert" would find next to the entries for 'Adam' and 'Charlie', even though she now has a value of 'R '. Effectively, 'line' a 'b' in an index must be allowed to "move" a sort of 'r' of the block if it's the kind of update that takes place. (In practice, an update to an index entry consists of performing a delete followed by a re - insert, but the physicalities do not change the principle: 'lines' in an index must be allowed to move if their value is changed; rows of a table do not move, no matter what happens to their values)

  An IOT is, at the end of the day, simply an index with columns much more in it that a 'normal' index would - he, too, has thus allow its entires (his 'rows', if you like) to move. Therefore, an IOT cannot use a standard ROWID, which is assigned only once and forever. Instead, one must use something that takes into account that its lines may wander. It's the logical rowid. It is not more 'physical' as a physical rowid - or are physically stored anywhere. But a 'physical' rowid is invariable; a logic is not. Logic, it is actually built in part of the primary key of the ITO - and this is the main reason why you can never get rid of the primary key on the IOT constraint. Be allowed to do would be to you to destroy an organizing principle for its content which has an IOT.

  (See the section called "The virtual ROWID" and continued on this page: http://download.oracle.com/docs/cd/B28359_01/server.111/b28318/datatype.htm#CNCPT1845)

  IOT so their data stored inside in the primary key order. But they only contain the primary key, but all the other columns in the definition of 'table' too. Therefore, just as with an ordinary table, you might sometimes find data on columns that are NOT part of the first key - and in this case, you might well these columns non-primary keys are indexed. Therefore, you create ordinary index on those columns - at this point, you create an index in an index, really, but it's a secondary question, too! These additional indices are called 'secondary index', simply because they are "subsidiary clues" in the main proceedings, which is the 'picture' himself laid out in the primary key order.

  Finally, a split block of sheets is simply what happens when you have to make room for the new data in an index block which is already filled to overflowing with the existing data. Imagine an index block may not contain four entries, for example. Fill you with entries for Adam, Bob, Charlie, David. Now, you insert a new record of 'Brian '. If it's a table, you can take Brian to a new block you like: data from a table have no positional sense. But the entries of an index MUST have positional significance: you can't just throw MC Bean and Brian in the middle of a lot of Roberts, bristling. Brian DOIT pass between the existing entries for Bob and Charlie. Still you can not just put him in the middle of these two, because then you'd have five entries in a block, not four, which we imagined for the moment to be maximally allowed. So what to do? What you do is: get an empty block. Move Charlie and David entries in the new block. Now you have two blocks: Adam-Bob and Charlie David. Each has only two entries, so each has two 'spaces' to accept new entries. Now you have room to add in the entry for Brian... and if you end up with Adam-Bob-Brian and Charlie David.

  The process of moving the index entries in a single block in a new one so that there is room to allow new entries to be inserted in the middle of existing ones is called a split of block. They occur for other reasons too, so it's just a brilliant of them treatment, but they give you the basic idea. It's because of splits of block that indexes (and thus IOT) see their 'lines' move: Charlie and David started in a single block and ended up in a completely different block due to a new (and completely foreign to them) Insert.

  Very well, infinity is simply a means of segregation of data in a separate table segment that would not reasonably be stored in the main segment of the ITO himself. Suppose that you are creating an IOT containing four columns: one, a digital sequence number; two, a varchar2 (10); three, a varchar2 (15); and four, a BLOB. Column 1 is the primary key.

  The first three columns are small and relatively compact. The fourth column is a blob of data type - so it could be stored whole, multi-gigabyte-size monsters DVD movies. Do you really want your index segment (because that's what an IOT really is) to ball to the huge dimensions, every time that you add a new line? Probably not. You probably want 1 to 3 columns, stored in the IOT, but column 4 can be struck off the coast to a segment on its own (the overflow segment, actually) and a link (in fact, a physical rowid pointer) can bind to the other. Left to himself, an IOT will cut each column after the a primary key when a record that threatens to consume more than 50% of a block is inserted. However, to keep the main IOT small and compact and yet still contain data of non-primary key, you can change these default settings. INCLUDE, for example, to specify what last non-primary key column should be the point where a record is split between "keep in IOT" and "out to overflow segment." You could say "INCLUDE COL3" in the previous example, so that COL1, COL2 and COL3 remain in the IOT and only COL4 overflows. And PCTTHRESHOLD can be set at, say, 5 or 10 so that you try to assure an IOT block always contains 10 to 20 saves - instead of the 2 you would end up with default if 50% of kicks.

• Why slow DML in Index organized tables

  I learned that ITO system was not suitable for tables that have a high volume of DML operations.
  
  I want to know that:
  
  1.) why DML operations are slow when we have data and indexes in the same place for ITO?
  2.) why we take extra precautions for fragmentation to ITO that pile of paintings organized?

  It's as long as your application does not change for the PK values that inspire you the IOT.

  If you have an application that actually modifies the values of primary key - Ouch!

  Here's how to think this through:
  Think of an Index on a column usually.
  What happens when you update the value of this column for a line or set of lines?
  The update to the line goes into the table block (and if the line does not expand or PCTFREE is adequate, there is no chaining line)
  However, the update of the index entry is not just an update. Because an Index is a Structure y (unlike a heap table), in order to change the value of an Index key (even when not unique), you have to 'remove' of the 'location' (IE block) he currently resides to and "insert" in the new "place" (block) corresponding to the new value. So, for example, if change 'Aman' (probably at the head of the Index tree) to "Hemant" (somewhere in the middle), you will find that "Hemant" belongs to another block - so that the index of "Aman" entry should be removed and a new entry for "Hemant" (pointing to the same ROWID) inserted in the correct index leaf block where 'Hemant' belongs.

  Now, instead of an Index on a single column, think an whole table-ITO is an ordered structure. If you change the value of the key to the order (ie the Index key) then the line should be moved to the correct location that he must belong.

  As it is, it is very bad design to change the values for the PK building. an IOT in such a severely design adds to the problem. Now, instead of simply delete and insert for the column values, the entire row should be deleted and inserted.

  However, if you do not change the values of the PK, then you should not have problems with updates. However, if the size of the line is large (or increases with updates), you will need to handle the overflow.

  Hemant K Collette
  http://hemantoracledba.blogspot.com

• the installation program could not use the existing partition because it does not contain the required free space

  before I have install android 5.0 lollipop on mylaptop but I can't use wifi to connect then I use return windows 8.1 and I decided to install windows 8 because I have experience an error I couldn't manage on windows 8.1 .when I try to install windows 8 it shows me this error Setup could not use the existing partition because it does not contain the required free space... I google search for the solution but could not find so I install the windows partition 8 on my system reserved.

  Hi Lawren,

  Thank you for your update on the issue.

  In this case, you may need to format the entire disk, clean the partitions and reinstall new windows as suggested before. However, I suggest you to contact local support for the backup of your data from hard disk partitions.

  Please post back your results for assistance.

• Why bitmp index are not suggested for DML operations

  Hi all
  
  Can someone make me understand why bitmap indexes are not suggested to use for DML operations. AFAIK, the reason being that it locks the table and another user won '; t be able to complete the transaction but why?

  user13389425 wrote:
  the reason is that I found is that it stores the rowid of beginning and the end rowid and the value of the spreadsheet store n number of entries of the inder, so any operation DML whole leaves lock themselves and cause the performance of the database. My next question I was not able to address, is that the index entries how do I store it on a single sheet. How calcualte the same.

  It is not the entire sheet that gets locked, just the specific index entry in the block sheet index, as well as the corresponding lines in the table referenced by the rowid ranges in the index entry.

  As an indication, the average number of index entries in a block of sheets is the num_rows/leaf_blocks in dba_indexes. As an example, the average number of rows in the table referenced by the index entry is (num_rows in dba_tables/num_rows in dba_indexes) * distinct_keys in dba_indexes.

  See you soon

  Richard Foote
  http://richardfoote.WordPress.com/

• How to index a table on multiple sites?

  Hello

  How to index a table on multiple sites?

  I searched this issue and was not able to find the answer. I understand that it can be done with loops, but I don't know how.

  I use the detector of crete vi for frequency domain data collected a VNA (s2p) file. The products contain a table of amplitudes and a table of locations. The problem is that the locations refer to the index of table of amplitude, which is not the same as the frequency. My idea is that I can use this output of the places table to index the frequency to the detected peak frequencies table and then draw these, as well as some analysis data and manipulation on them. Currently, I can do this only by consulting table on the front panel.

  The entrance to the peak detector is currently a table 1 d of the scale (what is the problem?).

  I also looked at the supply frequency & estimate VI, but this VI seems only exit of scalar data for the largest peak, not exactly what I'm looking for.

  Thanks for your help.

  You have a second table for the tested frequency?  If so, then you are right that you just need to index this table with the indexes by the Ridge detector.  Use a loop for.  Automatic index to the index, use index in array to get the value of the frequency and autoindex on frequencies.

  

• What is the physical meaning of automatic indexing of table entry...

  What is the physical interpretation of the automatic indexing. ?

  You wire up a table on the edge of a loop, it sequentially will index the table for you as he travels the loops. A While loop will also do this, but it is much more common on loops For, therefore, loops For making automatically while the While loops must be 'right click' and said to the index in the array. Get it?

• Windows 7 Installer error "Setup could not use the existing system partition because it does not contain the required free space.

  Repeatedly tried to install the upgrade to windows 7 and pure install and get the error message on all partitions available "Setup could not use the existing system partition because it does not contain the required free space.  All 3 partitions on a single disk have over 90 GB and separated from the disc more than 65 GB of free space according to the properties of the disk and initial screen during installation.  Tried to reformat a partition empty all reinstall Xp sp3 without result.  What can I do?

  Remove the data cable of all drives except the drive that you want to install Windows 7 on.

  Remove all external devices.

  Delete all partitions on the disk leave all of the disc as "unallocated".

  Boot from the Windows 7 DVD and then install, when you reach the point where it asks you to select a drive, click the "Advanced" option and create a new partition (at least 50 GB) to install Windows and continue with the installation process.

  Also: http://social.technet.microsoft.com/Forums/nb-NO/w7itproinstall/thread/1b1adc74-3d94-4897-a3c1-7aabde44fe4b

  JS
  http://www.PAGESTART.com

• sort of an index by table

  Hi all

  I have a button on a form to run reports,

  There is a tabular block that has names of patients and a check box,

  When a user check more than one box, baptisms of report,

  When you close the first report, the second runs and so on.

  the problem is that there is another element that maintains a number when you check in a patient,

  If you check a patient, then the element holder is (1).

  you check the second element holds (2),

  but you can check the second record so that the point spacers (1), then check the first records in the block, so the first record holds (2),

  When you click the button to run the reports,

  (2) will be held the first (1), and that's what I don't want to happen, I want to sort them.

  check who is the owner of one (1) works first, and who owns the tracks (2) second and so on.

  so

  I wrote this code in the button which runs reports, but is not what I want, it runs reports according to records not the numbers.

  declare
  V_PARM  PARAMLIST ;
       LST_REC NUMBER ;
      REQUEST_NUM NUMBER:=1;
     TYPE V_RECORD IS RECORD (V_VISIT_ID MR_PATIENT_VISITS.VISIT_ID%TYPE                         
     ,V_ORG_NO RC_PATIENT_EPISODES .ORGANIZATION_NO%TYPE
     ,V_NUM NUMBER);
    
     TYPE PRD_TYPE  IS TABLE OF  V_RECORD INDEX BY BINARY_INTEGER;
     PRD_TABLE PRD_TYPE;
  BEGIN
      GO_ITEM('ALL_ADMITTED_PATIENT.PATIENT_FILE_NO') ;
      FIRST_RECORD ;
      LOOP
          IF :ALL_ADMITTED_PATIENT.CHECK_PAT = 'Y'
              THEN
             
              PRD_TABLE(:ALL_ADMITTED_PATIENT.NUM).V_VISIT_ID  := :ALL_ADMITTED_PATIENT.VISIT_ID;
  
               PRD_TABLE(:ALL_ADMITTED_PATIENT.NUM).V_ORG_NO := :ALL_ADMITTED_PATIENT.ORGANIZATION_NO;
  
               PRD_TABLE(:ALL_ADMITTED_PATIENT.NUM).V_NUM  := :ALL_ADMITTED_PATIENT.NUM;
              
              
    V_PARM := GET_PARAMETER_LIST('REPDATA');
    IF NOT ID_NULL(V_PARM) THEN
        DESTROY_PARAMETER_LIST(V_PARM);
    END IF;
    V_PARM := CREATE_PARAMETER_LIST('REPDATA'); 
    Add_Parameter(v_parm,'P_VISIT_ID'          ,TEXT_PARAMETER,    PRD_TABLE(:ALL_ADMITTED_PATIENT.NUM).V_VISIT_ID);
    Add_Parameter(v_parm,'P_ORGANIZATION_NO'   ,TEXT_PARAMETER,PRD_TABLE(:ALL_ADMITTED_PATIENT.NUM).V_ORG_NO);
    
    REQUEST_NUM := REQUEST_NUM +1;
    
    RUN_REPORT('MRSHTVIW',TO_NUMBER('1'),V_PARM ,'OCX_BLOCK.OCX'); 
    EXIT WHEN :SYSTEM.LAST_RECORD = 'TRUE' ;
    NEXT_RECORD ;
    ELSE
        EXIT WHEN :SYSTEM.LAST_RECORD = 'TRUE' ;
        NEXT_RECORD ;
        END IF ;
          END LOOP ;
      
  
  END;
  
  
  
    
     -------------------
  
  
  
  
  

  I want to sort the 'index by table' once he gets the data in it?

  or any other solution

  Many thanks to you all,.

  Thank God I solved it, it comes to the latest version of my code that solved the problem:

  
   DECLARE
       V_PARM PARAMLIST ; 
  
       TYPE ADT_REC_TYPE IS RECORD (V_VISIT_ID VARCHAR2(90) ,
       V_ORG_NO VARCHAR2(90)
       ) ;
       ADT_REC ADT_REC_TYPE ;
       TYPE ADT_TAB_TYPE IS TABLE OF ADT_REC_TYPE
       INDEX BY BINARY_INTEGER  ;
       ADT_TAB ADT_TAB_TYPE ;
   BEGIN
        GO_BLOCK('ALL_ADMITTED_PATIENT') ;
        FIRST_RECORD;
        LOOP
        IF :ALL_ADMITTED_PATIENT.CHECK_PAT = 'Y'
              THEN
          ADT_TAB(:ALL_ADMITTED_PATIENT.NUM).V_VISIT_ID := :ALL_ADMITTED_PATIENT.VISIT_ID     ;
          ADT_TAB(:ALL_ADMITTED_PATIENT.NUM).V_ORG_NO   := :ALL_ADMITTED_PATIENT.ORGANIZATION_NO ; 
  
   END IF ; 
  
        EXIT WHEN :SYSTEM.LAST_RECORD = 'TRUE' ;
         NEXT_RECORD ;      
  
        END LOOP ; 
  
        FOR I IN ADT_TAB.FIRST .. ADT_TAB.LAST LOOP 
  
        V_PARM := GET_PARAMETER_LIST('REPDATA');
    IF NOT ID_NULL(V_PARM) THEN
        DESTROY_PARAMETER_LIST(V_PARM);
    END IF;
    V_PARM := CREATE_PARAMETER_LIST('REPDATA');  
  
    Add_Parameter(v_parm,'P_VISIT_ID'          ,TEXT_PARAMETER,    ADT_TAB(I).V_VISIT_ID);
    Add_Parameter(v_parm,'P_ORGANIZATION_NO'   ,TEXT_PARAMETER,ADT_TAB(I).V_ORG_NO);
    RUN_REPORT('MRSHTVIW',TO_NUMBER(:GLOBAL.LANGUAGE_ID),V_PARM ,'OCX_BLOCK.OCX');
  END LOOP ;
       END ; 
  

• Recovery of the records by using the Ref Cursor or indexes per Table (which is better)

  Hi all
  
  I am interested to know if there is a performance (or other) advantages to return a result set from an Oracle stored procedure for a client application (for example, in Java) by using a Ref Cursor or Index by Table, respectively. Most of the people I met who know Java seem to use a Ref Cursor but did not say why this method is preferable. I'm not too familiar with Java and do not have the opportunity to test the difference between either method, but I am very interested in the other user forum about this view, gauging
  
  Kind regards
  
  Kevin.

  KevinFitz wrote:
  Hi zerathul,

  Thanks for the quick and helpful response. A REF CURSOR would be the best solution if the same set of results (content and number of records returned) should be dealt with by the application of the 'customer '. I'm guessing that maybe in this situation 'theoretical' that there might be less network traffic to return the set of results through an associative array,

  Kind regards

  Kevin.

  Yes, it would always be the best solution, because an associative array would mean collecting all the data in memory of expensive PGA on the database server before they pass any return on the network, while a fair Ref cursor is to feed the data over the network (maybe a little extra load, but you were unlikely to notice). Also the client application would treat a ref as of rows returned cursor data recovery and could treat them upon their arrival, an associative array is a collection of data which will then be entirely spent before any treatment could be done and then the treatment should go through the entire table to do.

  REF CURSOR will also provide other information such as the error codes etc regarding SQL if necessary. If you get an error when filling a table on the side of the database, it is not so easy to recover this error to the client.

  REF CURSOR is designed for this purpose. Use them.

• ORA-01502: index 'pk_tab1' or partition of this index is unusable;

  After ruining congratulate him:
  
  ALTER index rebuild tablespace to developers pk_tab1. »
  
  I check the State of objects and getting no results
  
  Select * From User_Objects o
  Where o.status! = 'VALID';
  
  But my process to get the error
  
  ORA-01502: index 'pk_tab1' or partition of this index is unusable;
  
  Way?
  
  And how to avoid problem, like these in the future?
  How to check the index is to rebuild correctly?

  Please show us

  Select index_name, status, user_indexes tablespace_name I where i.index_name = 'PK_TAB1'

  If it stills status INDIVIDUAL... rebuild

  change the PK_TAB1 index rebuild online;

  and check... so again; Drop it and recreate ;)

  Edited by: Surachart (HunterX) on June 16, 2009 13:03

• Query on the organized Table (IOT) Index sorts unnecessarily data

  I created hist3 to the table as follows:
  
  create table hist3)
  reference date,
  palette varchar2 (6).
  Artikel varchar2 (10),
  Menge number (10),
  status varchar2 (4).
  VARCHAR2 (20) text.
  VARCHAR2 (40) data.
  primary key constraint hist3_pk (reference, palette, artikel)
  )
  index of the Organization;
  
  The table being an IOT, I expect that the retrieval of rows in the same order as in the primary key must be very fast.
  
  This is true for the following query:
  
  SQL > select * from hist3 by reference;
  
  -----------------------------------------------------------------------------
  | ID | Operation | Name | Lines | Bytes | Cost (% CPU). Time |
  -----------------------------------------------------------------------------
  | 0 | SELECT STATEMENT | 1000K | 82 M | 3432 (1) | 00:00:42 |
  | 1. INDEX SCAN FULL | HIST3_PK | 1000K | 82 M | 3432 (1) | 00:00:42 |
  -----------------------------------------------------------------------------
  
  But if I add the following column of the primary key as a criterion of the order, the query becomes very slow.
  SQL > select * from hist3 by reference, palette;
  
  ------------------------------------------------------------------------------------------
  | ID | Operation | Name | Lines | Bytes | TempSpc | Cost (% CPU). Time |
  ------------------------------------------------------------------------------------------
  | 0 | SELECT STATEMENT | 1000K | 82 M | 22523 (1) | 00:04:31 |
  | 1. SORT ORDER BY | 1000K | 82 M | 200 M | 22523 (1) | 00:04:31 |
  | 2. FULL RESTRICTED INDEX SCAN FAST | HIST3_PK | 1000K | 82 M | 2524 (2) | 00:00:31 |
  ------------------------------------------------------------------------------------------
  
  If I look at the execution plan, I don't understand why a SORT statement should be needed, as data already take the IOT in the order requested.
  
  Any thoughts?
  Thomas

  There are various ways how Oracle sorts VARCHARs.
  When you create an index on a VARCHAR column, sort order is binary.
  Try ' alter session set nls_sort = "BINARY" "and run your query."

• For indexing loop (tables)

  Hello and thanks for reading.

  I have a problem that requires me to do a lot of manipulations with the berries, and I am doing this in a series of nested for loops. I'll cut straight to my question.

  I initialize an array 0 in several user-defined columns. I run a loop for the number of times user, generating a random value to each iteration defined. If I activate the automatic indexing, I use the subset of table replace outside the loop and it works very well.

  Here's my problem. If I turn off the automatic indexing, and son of the [i] block to the index on the subset of table replace, now all of a sudden all I get is a random value, and it is always in the last slot in the table.

  I was pulling my hair out on this problem. I looked at the forums, I looked at the example problems, I don't know WHY it does this, but I have TO be able to use the loop counter to replace the elements in the array. I'll lay 3 loops, and I'm not quite (familiar) uncomfortable with the way the auto-indexation feature chooses value auto-index to be able to think through the problem.

  I wrote the program in C in my head in about 10 minutes, but this automatic indexing thing is KILLING me and I have no idea how import C in LabView without writing a dll, which I don't know how do either.

  Please let me know how I can get the loop For to browse a table without using automatic indexing. Yet once again, I have no idea why he is just posting a value in the last slot of the table.

  Thanks a lot for all the replies.

  I know what it is.  I have no LV 2010 here at installed work, so I have to rely on my memory and see the code.

  You use replace table subset.  With lit autoindexing, you create a table 1 d of random numbers which is be the same length as your table due to the terminal N being associated with the length of the array.  If you end up replacing the dimension table 1 d in its entirety in a single shot with the new data starting with element 0.  (For smile, associate a smaller number to Terminal N and you will see that some of your table 1 d is replaced).

  The way I showed you replace 1 data at a time, and the first iteration is item 0, the element following 1...

• Mathscript I can only index a table with an actual integer not a reference to another table

  Hello

  Basically, I'm trying to write a function in Mathscript that works well in Matlab.

  I did a FFT of a signal that I used VI Ridge detector to find the main summits

  To find the signal of phase I want to refer to the location of the peaks in the phase table

  That is to say

  Phase (rental (1))

  Simply, I get the error-90026. Motorization of matrices the same indices of size must be whole

  Is this a bug

  Hello

  What version of LabVIEW are you using?  Are you maybe get two error codes?  Error-90026 is simply the indexes should be real and positive integers.  If you also get an error on the size of the matrices being incompatible, try your code in the MathScript window.  What is
  Rental (1)
  back?  A scalar value?  Or a table?

  What is the left side of this expression?  In other words, you assign the result to a variable or a submatrix?
  A = Phase (rental (1));
  or
  A (c:d) = Phase (rental (1));

  What is output when you type
  Rental (1)

  It is an integer value greater than 0?  Or is it a double number?  If you calculate the table of location in a certain way, it may be because the data error, you end up exactly a whole number.  Indexing routines will complain about this.  You can truncate to integer with the function of int32.  Try these suggestions.  If you still have problems, post more of your code so we can reproduce the problem that you see.

  Grant M.
  Staff software engineer | LabVIEW Math & Signal Processing | National Instruments