Places:Plan: Difference between revisions

Places:Plan (view source)

884 bytes removed , 28 August 2009

Confirmed users

595

edits

@@ Line 199: / Line 199: @@
 *'''BUG:''' {{bug|497543}}
 *'''DEPENDS:'''
-*'''STATUS:''' inactive
-=== Convert bookmarks table to a preordered nested tree ===
-Nested Trees are a good way to manage a hierachy in sql, you can most likely select anything with one query, and no recursion is needed at all. So you can with one query know if a node is descendant or ancestor of another one. This will allow to print out bookmarks paths in the UI, search for folders, check ancestors/descendant with better performances and so on.
-*'''PROS:''' allows to completely avoid recursion when querying descendant/ancestors of a bookmark. fast children count. Self protection from creating cycles of bookmarks.
-*'''CONS:''' Needs schema changes (2 or 3 columns in moz_bookmarks). INSERTS/UPDATES/DELETES could be a bit slower and harder (triggers could help for complexity).
-*'''EST:''' 2 weeks.
-*'''BUG:''' {{bug|408991}}
-*'''DEPENDS:''' {{bug|424160}}, {{bug|453530}}
 *'''STATUS:''' inactive