Anki is currently tracking the hierarchical tree structure of sub-decks exclusively via string delimiters like \x1f in it’s collection.anki2 databse.
This seems not to be such a good solution espacially for addon developers and can slow stuff down a bit… it unnecessarily complicates database querying…
(For example I want to find every child of a deck to hash the whole deck but currently I have to use a “long, scuffed” query for this…)
The Proposal: I suggest introducing a normalized adjacency relation to cleanly map the tree hierarchy without abandoning the current schema string architecture, if this is wanted I am happy to try to implement it myself and push it…