I think i have a somewhat simple problem but due to my lack of experience in DB modelling and SQL i'm unable to get the right solution, i can draw the basic concept but i'm having a hard time to implement a solution
Let's say i have some sets A,B and C.
A is inside B
B is inside C
A is the set of the 10 objects with greatest value inside B set
B is the set of all values greater than 100
C is the set of all values greater than 50
that's the easy part,
Now i need to get 50 objects with the greatst value from C that are not inside A How would i translate that problem to the SQL language, or what commands, tools or design patterns should i use to solve this problem?
I'm not sure if I was clear enough, again sorry if the problem is too trivial for some, but i'm trying to learn more about SQL and designs.
I'm looking for a general solution that it's not bound by a framework or OS
Thanks for any help