pointcloud

Hi there! I have a question: In the article you demonstrate how quad-trees are used for indexing spatial data, but does Cockroach DB do this in 3D as well (i.e. octree)? I was fairly interested in PG Pointcloud [1] back when I was in grad school, but storing arbitrary 3D information seemed to present unique challenges in this space (especially with regards to indexing). Would the approach used here extend to 3D? I don't know if I see a clear reason it wouldn't, but I was wondering if there's anything in Cockroach that might make that extension difficult. I recognize you're using the S2 library here as well, which doesn't seem to have all the 3D primitives, but I'd be interested to hear your thoughts! [1] https://github.com/pgpointcloud/pointcloud

As the author if Tgres, I can chime in here - dr. mfreed is correct. While Tgres is an application layer, the main motivation behind developing it was to answer the question "can TS be stored in Postgres efficiently, ideally without requiring an extension". Not that there is anything wrong with custom extensions, but I wanted to keep the requirements to the absolute minimum. I always had issues with people saying that relational databases are fundamentally not suitable for TS storage, and Tgres debunks this by demonstrating that you can sustain very high rates of incoming data by simply organizing the data in a more creative way. The graphite functionality that Tgres emulates is just there to prove the point - as in, look it does all these things, and it's all in the database. Hypothetically Tgres could work on top of Timescaledb with a f