4 ms·
Chris Date and the Relational Model (2014)
- cmrdporcupine 3y agoLove this interview, thanks for getting it out there for people to see again. As for Date, he is a gem: "Thank you for saying my writing style is “coherent”! But I think I can explain that, too. The truth is, I’m a rather slow learner. As a consequence, I think I can be a good teacher, because I can identify places where students are likely to have trouble." I have learned so much from him.
- SkyMarshal 3y agoGood observation. The ability to understand why someone else doesn't understand something and tailor an explanation that explains it in a way that clicks for them, is a rare and valuable gift among teachers.
- smartmic 3y agoNice. Here are two passages that remind me of "history repeats itself". > Looking back it seems such a simple idea to replace the hierarchical structures used to build databases with tables of rows and columns > First of all, XML structures are fundamentally hierarchic; thus, all of the intrinsic difficulties with hierarchies that we experienced all those years ago-with IBM’s IMS product in particular-are rearing their ugly head again. What I mean: the relational model has replaced existing hierarchical models. Isn't that proof by practice that the underlying mathematical model (set theory, predicate logic) is extraordinarily well suited to cover data structuring and information modeling in computer science. And, yes, hierarchies are also first-class citizens in relational models and can scale beautiful. Even the developments, yes, "hypes" of recent years and decades such as NoSQL or knowledge graphs and graph databases have not fundamentally shaken this, but we are increasingly seeing a return to the proven relational model. Hence "history repeating".
- kristianp 3y agoHowever large scale datastores such as such as firebase have a tree structure to allow for scale-out.
- randomdata 3y ago> Isn't that proof by practice that the underlying mathematical model... Maybe. Maybe not. The only practical example we keep seeing is implementations centred around SQL which, while loosely based on the relational model, notably does not have relations. Without relations – the idea that sits at the very core of the relational model – you don't technically have a relational database (even if we colloquially call it as such). So while, in theory, the relational model should work just as well, practice hasn't attempted to prove that at scale. Not since Postgres was first created has anyone really even tried to implement the relational model, and Postgres soon gave up on the idea and moved to SQL too. It may be that tables are actually better for practical use and that the relational model would fall down flat if we ever gave it a serious go.
- fifilura 3y agoThis comment sounds so insightful, but I don't have the knowledge/insight to understand it! I would love it if you could add some practical example.
- rramadass 3y agoThis comment on another thread links to a succinct presentation of the Relational Model which you might find helpful - https://news.ycombinator.com/item?id=39201972 https://news.ycombinator.com/item?id=39201972 Basically, SQL does not constrain one to a strict mathematical relational model since you can have ordering, duplicates, nulls etc.
- cafard 3y agoPerhaps one should say that SQL "does not enforce relations". One can create systems that enforce uniqueness throughout and avoid nulls. My recollection is that Peoplesoft was one such--it used single spaces where some might have used nulls, and the tables had unique indexes defined on them. But it has been many years since I dealt with it.
- themk 3y agoIf you are interested in D, Project:M36 [0] has an implementation of TutorialD that I found to be fun to play with. [0] https://github.com/agentm/project-m36 https://github.com/agentm/project-m36