• To: "Rick Marshall" <rjm@z...>
• Subject: Re: XML Performance in a Transacation
• From: "Peter Hunsberger" <peter.hunsberger@g...>
• Date: Mon, 27 Mar 2006 08:36:07 -0600
• Cc: "Michael Kay" <mike@s...>, xml-dev@l...
• Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:to:subject:cc:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references; b=WghH1h4Na0Q+rWuP2kYIXbtLUO1qZGaTuw9A+wA5rU5rybBEormHvurqYrynrNqWpDFSNZKbsKT8pFz4FNoBFQYKwuDlxr05U/QCt0KAdx8h1otcSGdYpx+tfj26OilBOvyhu6NQqddXQ4vJm0m5Oz7fANoulgsN681mWmEa6gU=
• In-reply-to: <44269384.3060308@z...>
• References: <200603260900.k2Q902ET031627@z...> <44269384.3060308@z...>

On 3/26/06, Rick Marshall <rjm@z...> wrote:
>
> Michael Kay wrote:
>
> >>o(n2) is what you get when something is wrong.
> >>
> >
> >No, there are many problems for which no solution exists that is better than
> >O(n^2) - in any language.
> >
> >
> and it's a problem, because those problems can't be scaled, but instead
> have to be tackled by decomposition (at least you then get linear response)
>

Think about what you're saying here:  if you can break the data apart
by hand and  get linear processing times you've demonstrated that
there is an algorithm that has linear processing times. The issue is
coding it up...

--
Peter Hunsberger

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

• Prev by Date: AW: AW: Occurrence Question
• Next by Date: Namespaces, Xml Schema Whitespace normalization, xs:anyURI, and URILiteralsin XPath 2.0
• Previous by thread: RE: XML Performance in a Transacation
• Next by thread: Call for fast XML implementations
• Index(es):
  • Date
  • Thread