Timeline for Organize repeating timestamped values in schema
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2015 at 13:19 | vote | accept | zencodism | ||
| May 2, 2015 at 13:19 | comment | added | zencodism | Now I want to upvote xuma's comment. Thank you for an explanation, it was really simple thing I missed out (brainfart + little experience). | |
| May 2, 2015 at 10:10 | comment | added | xuma202 |
No it won't it's one query with multiple results. In MySQL Syntax: SELECT * FROM main JOIN frames ON frames.mainID = main.id JOIN values ON frames.valueID = values.id WHERE main.id = n Guess that should be it. Nothing special just a join with mutiple results. Also note that other design shemes like Snowflake or Star don't use the no redundancy approach but instead use a lot of tables (joins) for extra speed.
|
|
| May 2, 2015 at 0:40 | comment | added | zencodism | This sounds reasonable for me, waiting a bit before accepting. One more doubt: in this design trying to get full information from main model (+all timestamped stuff) would require one query to main and 30 or so to 'updates' table, followed by 30 or so to 'names' table. Can this really be fast? | |
| Apr 30, 2015 at 10:26 | comment | added | Sir Swears-a-lot | +1. I agree. After writing my answer i reread yours, and I think we're saying the same things for the same reasons. | |
| Apr 29, 2015 at 22:17 | history | answered | xuma202 | CC BY-SA 3.0 |