65 pointsby tosh6 days ago6 comments
  • gandreani3 days ago
    It's not clear in the code how you're batching the writes. Could the performance improvement be mostly explained by batches?
    • JSR_FDED3 days ago
      Looks like he’s doing 1M INSERTs per transaction.

      In his 2nd example he’s doing the same thing, except he first sorts the data for each of those 1M INSERTs, leading to a 2-3x speedup.

    • 3 days ago
      undefined
  • rented_mule3 days ago
    This is not unique to SQLite... it should help with any database that uses B+Trees. Batch deletes are also typically faster when the IDs to be deleted are sorted in these same systems.
  • Loranubi3 days ago
    Depending on the size of the blob you might not want to use `WITHOUT ROWID`. I had a similar table with uuid keys and blobs of 40kb size on average and `WITHOUT ROWID` really tanked performance.
  • linolevan3 days ago
    Neat optimization, I've never seen that before. Thanks for sharing.
  • Abenezer09233 days ago
    [flagged]
  • yahavthehackern2 days ago
    [flagged]