MySql order by specific ID values - mysql
Is it possible to sort in MySQL by "order by" using a predefined set of column values (ID) like order by (ID=1,5,4,3) so I would get records 1, 5, 4, 3 in that order out?
UPDATE: Why I need this...
I want my records to change sort randomly every 5 minutes. I have a cron task to update the table to put different, random sort order in it.
There is just one problem! PAGINATION.
I will have visitors who come to my page, and I will give them the first 20 results. They will wait 6 minutes, go to page 2 and have the wrong results as the sort order has already changed.
So I thought that if I put all the IDs into a session on page 2, we get the correct records even if the sorting had already changed.
Is there any other better way to do this?
You can use ORDER BY and FIELD function.
See http://lists.mysql.com/mysql/209784
SELECT * FROM table ORDER BY FIELD(ID,1,5,4,3)
It uses Field() function, Which "Returns the index (position) of str in the str1, str2, str3, ... list. Returns 0 if str is not found" according to the documentation. So actually you sort the result set by the return value of this function which is the index of the field value in the given set.
You should be able to use CASE for this:
ORDER BY CASE id
WHEN 1 THEN 1
WHEN 5 THEN 2
WHEN 4 THEN 3
WHEN 3 THEN 4
ELSE 5
END
On the official documentation for mysql about ORDER BY, someone has posted that you can use FIELD for this matter, like this:
SELECT * FROM table ORDER BY FIELD(id,1,5,4,3)
This is untested code that in theory should work.
SELECT * FROM table ORDER BY id='8' DESC, id='5' DESC, id='4' DESC, id='3' DESC
If I had 10 registries for example, this way the ID 1, 5, 4 and 3 will appears first, the others registries will appears next.
Normal exibition
1
2
3
4
5
6
7
8
9
10
With this way
8
5
4
3
1
2
6
7
9
10
There's another way to solve this. Add a separate table, something like this:
CREATE TABLE `new_order` (
`my_order` BIGINT(20) UNSIGNED NOT NULL,
`my_number` BIGINT(20) NOT NULL,
PRIMARY KEY (`my_order`),
UNIQUE KEY `my_number` (`my_number`)
) ENGINE=INNODB;
This table will now be used to define your own order mechanism.
Add your values in there:
my_order | my_number
---------+----------
1 | 1
2 | 5
3 | 4
4 | 3
...and then modify your SQL statement while joining this new table.
SELECT *
FROM your_table AS T1
INNER JOIN new_order AS T2 on T1.id = T2.my_number
WHERE ....whatever...
ORDER BY T2.my_order;
This solution is slightly more complex than other solutions, but using this you don't have to change your SELECT-statement whenever your order criteriums change - just change the data in the order table.
If you need to order a single id first in the result, use the id.
select id,name
from products
order by case when id=5 then -1 else id end
If you need to start with a sequence of multiple ids, specify a collection, similar to what you would use with an IN statement.
select id,name
from products
order by case when id in (30,20,10) then -1 else id end,id
If you want to order a single id last in the result, use the order by the case. (Eg: you want "other" option in last and all city list show in alphabetical order.)
select id,city
from city
order by case
when id = 2 then city else -1
end, city ASC
If i had 5 city for example, i want to show the city in alphabetical order with "other" option display last in the dropdown then we can use this query.
see example other are showing in my table at second id(id:2) so i am using "when id = 2" in above query.
record in DB table:
Bangalore - id:1
Other - id:2
Mumbai - id:3
Pune - id:4
Ambala - id:5
my output:
Ambala
Bangalore
Mumbai
Pune
Other
SELECT * FROM TABLE ORDER BY (columnname,1,2) ASC OR DESC
Related
select records in given ids sorting order
i have table lets say - Students, with 5 records and id(s) are 1 to 5, now i want to select the records - in a way that result should come like given sorting order of id column id column should be resulted - 5,2,1,3,4 is there any other way to do this - then separate db calls for ids? single db call ?
I guess if you really want a hard-coded order, you could do something like this: order by case id when 5 then 0 when 2 then 1 when 1 then 2 when 3 then 3 when 4 then 4 else 999 end Or more simply (as #Strawberry points out in the comments): order BY FIELD(id,4,3,1,2,5) desc
Complicated joining on multiple id's
I have a table like this id | user_id | code | type | time ----------------------------------- 2 2 fdsa r 1358300000 3 2 barf r 1358311000 4 2 yack r 1358311220 5 3 surf r 1358311000 6 3 yooo r 1358300000 7 4 poot r 1358311220 I want to get the concatenated 'code' column for user 2 and user 3 for each matching time. I want to receive a result set like this: code | time ------------------------------- fdsayooo 1358300000 barfsurf 1358311000 Please note that there is no yackpoot code because the query was not looking for user 4.
You can use GROUP_CONCAT function. Try this: SELECT GROUP_CONCAT(code SEPARATOR '') code, time FROM tbl WHERE user_id in (2, 3) GROUP BY time HAVING COUNT(time) = 2; SQL FIDDLE DEMO
What you are looking for is GROUP_CONCAT, but you are missing a lot of details in your question to provide a good example. This should get you started: SELECT GROUP_CONCAT(code), time FROM myTable WHERE user_id in (2, 3) GROUP BY time; Missing details are: Is there an order required? Not sure how ordering would be done useing grouping, would need to test if critical Need other fields? If so you will likely end up needing to do a sub-select or secondary query. Do you only want results with multiple times? Do you really want no separator between values in the results column (specify the delimiter with SEPARATOR '' in the GROUP_CONCAT Notes: You can add more fields to the GROUP BY if you want to do it by something else (like user_id and time).
Is MySQL's `ORDER BY` distinct on multisets?
Assuming a table with a column where integers are stored. ----------------------------- id | some_int | some_other_value ----------------------------- 1 5 hello 2 9 how 3 987 are 4 5 you 5 9 thanks 6 1 for 7 5 answering. :-) Is SELECT * FROM mytable ORDER BY some_int; distinct? Meaning will it always return the rows in the same order, after each query?
To the best of my knowledge if there are duplicates in the order by clause, there is no guarantee for the order in which the duplicates are presented. If this is a concern, you could modify the order by to include the primary key (id I am assuming). ORDER BY some_int, id Since id is a primary key, it should also be indexed. Thus the performance difference will be minimal.
Doing this order by does not always have to give you the same result order. It is not frequent that the order will be different but it's not a 100% safe to assume that the order will always be the same as it is not an unique value that you're ordering by. To achieve this you should also include the primary key after the initial order. SELECT * FROM mytable ORDER BY some_int, id
Use this: SELECT * FROM mytable ORDER BY some_int,id; So it will sort for 'some_int' and then using 'id' Duplicates for 'some_id' will be set to fixed position using 'id' column
specific ordering in mysql
I have a sql statement that brings back ids. Currently I am ordering the id's with the usual "ORDER BY id". What I need to be able to do is have the query order the first 3 rows by specific id's that I set. The order the remaining as it is currently. For example, I want to say the first 3 rows will be id's 7,10,3 in that order, then the rest of the rows will be ordered by the id as usual. right now i just have a basic sql statement... SELECT * from cards ORDER BY card_id
SELECT * FROM cards ORDER BY CASE card_id WHEN 7 THEN 1 WHEN 10 THEN 2 WHEN 3 THEN 3 ELSE 4 END, card_id
A bit shorter than Quassnoi's query, with FIELD : -- ... ORDER BY FIELD(card_id, 3, 10, 7) DESC You have to invert the order because of the DESC, I didn't find a way to do it more naturally.
Returning query results in predefined order
Is it possible to do a SELECT statement with a predetermined order, ie. selecting IDs 7,2,5,9 and 8 and returning them in that order, based on nothing more than the ID field? Both these statements return them in the same order: SELECT id FROM table WHERE id in (7,2,5,9,8) SELECT id FROM table WHERE id in (8,2,5,9,7)
I didn't think this was possible, but found a blog entry here that seems to do the type of thing you're after: SELECT id FROM table WHERE id in (7,2,5,9,8) ORDER BY FIND_IN_SET(id,"7,2,5,9,8"); will give different results to SELECT id FROM table WHERE id in (7,2,5,9,8) ORDER BY FIND_IN_SET(id,"8,2,5,9,7"); FIND_IN_SET returns the position of id in the second argument given to it, so for the first case above, id of 7 is at position 1 in the set, 2 at 2 and so on - mysql internally works out something like id | FIND_IN_SET ---|----------- 7 | 1 2 | 2 5 | 3 then orders by the results of FIND_IN_SET.
Your best bet is: ORDER BY FIELD(ID,7,2,4,5,8) ...but it's still ugly.
Could you include a case expression that maps your IDs 7,2,5,... to the ordinals 1,2,3,... and then order by that expression?
All ordering is done by the ORDER BY keywords, you can only however sort ascending and descending. If you are using a language such as PHP you can then sort them accordingly using some code but I do not believe it is possible with MySQL alone.
This works in Oracle. Can you do something similar in MySql? SELECT ID_FIELD FROM SOME_TABLE WHERE ID_FIELD IN(11,10,14,12,13) ORDER BY CASE WHEN ID_FIELD = 11 THEN 0 WHEN ID_FIELD = 10 THEN 1 WHEN ID_FIELD = 14 THEN 2 WHEN ID_FIELD = 12 THEN 3 WHEN ID_FIELD = 13 THEN 4 END
You may need to create a temp table with an autonumber field and insert into it in the desired order. Then sort on the new autonumber field.
Erm, not really. Closest you can get is probably: SELECT * FROM table WHERE id IN (3, 2, 1, 4) ORDER BY id=4, id=1, id=2, id=3 But you probably don't want that :) It's hard to give you any more specific advice without more information about what's in the tables.
It's hacky (and probably slow), but you can get the effect with UNION ALL: SELECT id FROM table WHERE id = 7 UNION ALL SELECT id FROM table WHERE id = 2 UNION ALL SELECT id FROM table WHERE id = 5 UNION ALL SELECT id FROM table WHERE id = 9 UNION ALL SELECT id FROM table WHERE id = 8; Edit: Other people mentioned the find_in_set function which is documented here.
You get answers fast around here, don't you… The reason I'm asking this is that it's the only way I can think of to avoid sorting a complex multidimensional array. I'm not saying it would be difficult to sort, but if there were a simpler way to do it with straight sql, then why not.
One Oracle solution is: SELECT id FROM table WHERE id in (7,2,5,9,8) ORDER BY DECODE(id,7,1,2,2,5,3,9,4,8,5,6); This assigns an order number to each ID. Works OK for a small set of values.
Best I can think of is adding a second Column orderColumn: 7 1 2 2 5 3 9 4 8 5 And then just do a ORDER BY orderColumn