> It does only 1 propfind (on the folder) after each added > document. The > result is then parsed, looping through all the documents' index > properties the determine the highest number. Since one > document is added > at a time, that would be a linear time increase rather than > exponential, > wouldn't it?
No, it is exponential: - noid (number of inserted documents) - aerip (average entries returned in propfind) = noid / 2 - time needed = noid * aerip I believe this classifies as O(n^2) and what you really want is O(n). With the bulk operation you propose you need multiple operations per document (intial store and update of the index afterwards) and this still classifies as O(n). Johan ******************************************** Hippocms-dev: Hippo CMS development public mailinglist
