SQL sort order?

Similar Questions

• EPMA 11.1.2.1 dimension build from FlatFile to EPMA to EssbaseASO using ODI, Member, sort order issues

  We build our EssbaseASO cube using FlatFiles this work who are pushed to EPMA via the interface tables, EPMA Essbase app then is deployed to Essbase, everything is done through an ODI/package interface. The problem I am facing is the order in which members in EPMA appear, even if the FlatFile has the right, sort, at the time where that hierarchies are in the table of interface EPMA that the sort order is changed at random.

  I use the file SQL control add IKM in ODI and somewhere on the way I saw a suggestion to add a new option to insert "ORDER BY" in the IKM. I did it successfully and it has changed the sort order, but is not the correct order (the order in which my flatfile has the dimensions).

  I do not understand why Oracle/ODI needs to randomize the lines without being invited to do! Please let me know if anyone has faced this problem before, and if they have managed to solve.

  EPMA interface tables have a SORTORDER column. Make sure that it is filled with numerical values, sequencing of the order that you want your members to appear in the hierarchies of EPMA and when you import tables interface that this order will be respected. Prior to this function being introduction workaround was to create a view that references the tables interface imposing the required ORDER BY clause, but this is not necessary in 11.1.2.1 just use the SORTORDER column

• Dequeue condition causes queue sort order to be ignored

  This question relates to the fact that when a dequeue condition is specified the sort order of the queue can be invoked on:
  Of the 11.2 document "Introduction to Oracle QA:
  
  "A dequeue condition is expressed in terms of message properties or the content of the message and is similar to the syntax for the WHERE clause of a SQL query." Messages in the queue are assessed based on the State and the messages that meet the given condition are returned. When using a dequeue, removed from the order of messages condition is indeterminate, and the sort order of the queue is not honored. »
  
  
  I have a problem - I'm interested in consumers of respondent data certain selection criteria, but want to get this qualification given in the order of the oldest first (ENQ_TIME). If specifying the dequeue condition means that the order is unpredictable so it is not acceptable.
  
  I recognize that I could solve the problem by using the queue MULTIPLE_CONSUMER in which subscriptions are added with the rules for each possible consumer. The problem is that the volatility of the pool of consumption is relatively high and a solution is sought requires no adjustment properties of the queue.
  
  Am I missing something? i.e. misinterpretting this restriction?
  Someone else took up this challenge and found a technique to solve this problem?
  
  Thank you in advance.

  Hello

  The note needs modified to indicate that the event changes how dequeue via a deq_condition or done by the works of correlation id by adding another order by clause. If the 'impact' performance is localized to these stops and nothing else.

  There are a number of customers who have implemented this in production environments and are perfectly happy with it. Have you tried this event in a test environment?

  Thank you
  Peter

• Why cannot avoid the sort ORDER BY STOPKEY function index

   
  
  SQL> alter session set nls_language=american;
  
  Session altered.
  
  SQL> create table test_sort(name,object_name) as select 'select',object_name from 
    2  dba_objects;
  
  Table created.
  
  SQL> create index i_test_sort_1 on test_sort(substr(name,0,3),object_name);
  
  Index created.
  
  SQL> exec dbms_stats.gather_table_stats(user,'TEST_SORT');
  
  PL/SQL procedure successfully completed.
  
  SQL> set autot trace
  SQL> select * from (select * from test_sort where substr(name,0,3)='sel' order by 
    2  object_name) where rownum<11;
  
  10 rows selected.
  
  
  Execution Plan
  ----------------------------------------------------------
  Plan hash value: 4202652051
  
  --------------------------------------------------------------------------------
  -------------
  
  | Id  | Operation               | Name      | Rows  | Bytes |TempSpc| Cost (%CPU
  )| Time     |
  
  --------------------------------------------------------------------------------
  -------------
  
  |   0 | SELECT STATEMENT        |           |    10 |   740 |       |   504   (3
  )| 00:00:07 |
  
  |*  1 |  COUNT STOPKEY          |           |       |       |       |
   |          |
  
  |   2 |   VIEW                  |           | 49902 |  3606K|       |   504   (3
  )| 00:00:07 |
  
  |*  3 |    SORT ORDER BY STOPKEY|           | 49902 |  1559K|  3928K|   504   (3
  )| 00:00:07 |
  
  |*  4 |     TABLE ACCESS FULL   | TEST_SORT | 49902 |  1559K|       |    60   (5
  )| 00:00:01 |
  
  --------------------------------------------------------------------------------
  -------------
  
  
  Predicate Information (identified by operation id):
  ---------------------------------------------------
  
     1 - filter(ROWNUM<11)
     3 - filter(ROWNUM<11)
     4 - filter(SUBSTR("NAME",0,3)='sel')
  
  
  Statistics
  ----------------------------------------------------------
          139  recursive calls
            0  db block gets
          279  consistent gets
            0  physical reads
            0  redo size
          695  bytes sent via SQL*Net to client
          400  bytes received via SQL*Net from client
            2  SQL*Net roundtrips to/from client
            5  sorts (memory)
            0  sorts (disk)
           10  rows processed 
  
  sql doesn't choose index ,so I use hint to force oracle choose index
  
  SQL> select * from (select /*+ index(test_sort) */ * from test_sort where substr(name,0,3)='sel'
    2  order by object_name) where rownum<11;
  
  10 rows selected.
  
  
  Execution Plan
  ----------------------------------------------------------
  Plan hash value: 1978014138
  
  --------------------------------------------------------------------------------
  ------------------------
  
  | Id  | Operation                      | Name          | Rows  | Bytes |TempSpc|
   Cost (%CPU)| Time     |
  
  --------------------------------------------------------------------------------
  ------------------------
  
  |   0 | SELECT STATEMENT               |               |    10 |   740 |       |
   22869   (1)| 00:04:35 |
  
  |*  1 |  COUNT STOPKEY                 |               |       |       |       |
              |          |
  
  |   2 |   VIEW                         |               | 49902 |  3606K|       |
   22869   (1)| 00:04:35 |
  
  |*  3 |    SORT ORDER BY STOPKEY       |               | 49902 |  1559K|  3928K|
   22869   (1)| 00:04:35 |
  
  |   4 |     TABLE ACCESS BY INDEX ROWID| TEST_SORT     | 49902 |  1559K|       |
   22424   (1)| 00:04:30 |
  
  |*  5 |      INDEX RANGE SCAN          | I_TEST_SORT_1 | 49902 |       |       |
     278   (1)| 00:00:04 |
  
  --------------------------------------------------------------------------------
  ------------------------
  
  
  Predicate Information (identified by operation id):
  ---------------------------------------------------
  
     1 - filter(ROWNUM<11)
     3 - filter(ROWNUM<11)
     5 - access(SUBSTR("NAME",0,3)='sel')
  
  
  Statistics
  ----------------------------------------------------------
            1  recursive calls
            0  db block gets
        22393  consistent gets
            0  physical reads
            0  redo size
          695  bytes sent via SQL*Net to client
          400  bytes received via SQL*Net from client
            2  SQL*Net roundtrips to/from client
            1  sorts (memory)
            0  sorts (disk)
           10  rows processed
  
  From the explain ,the sql chooses the index,but SORT ORDER BY STOPKEY  doesn't avoid,so oracle
  must read all rows satisfy substr(name,0,3)='sel' ,the I rewrite the sql as the following,we can see 
  that sort ORDER BY STOPKEY does't happen,so oracle return 10 rows fast. 
  
  SQL> select * from (select /*+ index(test_sort) */ * from test_sort where substr(name,0,3)='sel'
    2  order by substr(name,0,3),object_name) where rownum<11;
  
  10 rows selected.
  
  
  Execution Plan
  ----------------------------------------------------------
  Plan hash value: 4154852915
  
  --------------------------------------------------------------------------------
  ---------------
  
  | Id  | Operation                     | Name          | Rows  | Bytes | Cost (%C
  PU)| Time     |
  
  --------------------------------------------------------------------------------
  ---------------
  
  |   0 | SELECT STATEMENT              |               |    10 |   740 |     8
  (0)| 00:00:01 |
  
  |*  1 |  COUNT STOPKEY                |               |       |       |
     |          |
  
  |   2 |   VIEW                        |               |    10 |   740 |     8
  (0)| 00:00:01 |
  
  |   3 |    TABLE ACCESS BY INDEX ROWID| TEST_SORT     | 49902 |  1559K|     8
  (0)| 00:00:01 |
  
  |*  4 |     INDEX RANGE SCAN          | I_TEST_SORT_1 |    10 |       |     3
  (0)| 00:00:01 |
  
  --------------------------------------------------------------------------------
  ---------------
  
  
  Predicate Information (identified by operation id):
  ---------------------------------------------------
  
     1 - filter(ROWNUM<11)
     4 - access(SUBSTR("NAME",0,3)='sel')
         filter(SUBSTR("NAME",0,3)='sel')
  
  
  Statistics
  ----------------------------------------------------------
            1  recursive calls
            0  db block gets
           11  consistent gets
            0  physical reads
            0  redo size
          695  bytes sent via SQL*Net to client
          400  bytes received via SQL*Net from client
            2  SQL*Net roundtrips to/from client
            0  sorts (memory)
            0  sorts (disk)
           10  rows processed

  Jinyu wrote:
  Hi, I think that this may be an optimizer bug 10g or flaw optimizer 10 g, although substr (name, 0, 3) = 'salt' is not selective, but oracle can also use indexes to find the top 10 by object_name result order

  Jinyu,

  Indeed, it seems to be a gap in the mode of optimization 10.2 FIRST_ROWS_n. I could reproduce your problem in 10.2.0.4 and watching the 10053 trace, it looks like that the optimizer does not consider the option "Recost for ORDER (with the HELP of indexes)" where you have a composite index based function. It does when using a 'normal' composite index, and it does - as you mentioned - when using the main column in the ORDER BY expression as well. You don't need to use INDEX indicator in this case, moreover, the recosting for ORDER BY then works very well and chooses the index without specified indicators.

  11 g the "recalculate for ORDER BY" appears again in the first place it looks like an obvious limitation / bug of 10.2.0.3/4 at least.

  Kind regards
  Randolf

  Oracle related blog stuff:
  http://Oracle-Randolf.blogspot.com/

  SQLTools ++ for Oracle (Open source Oracle GUI for Windows):
  http://www.sqltools-plusplus.org:7676 /.
  http://sourceforge.NET/projects/SQLT-pp/

• is there a sort order global for all folders?

  I have a lot of mail files, and I want them all to sort of the same way. However I can't find a way to set the sort order in the world, only individually per-folder. Is there a global sort order?

  Are you familiar with the configuration of Thunderbird Editor?
  
  If you change the wrong setting, or the incorrect value, you can make unusable Thunderbird, but if you're very careful...

  Read this article...

  http://superuser.com/questions/13518/change-the-default-sorting-order-in-Thunderbird

  TB - 38, 3 Win10-PC

• How can I change the sort order in the finder / media / photos?

  When I want to open a photo in an application I can access photos via the media / photos. The sort order is ascending. I want that the descending sort order. Where can I do this? Thanks for the reply! Christian

  You can click right in the grid of thumbnails and choose to display it as a list. You can then sort the columns by clicking on them.

  I don't know of a way to get to another level by default.

• Sort order for the Album to the artist / year

  How does Itunes sorting Option "Album of the artist / year"work? "

  I expect year wise Albums are sorted. But some of the Albums are not sorted in the year.

  If two or more albums were released in the same year by the same artist, they are sorted in alphabetical order. Note also that iTunes can produce unexpected results if you select a descending sort order.

  TT2

• What is the sort order used Finder?

  I did a little research on this issue and found that (unless I'm missing something), the sort order of the Finder is not what it is supposed to be.

  The only requirement that I found is this note archived tech how Finder lists items that are sorted by name (Mac OS X) from 2012.

  In fact, almost everything what he described how Finder behaves, with the exception of the note at the bottom:

  Technically speaking, the Finder sort is based on the Unicode snack Algorithm, defined by the Unicode Consortium. This standard provides an order for all characters in Unicode sorting complete and unambiguous

  And that complicates matters, since (for example) the underscore character (officially called "bass line"), which sorts upwards and so before all alphanumeric value Unicode of U005F, which lies between the uppercase and lowercase Latin letters: 'Z' is U005A and 'a' corresponds to U0061.

  The reason I ask is because I would like to find a character that sorts after all Latin characters.  Many sort to before, including < space >, stress / < low line > and (my favorite for folders) < pointing right angle double quote > (i.e. "'").

  If it was really sort by Unicode, then it would be simple to use the selector of characters to insert a Unicode character value, such as U25B9, which is "▹.  "But we sort after space <>, < low line >, and" ' ", but before all Latin characters.

  I found an abstract character who works here for this, but I am helpless about the why.  U1400 is the Unicode section called "Unified Canadian Aboriginal syllable", and U1433, the "Canadian syllable Po", is a character who appears in the Finder as a very big plus of symbol: "ᐳ." (More than the symbol is ' > ' for comparison.)

  Yes WHY?

  Why think the Finder that's good (partial) order:

  U0020 "" (space)

  U005F '_' (bass line) < underscore >

  "U00BB '" ' (pointing to the right angle double quote)

  U005C "------" (Reverse Solidus) < backslash >

  U25B7 "▷" (white triangle pointing to the right)

  U0041 "A".

  U007A 'z '.

  U1433 "ᐳ" (Canadian syllable Po)

  

  Note: I see that note technical I linked to refers to the "Unicode snack Algorithm", which could indicate the answer somewhere in its depths.  If this is the case, then I guess this raises the question of why the Unicode coalition choose such an unexpected algorithm.

  Your "Note" has the answer.  Sorting of Unicode is not determined by the values of code as such point, it is determined by the algorithm.  This can be quite complex, but I think an easy way of having things to sort after Latin is to use a Greek character as µ (m option).

  http://Unicode.org/charts/collation/

• iCloud SORT ORDER album.

  How to preserve "sorting" of a photo album, when I make a shared album iCloud?  All my work sort of creatively, is lost when the online album sharing.  Maybe I should use DropBox instead?

  Thank you.

  Rog Mason

  A shared album is essentially still a shared photo stream, even if Apple has changed the name of 'shared Album.

  If you want to have a shared album sorted in a specific order, you add photos to the album individually.  Thea bum will always be sorted at the time wherever you add photos. If you share photos in an album at the same time, the sort order of your album will be lost. Add photos to the album one at a time, in exactly the order you want.

• How to change the sort order of the items sought for the last element of this research first. I DON'T want to say the order search engines, but the existing research by arrow down

  I want to be able to change the sort order of the items, I already looked in the search box. I want to be able to hit the arrow key down and see my previous searches in order of last search showing the first. For the moment, I don't know how it is sorting and it is very annoying to have to re - enter a query that I typed 5 minutes earlier, but because I typed in another 10 since it's lost somewhere in the list. Is it possible, I Googled, but did not find the topic anywhere. Just to clarify, I DON'T mean of the order of the search engines (which is what appears in google), I mean that the text typed into which has been registered in the drop-down list.

  Thank you

  'Form filling' uses a "frecency" algorithm, frequency + recency, similar to the list of AutoComplete address bar.

  I found an extension that seems relevant, but critics are old, so I'm not sure it's still working: Searchbar Autocomplete Order.

  But... is the AutoComplete does not? I expect that typing a few characters of the previous query would be to filter the list so that you can easily select? Or is the problem that the list does not remember quite who looking for?

• How can I change the sort order of the emails?

  iPhone SE 64 GB iOS 9.3.1

  When I opened my mailbox (Mail-> all inboxes) mail is currently sorted from most recent email on top, then retreating.
  How can I correct the sort order so that the oldest email is on top then go ahead?

  You have not, not in the stock email app.  Perhaps a 3rd party app offers this, but not the stock iOS app.

• Sort order of the shared album

  How can I change the sort order of a shared album so that pictures are classified by the date instead of the date downloaded?

  I went into the menu "View > sort > ' but the only option is 'Keep sorted from oldest date added.

  You can not - shared albums are in the order of adding the photos

  You can request additional options - http://www.apple.com/feedback/photos.html

  LN

• How can I change the sort order in the Photos?

  How can I change the sort order in the Photos? I would like to have more recent photos at the top of the screen instead of at the bottom.

  The view of Photos with moments and collections will be sorted always growing by date, also the album «All the Photos»

  But you can sort any other album descending by date.  Create your own album custom as smart album 'My Pictures' and the descending sort.

  File > new Smart Album

  and use the rules:

  

  CTRL-click the smart album in the sidebar and in this way it as you want:

  

  These sorting options available in Photos on MacOS X 10.11. El Capitan, but not in Yosemite.

• Sort order of dates

  With the latest updates for VISTA 64 Home Premium, Service Pack 1, when I try to sort the files in chronological order, it sorts by month (1-12), then day (1-31), THEN year, so that on 01-02-08 shows as more recent than 01/01/09 and 01/03/09 is less recent of the foregoing. Y at - it a patch or fix? It is majorly annoying.  As far as I know, I have all the current patches and updates. Sort order must be the YEAR, MONTH, DAY, even if the screen is in the format DAY, MONTH, YEAR.  Help, please.

  M.Nelder

  Hello M.Nelder,

  If you have your order of sorting by type it will sort the date depending on the file first, then by Date.

  When you try to sort by modified Date, try this:

  Mouse over the modified Date header in order to see the menu drop down.

  Select the drop-down arrow, and then select group.

  You should now see all group by time period regardless of the type of file.

• How to stop a file from the application of a sort order on the files

  Under Win XP, how can I have a folder of photos in my pictures are in the order that I copied them in Windows instead trying to sort by a file attribute, as the name.  Whenever I get close and reopen a file, Windows has sorted them rather than leaving them in the order I have left.  I want to see my photos in a defined order, without having to rename all the files.  If Windows MUST sort the files somehow, it is an attribute of file to apply a number of sequential file or another technique?

  You can simply give up using windows Explorer, but use instead something more advanced like windows photo gallery.

   

  also, here is some info on the Organization of photos:

   

  http://www.geneabloggers.com/metadata-tags-photos-Windows-XP/

   

  
  --
  db·´¯`·...¸><)))º>

  .

  "MMD32" wrote in message news: eb10c966-74(d) 6-4e1c-acfb-73c16d37855d...

  This is useful, but it would be great if it was possible to have windows to keep the single file and not resorted to ALL files.  No there is no way to do this?

  I am often merge sets of images and achieve only look one that certain images should go in a different order, that I copied them originally.  Maybe it's a way of to the point that the file is finalized, I could reset the Date of creation or the other attribute so that the suggestion of DatabaseBen would continue to operate?  I know there is a way to change the attribute Date of creation for all the same value, but then it would not be a way to sort on it at all, if the attribute was similarly?  I tried to assign the sorting order to an empty attribute, hoping that Windows would not use a second attribute for sorting, but it seemed to return filename for alphabetical sorting.

  Thanks for any advice on this puzzle!

  DB·´¯'·.. ¸ >-))) º > ·´¯'·.. ¸ >-))) º > share nirvana mann