I use PostgreSQL full text search and GIN indexing and often find it to be good enough and fast enough without the hassle to have to handle a second engine just for search.

If I may:

Their is a huge conflict of ingerest of giving this power to a major economical actor that vastly depends on public investment and under public scrutinity.

Executive should have the audit right and in some measure probably it should be widespread to all citizens up to sensitive data not being leaked. But what good is there to give this power solely to one of the richest and more powerful man in the world? This is crazy.

Logging is static in CLI world but you can reproduce this easily with pdb in python

Recently I found myself happy to find bug in code I have writtdn for those reasons.

It can be useful for improving ingestion pipeline: put your pdf collection in a temp table and then extract with pure SQL the information you want.

Or toothpath dynamic.

Any syntax with a let operator to name stuff or a lambda abstraction.

That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names).

Isn't this fan-in?

let A = select * from tbla

let B = select * from tblb

let C = select * from A join B

Think about what tbla and tblb can be - hint they can only be globals (ie actual tables)

I don't understand at all my kids choices in game or way of spending time at all

It seems completely random but in a coherent way. It is wonderful.

Anyway, you are right and not pedantic at all.

The largest fancy math object I know is probably the proof of the following theorem:

https://link.springer.com/chapter/10.1007/978-3-030-51074-9_...

The proof is 200Gb large. I am quiet sure now even larger proof exists, in particular thet exhaust some combinatorial property on graphs.

Do you have any simd-optim in parsing all those large files ?

I have read that you write some of your own parser for perf boost.

(I am one of the author of https://github.com/V0ldek/rsonpath)

No SIMD in the parser path... yet... :)

The main win from writing our own custom parser is writing directly into the final in-memory format from the parse stream without any intermediate allocations or data movement.

Awesome project! Adding it to my list of things we may plug into in the future.

Sealable spreadsheet is also awesome ! Congrats for the delivery.