W3C home > Mailing lists > Public > public-webapi@w3.org > March 2006

Re: Asymptotic computational complexity bounds for DOM methods

From: Stéphane Sire <sire@intuilab.com>
Date: Thu, 2 Mar 2006 16:12:09 +0100
Message-Id: <F257B7DA-1E09-4BF0-9EAF-E5A295C4DA92@intuilab.com>
To: public-webapi@w3.org

Another way to handle computational complexity could be to turn it  
into a usability requirement.

In that case a meaningful measure is the  UA response time (for  
instance less than 125 ms when inserting/replacing a node in a  
document).

The assessment of UA response time could be done with in the Test  
Suite with a "complex" document taken as a reference (for instance  
that could be a document with a given "big" number of nodes and  
containing a script for inserting/replacing new nodes).

However I do not know if it is desirable to put a UA response time  
constraint in a Test Suite....

Stéphane
---
Received on Thursday, 2 March 2006 15:09:20 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:18:53 GMT