Quite the difference indeed ...
sqlite> .once q2
sqlite> WITH RECURSIVE tree(child_id, parent_id, steps) AS (
...>SELECT child.id AS child_id, child.id AS parent_id, 0 AS steps
...>FROM languoid AS child
...>UNION ALL
...>SELECT tree.child_id AS child_id, parent.parent
Hi Sebastian,
You can achieve better performance by constructing the path as you
walk the tree.
e.g.
WITH
tree(
id,
depth,
path
) AS (
SELECT id,
1,
id
FROM languoid
WHERE parent_id IS NULL
UNION ALL
SELECT l.id,
t.depth+1,
t.path || '/' || l.id
FROM tree
Hi!
On Sat, 22 Dec 2018 10:49:31 -0500
Richard Hipp wrote:
> On 12/22/18, Shlomi Fish wrote:
> >
> > with respect to
> > https://www.mail-archive.com/sqlite-users@mailinglists.sqlite.org/msg113238.html
> > ,
> > this shows that the tcl version is 8.6.9 which is the latest according to
> > https
On 12/22/18, Shlomi Fish wrote:
>
> with respect to
> https://www.mail-archive.com/sqlite-users@mailinglists.sqlite.org/msg113238.html
> ,
> this shows that the tcl version is 8.6.9 which is the latest according to
> https://www.tcl.tk/software/tcltk/ . Also see https://pkgs.org/download/tcl
> for
Hi all!
On Tue, 18 Dec 2018 19:55:25 +0200
Shlomi Fish wrote:
> Hi,
>
> With the attached bash script on Mageia Linux v7 x86-64 I consistently get the
> test failures here:
>
> https://www.shlomifish.org/Files/files/text/sqlite-mga7-rpm-build.txt.xz
>
> this is with sqlite 3.26.0.
>
> This a
On 12/22/18, Sebastian Bank wrote:
>
> 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).
Hi,
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.2
7 matches
Mail list logo
