Resolves: #469800

Summary: Slow import post-processing with large number of non-leaf entries
Description:
Building the ancestorid index does not need to be so expensive, since the
information is available from the parentid index.  The cost is associated with
general overhead in maintaining the IDLists in memory, and in particular to the
constant unions done on them to add children.  When these lists may contain
millions of entries, the time spent copying the existing data when inserting
children is prohibitively expensive.  This does not affect all layouts equally,
but does cause problems when large numbers of children are dispersed throughout
the tree.
BDB can usually handle inserts efficiently on its own, so it is not necessary
to maintain complete IDLists in memory for all the entries and write them out
in total.  Updates can be performed directly to the DB instead.
Note: checking in the patch on behalf of Thomas Lackey

0 files changed, 0 insertions, 0 deletions