Thinking back to the discussion on sharding as indexing – searching inside of the space of a Space Filling Curve is another possible approach to parallelization and to proving theorems about global coverage relative to some sort of Lipschitz conditions. There would be regions of the curve that are infeasible and then get chopped out, handled as special endpoints.

https://people.csail.mit.edu/baghdadi/
https://github.com/rbaghdadi
http://tiramisu-compiler.org/

https://www.andrew.cmu.edu/user/mrainey//
https://www.andrew.cmu.edu/user/mrainey//cv.html
https://github.com/mikerainey

Some DIA guy is writing in English that this Japanese author is an in-kill, living somewhere. The English docs on Postgress Internals sound like his work edited by someone else.

https://www.amazon.com/Hironobu-Suzuki/e/B004LU8DH2%3Fref=dbs_a_mng_rwt_scns_share

We want at least the most recent 2 ppl here – not sure how far 2 goes.
https://www.linkedin.com/in/matthew-rocklin-461b4323/
https://github.com/mrocklin