On 12/22/18, Sebastian Bank <sebastian.b...@uni-leipzig.de> wrote: > > given a table that represents an adjacency tree, I use a recursive CTE > together with group_concat() to generate the path for each tree item. > > With SQLite up to version 3.25.3 the query below (with the 500 example > items inserted below) takes about 0.2 seconds on my system. With version > 3.26.0 it takes over 6 seconds (with the full data set of around 24000 > items, it seems to become infeasible).
There are now enhancements on a branch (https://www.sqlite.org/src/timeline?r=reuse-subqueries) that should fix your performance problem. Since you seem to be someone who writes intense SQL, it would be really cool if you could try out that branch and see if it solves or causes any other problems. -- D. Richard Hipp d...@sqlite.org _______________________________________________ sqlite-users mailing list sqlite-users@mailinglists.sqlite.org http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
