I am trying to update materialized path in SQLite3 database with usage of TypeORM. The table for folders (which I am updating) has both parent and parentId columns. When I update parent column, the...

I have this materialized path tree structure built using PostgreSQL's ltree module. id1 id1.id2 id1.id2.id3 id1.id2.id5 id1.id2.id3.id4 ... etc I can of course easily use ltree to get all n...

As you may know there's a module for PostgreSQL called ltree. Also you have the possibility to use the Array type for integers (*1, see comment below), which in this test shows to actually perform ...

I have a tree structure in a table and it uses materialized paths to allow me to find children quickly. However, I also need to sort the results depth-first, as one would expect with threaded forum...

I'm planning on using materialized paths in MongoDB to represent a tree and need to convert the materialized paths back into a JSON tree. ex. // Materialized path var input = [ {"id": "0", "path...

I have a materialized path-driven bulletin board. It is using the following query to get the messages in order, SELECT * FROM Board ORDER by root DESC, path ASC LIMIT 0,100 where root is an id o...

I have a trouble building a tree structure from materialized path using ruby. Assuming I have a sorted result set (from couchdb): [ { :key => [], :value => "Home" }, { :key => ["about"...

I am reading the SQL server 2008 bible and it says the materialized path pattern is significantly faster then the hierarchyid. Is this really true? How can I make the hierarchyid have equal or bett...