W3C home > Mailing lists > Public > public-webapps@w3.org > April to June 2010

Re: [IndexedDB] Computed indexes

From: Shawn Wilsher <sdwilsh@mozilla.com>
Date: Thu, 24 Jun 2010 07:48:37 -0700
Message-ID: <4C237045.70701@mozilla.com>
To: Jeremy Orlow <jorlow@chromium.org>
CC: Jonas Sicking <jonas@sicking.cc>, Webapps WG <public-webapps@w3.org>
  On 6/24/2010 7:01 AM, Jeremy Orlow wrote:
> So what your proposing is that the keyPath would essentially be a string of
> the body of a function which runs for every index (on that objectStore) for
> every value inserted into that object store?  This seems like half way
> between the eval-like idea I mentioned earlier.  It certainly seems to have
> advantages for complex keyPaths, but I'm still not so hot on having
> boilerplate/assumptions (like needing "return" and assuming "value" is
> present) present in every single keyPath.  Especially when the use cases
> (while important) don't seem to be the common case.  (In fact, can you even
> do this in SQL?  If not, I think it's pretty strong evidence against needing
> to do arbitrary calculations in a keyPath.)
You can do something like this with triggers I think.



Received on Thursday, 24 June 2010 14:49:33 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 18:13:08 UTC