tag:blogger.com,1999:blog-2326624813533383062.post6503827713930295808..comments2024-01-29T12:53:16.114+01:00Comments on Developer Blog: Taxonomic Trees in PostgreSQLTim Robertsonhttp://www.blogger.com/profile/07889700598656669041noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-2326624813533383062.post-31309225595222236402017-04-26T10:15:58.984+02:002017-04-26T10:15:58.984+02:00Hi Rukaya. We do still use the adjacency list in t...Hi Rukaya. We do still use the adjacency list in the Postgres Checklist Bank db. It serves our API well and even the modern recursive queries in postgres perform very well.<br />For building a new taxonomy and walking the tree during that "backbone building" we do use a graph database though (neo4j) which is more convenient defining various traversal rulesAnonymoushttps://www.blogger.com/profile/02525336976753861766noreply@blogger.comtag:blogger.com,1999:blog-2326624813533383062.post-74375670967368669712017-04-25T15:37:47.119+02:002017-04-25T15:37:47.119+02:00I'm curious, are GBIF still using adjacency li...I'm curious, are GBIF still using adjacency list for taxonomy? Rukaya Johaadienhttps://www.blogger.com/profile/06034404399525782513noreply@blogger.comtag:blogger.com,1999:blog-2326624813533383062.post-63130166789452078382012-12-08T11:02:10.915+01:002012-12-08T11:02:10.915+01:00Appreciate the info Markus. I was looking for gene...Appreciate the info Markus. I was looking for general ltree VS nested set performance info, so this has been very informative.<br /><br />We'll have about 100,000 cities in regions in countries, all in the same table. As there aren't many countries, a few regions and lots of cities it seems nested set is the way to go?<br /><br />Thanks again for the info.Anonymousnoreply@blogger.com