Re: Recursive Arrays 101

Achilleas Mantzios <achill@xxxxxxxxxxxxxxxxxxxxx> · Wed, 04 Nov 2015 12:03:57 +0200



    Sorry for being kind of late to the
      party (I was in 2015.PgConf.EU !!), and not having read 

      most of the replies, what we have been successfully doing for this
      problem for our app

      is do it this way :

      parents int[] -- where parents stores the path from the node to
      the root of the tree

      and then have those indexes :

      btree (first(parents))

      btree (level(parents)) -- length

      btree (last(parents))

      gin (parents gin__int_ops) -- the most important 

      
      This has been described as "genealogical tree" approach, and works
      very good, IMHO much better

      than nested sets.

      
      On 27/10/2015 14:46, David G. Johnston wrote:

    
    On Monday, October 26, 2015, John R Pierce <pierce@xxxxxxxxxxxx>
      wrote:

      On 10/26/2015
        7:44 PM, David G. Johnston wrote:

        
          They both have their places.  It is usually quite difficult
          to automate and version control the manual work that goes into
          using command line tools.

        
        I hope you mean, its difficult to automate and version control
        clickity-clicky work that goes into using GUI tools

        
        automating shell scripts is trivial.   putting said shell
        scripts into version control is also trivial.

        
      Yes, that is a typo on my part. 
    
    
    -- 
Achilleas Mantzios
IT DEV Lead
IT DEPT
Dynacom Tankers Mgmt