• To: "'Rick Marshall'" <rjm@z...>
• Subject: RE: XML Performance in a Transacation
• From: "Michael Kay" <mike@s...>
• Date: Sat, 25 Mar 2006 08:50:05 -0000
• Cc: <xml-dev@l...>
• In-reply-to: <4424E00D.1020901@z...>
• Thread-index: AcZP01KmVF4FbT3fS2OdiSgoWEhS3wAFWqAg

> performance part 1. using xlstproc (xmlsoft.org)
> 
> stylesheet approx 50k
> 
> xml in approximate doublings in size from 24k to 3.25M (7 test files)
> 
> the processing time goes up by a factor approx 4 for every 
> doubling in 
> size - looks o(n2) to me.

I'm not sure why you're telling us this. We all know that it is possible to
write an O(n^2) program in any language of sufficient power. And it doesn't
need 50K (bytes? lines?) of code to do it.

Michael Kay
http://www.saxonica.com/

• References:
  • Re: XML Performance in a Transacation
    • From: Rick Marshall <rjm@z...>

• Prev by Date: Re: XML Performance in a Transacation
• Next by Date: Re: XML Performance in a Transacation
• Previous by thread: Re: XML Performance in a Transacation
• Next by thread: Re: XML Performance in a Transacation
• Index(es):
  • Date
  • Thread