- From: Joshua Bell <notifications@github.com>
- Date: Mon, 30 Sep 2019 12:33:44 -0700
- To: w3c/IndexedDB <IndexedDB@noreply.github.com>
- Cc: Subscribed <subscribed@noreply.github.com>
Received on Monday, 30 September 2019 19:34:06 UTC
In the future, anything is possible. 😄 The discussion at TPAC 2019 was just around implementer priority of explorations in this general space based on developer demand, not precluding any particular approach. I can imagine anything from incremental additions to keypath syntax (#35, #209, etc) to arbitrary expressions (#33) or out-of-line index data (#204). One thing we _were_ keen to solve is the full text search problem (#44); we'd love feedback on what additions - if any - are necessary in Indexed DB to solve that problem. FTS approaches exist for relational databases (e.g. SQLite) but at least the folks at the table were not experts on "nosql" approaches for FTS. If a concrete proposal comes up that addresses FTS and it requires extending keypaths, that'll adjust our prioritization. -- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/w3c/IndexedDB/issues/209#issuecomment-536717147
Received on Monday, 30 September 2019 19:34:06 UTC