W3C home > Mailing lists > Public > public-webapps@w3.org > October to December 2009

Re: What do we mean by "parking" Web Database?

From: Jonas Sicking <jonas@sicking.cc>
Date: Mon, 9 Nov 2009 09:00:43 -0800
Message-ID: <63df84f0911090900g6d6e0fc8m1e6256143025ebce@mail.gmail.com>
To: Anne van Kesteren <annevk@opera.com>
Cc: Maciej Stachowiak <mjs@apple.com>, Arthur Barstow <art.barstow@nokia.com>, Charles McCathieNevile <chaals@opera.com>, public-webapps <public-webapps@w3.org>
On Mon, Nov 9, 2009 at 3:51 AM, Anne van Kesteren <annevk@opera.com> wrote:
> On Mon, 09 Nov 2009 08:12:22 +0100, Jonas Sicking <jonas@sicking.cc> wrote:
>> * SQL doesn't give any performance guarantees. Many times people tweak
>> their SQL in order to get the implementation to use a desired
>> evaluation stategy. This won't work in the likely event that different
>> implementations use different evaluation strategies for the same
>> query.
> From what I understood so far this would also be the case with the Web
> B-Tree Database proposal (maybe even more so given that all SQL
> implementations currently have the same underlying engine). Am I missing
> something?

I don't think this is the case with the SimpleDB proposal. I think
it's possible to for example guarantee that a lookup based on an index
is O(log n) on the number of items in that entity store. Nikunj, is
this correct?

Anne, are there any specific operations you have in mind where you
don't think we can give timing guarantees?

/ Jonas
Received on Monday, 9 November 2009 17:01:38 UTC

This archive was generated by hypermail 2.3.1 : Friday, 27 October 2017 07:26:20 UTC