On Mon, Mar 1, 2010 at 22:28, Alexander Klimetschek <aklim...@day.com> wrote: > Also it is optimized for trees > with fine-granular content (eg. a page in a CMS), not for arbitrary > sized subfolders with lots of binary content.
Ah, forgot: have you tried your scenario with a FileDataStore? Using a datastore avoids duplicate binaries in the storage, so there should only be some overhead in hashing the files upon versioning. Not sure, it might be that the versioning implementation internally temporarily copies the files, which might be slow. Regards, Alex -- Alexander Klimetschek alexander.klimetsc...@day.com
