On Fri, 27 Jul 2001 09:32:32 +0200 "Jeroen Breedveld" <[EMAIL PROTECTED]> wrote:
> I'm also working on a treediff algorithm to implement versioning on > documents stored in our XML database. I want to use XUpdate (a part of > it) to output the changes from one version to the other in human > readable way. In the future we may allow clients to do XUpdate queries > but for the moment it's only going to be used for output. Cool. We did the same for the Prowler project. (OS content management engine) > One argument could be that it is a lot faster in DOM to move a child > from one node to the other than it is to insert and delete nodes. I > don't have any numbers on that, but I'm going to do some testing. > > Another arguments that's more important for use is that the > representation of a move operation is smaller than the representation of > a delete and insert, because the insert has to hold all the information > that needs to be inserted. This is definetely true. We did some testing with our treediff solution and the results were moderate. Under some circumstances the XUpdate output was about 5-10 times larger than XUL (IBMs treediff language which is not supported any longer) > I'll be happy to help you extend to current spec. Fine. May be other subscribers have supplementing ideas or whishes. -- ______________________________________________________________________ Lars Martin mailto:[EMAIL PROTECTED] SMB GmbH http://www.smb-tec.com ---------------------------------------------------------------------- Post a message: mailto:[EMAIL PROTECTED] Unsubscribe: mailto:[EMAIL PROTECTED] Contact adminstrator: mailto:[EMAIL PROTECTED] Read archived messages: http://archive.xmldb.org/ ----------------------------------------------------------------------
