{"provider_url":"https://hatena.blog","blog_title":"BroadaxProof","description":"Additional Columns Conventional database engineers had studied four models for solving the problem to store hierarchical data in a database. They are: Adjacency List Model Path Enumeration Model Nested Set Model Nested Intervals Model Closure Table Model Common thing about each model, is to add some\u2026","width":"100%","version":"1.0","blog_url":"https://steweucen.hatenablog.jp/","height":"190","author_url":"https://blog.hatena.ne.jp/StewEucen/","provider_name":"Hatena Blog","categories":["Fertile Forest","SQL"],"url":"https://steweucen.hatenablog.jp/entry/2015/12/26/222041","type":"rich","published":"2015-12-26 22:20:41","title":"Fertile Forest Model (2/n) Hierarchical Data in a RDB [2]","image_url":null,"author_name":"StewEucen","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fsteweucen.hatenablog.jp%2Fentry%2F2015%2F12%2F26%2F222041\" title=\"Fertile Forest Model (2/n) Hierarchical Data in a RDB [2] - BroadaxProof\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}