These are widely deployed [citation needed] so nice chance to save some ram!

I wonder - if the number of nodes goes down enough then they could reduce the number of bits for the record_size and save another 12-25%

Loose index scan is made for this https://dev.mysql.com/doc/refman/8.0/en/group-by-optimizatio...

Postgres doesn't have it yet https://wiki.postgresql.org/wiki/Loose_indexscan

I haven't followed the latest Postgres releases, but I thought it would be added by now - Timescale/Tigerdata have already implemented a similar index scan in Postgres: https://www.tigerdata.com/blog/how-we-made-distinct-queries-....

As is mentioned in the article (now).

(since it was originally posted)

Muse Spark, Gemini, mistral and something from cohere would be nice

That said the current models ain't bad!

Gemini models are coming soon!

I'm drawn to this but it has several foot guns like INSERTs will fail for late arriving data if the constraints have been updated etc

Reminds me a little of htmz

htmz is a minimalist HTML microframework for creating interactive and modular web user interfaces with the familiar simplicity of plain HTML.

Yes, htmz is a great project! The core idea is similar, but htmz is intentionally more minimal (it's literally 166 bytes). µJS covers more ground: patch mode, SSE, DOM morphing, View Transitions, prefetch, polling, full HTTP verb support.

Yay someone already mentioned my favorite “framework”!

htmz is a masterclass in simplicity. It’s gotta be the all time code golf winner.

This looks interesting. Thanks for sharing.

quite cool, but the browser history being messed up drives me bonkers. is that easy to fix?

You should be able to push to history using history.pushState(…) after loading a new page. There are probably more details needed around popState to handle back and forward navigation. I’m sure Claude will be able to assist here, but maybe too much complexity when other similar libraries may also manage history state.

Yes, µJS manages browser history out of the box.

Building an email-to-calendar-feed service for all the mails from the multitude of services and attachments that I get related to my kindergartener.

My read is that no customers will leave since they are much more interested in news coverage -- and this helps the AP focus more on news.

This is a tangent, but I wonder if they feel that they are just creating LLM training data and that few readers (even of Sunday papers) will actually read their reviews.

The base model is Qwen2.5-VL-3B and the announcement says a limitation is "Model can suffer from hallucination"

Seems a bit scary that the "source" text from the pdfs could actually be hallucinated.

Given that input is image and not raw pdf, its not completely unexpected

I wish there were some explain plans in either post, since I don't get what's going on.

If the query uses the index, then the on the fly tsvector rechecks are only on the matches and the benchmark queries have LIMIT 10, so few rechecks right?

Edit: yes but the query predicates have conditions on 2 gin indexes, so I guess the planner chooses to recheck all the matches for one index first even though it could avoid lots of work by rechecking row-wise