in reply to Re: Optimizing Tree Hierarchies with DBD::SQLite2
in thread Optimizing Tree Hierarchies with DBD::SQLite2
Bear in mind that SQLite will use at most one index for any given query - so you should look at the generated query plan for your queries to determine if the indices you gave are actually used.
Hmmm... that could be a big problem.
My queries are the following: from the ID fetch the children in the canonical categorization and the browsing categorization. I'm doing it using the primitives given by DBD::SQLite2 and Class::DBI. From the IDs of the different categories I also refer to their names.
What problems did you find with SQLite3 that SQLite2 doesn't have ?
Check this bug report.