how to fetch user name with user ID?
Suppose I have 3 tables like this and user.type holds 'e' for employer and 'w' for worker.
'e' says that user name is on employer.name and so 'w' says that user name is in worker.name.
employer.id and worker.id are foreign key of user.id.
Is there any way to get user name while having user id (we don't know type yet) with a single query?
Although if there's a problem with this kind of modeling let me know.
To answer your question directly,
SELECT a.*,
IF(a.type = 'e', b.Name, c.Name) PersonName
FROM User a
LEFT JOIN Employer b
ON a.ID = b.ID
LEFT JOIN Worker c
ON a.ID = c.ID
Actually, you can redesign the schema and needing only two tables, the Person and Type
Type
ID (PK)
TypeName
Person
ID (PK)
Name
UserTypeID (FK)
and you can easily get the type for every person,
SELECT a.*,
b.TypeName
FROM Person a
INNER JOIN Type b
ON a.UserTypeID = b.ID
To further gain more knowledge about joins, kindly visit the link below:
Visual Representation of SQL Joins
SAMPLE RECORDS
TYPE
╔════╦══════════╗
║ ID ║ TYPENAME ║
╠════╬══════════╣
║ 1 ║ Employee ║
║ 2 ║ Worker ║
╚════╩══════════╝
PERSON
╔════╦═════════╦════════════╗
║ ID ║ NAME ║ USERTYPEID ║
╠════╬═════════╬════════════╣
║ 1 ║ Stacky ║ 2 ║
║ 2 ║ Horton ║ 1 ║
║ 3 ║ Alam Na ║ 1 ║
║ 4 ║ Aw aw ║ 2 ║
╚════╩═════════╩════════════╝
OUTPUT AFTER THE QUERY HAS BEEN EXECUTED
╔════╦═════════╦════════════╦══════════╗
║ ID ║ NAME ║ USERTYPEID ║ TYPENAME ║
╠════╬═════════╬════════════╬══════════╣
║ 1 ║ Stacky ║ 2 ║ Worker ║
║ 2 ║ Horton ║ 1 ║ Employee ║
║ 3 ║ Alam Na ║ 1 ║ Employee ║
║ 4 ║ Aw aw ║ 2 ║ Worker ║
╚════╩═════════╩════════════╩══════════╝
Related
So here's basically the issue (I'm turning this into more of a universal question in case people need something like this in the future).
I have one table ("People") that is basically this
╔══════════╦═══════╗
║ PersonID ║ Letter║
╠══════════╬═══════╣
║ 1 ║ A ║
║ 1 ║ B ║
║ 1 ║ C ║
║ 1 ║ D ║
║ 2 ║ A ║
║ 2 ║ B ║
║ 2 ║ C ║
║ 3 ║ B ║
║ 3 ║ C ║
║ 4 ║ A ║
║ 4 ║ C ║
║ 4 ║ D ║
║ 5 ║ E ║
╚══════════╩═══════╝
And lets say I have another table ("Letters") which can lists all possible "Letters" a person can have.
╔══════════╦══════╗
║ LetterID ║ Text ║
╠══════════╬══════╣
║ 1 ║ A ║
║ 2 ║ B ║
║ 3 ║ C ║
║ 4 ║ D ║
║ 5 ║ E ║
╚══════════╩══════╝
I need to make a new table that will have all persons listed and letters that they DONT have. So for this example, the result would be this
╔══════════╦══════════════╗
║ PersonID ║ LetterNotHad ║
╠══════════╬══════════════╣
║ 1 ║ E ║
║ 2 ║ D ║
║ 2 ║ E ║
║ 3 ║ A ║
║ 3 ║ D ║
║ 3 ║ E ║
║ 4 ║ B ║
║ 4 ║ E ║
║ 5 ║ A ║
║ 5 ║ B ║
║ 5 ║ C ║
║ 5 ║ D ║
╚══════════╩══════════════╝
Any and all help or guidance is greatly appreciated.
Edit: Here's basically what I was trying, something like this
select p.PersonId, l.value
from letters l
left join people p
on l.Text = p.Letter
where p.personid is null
Here is the idea
WITH cte
AS (SELECT *
FROM (SELECT DISTINCT personid
FROM people) B
CROSS JOIN (SELECT DISTINCT Text as letter
FROM letters) A)
SELECT *
FROM cte c
WHERE NOT EXISTS (SELECT 1
FROM first_table f
WHERE c.personid = f.personid
AND c.letter = f.letter)
Note: You need to use letterid in People table instead of Letter and define a foreign key which make the table's consistent
So what you want to do in order to find the missing values is to generate the set that represents all possible values. This is the cartesian product between the two sets (people and letters) and in SQL you use the cross join operator (or unqualified join) to do this.
From this set you want to remove the combinations you already have, and the remainder will be the missing ones.
There are many ways to do this; using a left join it could look like this:
select sub.*
from (
select distinct personid, text
from people
cross join letters
) sub
left join people p on p.letter = sub.text and p.personid = sub.personid
where p.personid is null
Or using the except set operator (for MSSQL (minus in Oracle) - MySQL does not have this):
select personid, text from people cross join letters
except
select personid, letter from people
I've inherited a database that includes a lookup table to find other patents that are related to a given patent.
So it looks like
╔════╦═══════════╦════════════╗
║ id ║ patent_id ║ related_id ║
╠════╬═══════════╬════════════╣
║ 1 ║ 1 ║ 2 ║
║ 2 ║ 1 ║ 3 ║
║ 3 ║ 2 ║ 1 ║
║ 4 ║ 2 ║ 3 ║
║ 5 ║ 3 ║ 2 ║
╚════╩═══════════╩════════════╝
And I want to filter out the reciprocal relationships. 1->2 and 2->1 are the same for my purposes so I only want 1->2.
I don't need to make the edit in the table, I just need a query the returns a list of the unique relationships, and while I'm sure it's simple I've been banging my head against the keyboard for far too long.
Here is a clever query which you can try using. The general strategy is to identify the unwanted duplicate records and then subtract them away from the entire set.
SELECT t.id, t.patent_id, t.related_id
FROM t LEFT JOIN
(
SELECT t1.patent_id AS t1_patent_id, t1.related_id AS t1_related_id
FROM t t1 LEFT JOIN t t2
ON t1.related_id = t2.patent_id
WHERE t1.patent_id = t2.related_id AND t1.patent_id > t1.related_id
) t3
ON t.patent_id = t3.t1_patent_id AND t.related_id = t3.t1_related_id
WHERE t3.t1_patent_id IS NULL
Here is the inner temporary table generated by this query. You can convince yourself that by applying the logic in the WHERE clause you will select the correct records. Non-duplicate records are characterized by t1.patent_id != t2.related_id, and all these records are retained. In the case of duplicates (t1.patent_id = t2.related_id), the record chosen from each pair of duplicates is the one where patent_id < related_id, as you requested in your question.
╔════╦══════════════╦═══════════════╦══════════════╦═══════════════╗
║ id ║ t1.patent_id ║ t1.related_id ║ t2.patent_id ║ t2.related_id ║
╠════╬══════════════╬═══════════════╬══════════════╬═══════════════╣
║ 1 ║ 1 ║ 2 ║ 2 ║ 1 ║ * duplicate
║ 1 ║ 1 ║ 2 ║ 2 ║ 3 ║
║ 2 ║ 1 ║ 3 ║ 3 ║ 2 ║
║ 3 ║ 2 ║ 1 ║ 1 ║ 2 ║ * duplicate
║ 3 ║ 2 ║ 1 ║ 1 ║ 3 ║
║ 4 ║ 2 ║ 3 ║ 3 ║ 2 ║ * duplicate
║ 5 ║ 3 ║ 2 ║ 2 ║ 1 ║
║ 5 ║ 3 ║ 2 ║ 2 ║ 3 ║ * duplicate
╚════╩══════════════╩═══════════════╩══════════════╩═══════════════╝
Click the link below for a running example of this query.
SQLFiddle
Try something like
select distinct * from
(select patient_id, related_id from TABLENAME
union
select related_id, patient_id from TABLENAME
);
Okay you're right the above won't work. Try
select patient_id, related_id from TABLENAME p1
where p1.patiend_id not in
(select patient_id from TABLENAME p2
where p2.related_id = p1.related_id)
I'd like to merge rows based on multiple criteria, essentially removing duplicates where I get to define what "duplicate" means. Here is an example table:
╔═════╦═══════╦═════╦═══════╗
║ id* ║ name ║ age ║ grade ║
╠═════╬═══════╬═════╬═══════╣
║ 1 ║ John ║ 11 ║ 5 ║
║ 2 ║ John ║ 11 ║ 5 ║
║ 3 ║ John ║ 11 ║ 6 ║
║ 4 ║ Sam ║ 14 ║ 7 ║
║ 5 ║ Sam ║ 14 ║ 7 ║
╚═════╩═══════╩═════╩═══════╝
In my example, let's say I want to merge on name and age but ignore grade. The result should be:
╔═════╦═══════╦═════╦═══════╗
║ id* ║ name ║ age ║ grade ║
╠═════╬═══════╬═════╬═══════╣
║ 1 ║ John ║ 11 ║ 5 ║
║ 3 ║ John ║ 11 ║ 6 ║
║ 4 ║ Sam ║ 14 ║ 7 ║
╚═════╩═══════╩═════╩═══════╝
I don't particularly care if the id column is updated to be incremental, but I suppose that would be nice.
Can I do this in MySQL?
My suggestion, based on my above comment.
SELECT distinct name, age, grade
into tempTable
from theTable
This will ignore the IDs and give you only a distinct dump, and into a new table.
Then you can either drop the old and, and rename the new one. Or truncate the old one, and dump this back in.
You could just delete the duplicates in place like this:
delete test
from test
inner join (
select name, age, grade, min(id) as minid, count(*)
from test
group by name, age, grade
having count(*) > 1
) main on test.id = main.minid;
Example: http://sqlfiddle.com/#!9/f1a38/1
My head is turning to mush when trying to get this nesting around my head.
So basically I got 2 tables:
Brokers, which is my "user" table:
╔══════════╦════════════╦
║ ID ║ EMAIL ║
╠══════════╬════════════╬
║ 1 ║ 1#email.co ║
║ 2 ║ 2#email.co ║
║ 3 ║ 3#email.co ║
╚══════════╩════════════╝
Houses, which is houses that the users have added. Currently user and house is connected by the email column (I know, makes more sense to do with a ID):
╔══════════╦════════════╦════════════╦
║ ID ║ TYPE ║ EMAIL ║
╠══════════╬════════════╬════════════╬
║ 1 ║ 1 ║ 1#email.co ║
║ 2 ║ 3 ║ 1#email.co ║
║ 3 ║ 2 ║ 1#email.co ║
║ 4 ║ 3 ║ 1#email.co ║
║ 5 ║ 3 ║ 1#email.co ║
║ 6 ║ 2 ║ 1#email.co ║
║ 7 ║ 3 ║ 1#email.co ║
║ 8 ║ 1 ║ 2#email.co ║
║ 9 ║ 1 ║ 2#email.co ║
║ 10 ║ 2 ║ 2#email.co ║
║ 11 ║ 2 ║ 2#email.co ║
║ 12 ║ 3 ║ 2#email.co ║
║ 13 ║ 3 ║ 3#email.co ║
║ 14 ║ 2 ║ 3#email.co ║
║ 15 ║ 3 ║ 3#email.co ║
║ 16 ║ 1 ║ 3#email.co ║
║ 17 ║ 3 ║ 3#email.co ║
║ 18 ║ 2 ║ 3#email.co ║
║ 19 ║ 2 ║ 3#email.co ║
║ 20 ║ 3 ║ 3#email.co ║
╚══════════╩════════════╩════════════╝
Now what I want to do, is that I want to select all brokers that have type 3 as the highest, most popular kind of house added. So for example if house type 3 represents "Apartments", I want to find the brokers that sell apartments as their number one most popular type.
My current query is:
SELECT b.id, b.email, h.email, h.type, h.total
FROM brokers b
INNER JOIN (
SELECT COUNT( * ) AS total, email, type
FROM house
GROUP BY email, type
ORDER BY total DESC
)h ON b.email = h.email
AND h.type = "3"
ORDER BY b.id DESC
Now this only selects the total amount of houses that that broker has for type 3. It does not only select the brokers where type 3 is their most popular type.
Now to do that, I need to use what is called "Groupwise Max". But I can not use max() on a count(*) like:
MAX(COUNT(*)) as max_value
So I guess that what I need to do is to nest my query further with additional subqueries to first count, and then select the max value.
I've been trying to get it right for a while now and I just can't get my head around it. Anyone can help?
EDIT:
Expected Output:
Based on the table above, Broker 1#email.co got:
1 House with Type 1.
2 Houses with Type 2.
4 Houses with Type 3.
Broker 2#email.co got:
2 houses with Type 1
2 houses with Type 2
1 house with Type 3.
Broker 3#email.co got:
1 house with Type 1.
3 houses with Type 2.
4 houses with Type 3.
Since both 1#email.co and 3#email.co is selling House Type 3 most commonly, they should be included in the output. 2#email.co do not sell type 3 as his most popular type, so he should not be included in the result.
So output:
╔══════════╦════════════╦════════════╦
║ ID ║ EMAIL ║ Total ║
╠══════════╬════════════╬════════════╬
║ 1 ║ 1#email.co ║ 4 ║
║ 3 ║ 3#email.co ║ 4 ║
╚══════════╩════════════╝════════════╝
Posting answer without executing, hope this works!
Select a.ID,a.Email,b.Cnt from Brokers as a
inner join (
Select Email,count(ID) as Cnt from Houses where Type =
(Select max(Type) from Houses)
group by Email
) as b on a.Email = b.Email
I can't understand why you need Count()? I think, according to you question ("select all brokers that have type 3") , it doesn't make sense, or do I misunderstand something?
EDIT:
I have done it in SQL SERVER by temporary table and variable
If you can convert it to mysql syntax, your problem will we solved:
SELECT COUNT(*) as total, Email, [Type]
into #tbl3
from house
group by Email, Type
declare #a int
set #a = (select MAX(total) from #tbl3)
SELECT b.id, b.email, h.email, h.type, h.total
FROM brokers b
inner join
(
select * from #tbl3
where total=#a
) h
on h.Email=b.Email and h.Type=3
EDIT: This is MySql syntax which will do your job.
CREATE TEMPORARY TABLE IF NOT EXISTS table2 AS (
SELECT COUNT(*) as total, Email, Type
from house
group by Email, Type
);
set #a = (select MAX(total) from table2);
SELECT b.id, b.email, h.email, h.type, h.total
FROM brokers b
inner join
(
select * from table2
where total=#a
) h
on h.Email=b.Email and h.Type=3
I've got two tables- one with records of stock, the other with translations (for French and German users).
Stock:
╔════╦═══════╦═══════════════════╦═══════════════════════════╗
║ ID ║ PRICE ║ ITEMTRANSLATIONID ║ ITEMCATEGORYTRANSLATIONID ║
╠════╬═══════╬═══════════════════╬═══════════════════════════╣
║ 1 ║ 10 ║ 423 ║ 1323 ║
║ 2 ║ 31 ║ 1776 ║ 1953 ║
╚════╩═══════╩═══════════════════╩═══════════════════════════╝
Translations:
╔══════╦═══════════╦════════════╦═════════╗
║ ID ║ ENGLISH ║ FRENCH ║ GERMAN ║
╠══════╬═══════════╬════════════╬═════════╣
║ 1 ║ knife ║ couteau ║ messer ║
║ 2 ║ fork ║ fourchette ║ gabel ║
║ 423 ║ spoon ║ cuillère ║ löffel ║
║ 1323 ║ cultery ║ couverts ║ besteck ║
║ 1776 ║ table ║ table ║ tabelle ║
║ 1953 ║ furniture ║ meubles ║ möbel ║
╚══════╩═══════════╩════════════╩═════════╝
Is there a way to write an SQL query to get prices and translated names for each stock item? I will only ever need one language at once.
If only one column needed translating, I could just use an INNER JOIN. The trouble is, there are two columns that need translating- one for the item name, the other for the item category name.
i.e.
Required Output (French)
╔════╦═══════╦══════════╦══════════════╗
║ ID ║ PRICE ║ ITEM ║ ITEMCATEGORY ║
╠════╬═══════╬══════════╬══════════════╣
║ 1 ║ 10 ║ cuillère ║ couverts ║
║ 2 ║ 31 ║ table ║ meubles ║
╚════╩═══════╩══════════╩══════════════╝
join table Translations twice on table Stock so you could get the values for each columns in table Stock
SELECT a.ID, a.Price, b.French AS Item, c.French AS ItemCategory
FROM Stock a
INNER JOIN Translations b
ON a.ItemTranslationId = b.ID
INNER JOIN Translations c
ON a.ItemCategoryTranslationId = c.ID
SQLFiddle Demo
With this table structure, you would need to JOIN to the Translations table twice... once to get the Item, and again to get the ItemCategory:
SELECT
s.ID,
s.Price,
i.French AS Item,
ic.French AS ItemCategory
FROM
Stock s
JOIN Translations i ON i.ID = s.ItemTranslationId
JOIN Translations ic ON ic.ID = s.ItemCategoryTranslationId
You can use this query:
SELECT a.ID, a.Price,
(select French from Translations b where b.ID=a.ItemTranslationId) as ITEM,
(select French from Translations c where c.ID=a.ItemCategoryTranslationId) as ITEMCATEGORY
FROM Stock a