Is it necessary to have AVL tree in closure tables method and does it
result in speed improvements?

On Wed, Sep 9, 2015 at 4:59 PM, Richard Hipp <drh at sqlite.org> wrote:

> On 9/9/15, Sairam Gaddam <gaddamsairam at gmail.com> wrote:
> > I know that one of the method to compute transitive closure is closure
> > tables method. But I didn't understand why AVL tree implementation is
> > present in the closure.c extension in order to compute transitive closure
> > because the result can be directly queried from the Virtual table(closure
> > table).
> >
> > Can anyone kindly explain what is the significance of AVL tree to compute
> > transitive closure ???
>
> It is used to implement a priority queue.
> --
> D. Richard Hipp
> drh at sqlite.org
> _______________________________________________
> sqlite-users mailing list
> sqlite-users at mailinglists.sqlite.org
> http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
>

Reply via email to