Lance, Vortex, Nimble, FastLanes, GeoParquet, cloud-optimized geo formats and new time-series encodings each optimize one access pattern on one storage tier. A field guide to what their published numbers measure, where tuned Parquet still wins, and how to choose.
A field guide to performance and cost engineering: claim-checking with the scaling and queueing laws, measurement discipline, where GPU and CPU budgets leak, and how to turn a benchmark into a hardware decision.
Second in my benchmark best practices series. Little’s law checks that throughput, latency and concurrency describe the same system, exposes the load generator’s ceiling, and turns a latency budget into a sizing requirement.
HEAD probes on delete markers answer 405 and replication counts that as success. 20M stuck versions turned the loop into 684M useless requests in 48 h.
Part 1 of my benchmark best practices series: how I turn a scaling claim into an implied serial fraction with Amdahl’s law, and what the Universal Scalability Law adds. Includes a measured pipeline where assigning more vCPUs per image cut global throughput.
Compression, object population and request count measure different things. Compare point-cloud packaging, range reads, update costs and cleanup with an explicit synthetic sizing example.
Choose a message broker for real-time IoT control: start from the latency budget, test ack mode and packet loss, and when to skip the broker for UDP.
A successful source PUT does not establish a recoverable peer copy. Separate MinIO site-replication acknowledgment, persisted retry state and catch-up capacity before committing to an RTO or RPO.
MinIO has no NameNode. It puts the namespace on XFS as real directories and xl.meta files. On Lots of Small Files that means you can exhaust inodes while df -h still looks fine, and a flat leaf can stall PUT, LIST, scanner, and ILM together. Here is the on-disk model, the inode math, and a prefix recipe that keeps XFS inside a regime you can operate.
MinIO fixed the HDFS NameNode limit, but it has no index: it writes one xl.meta per object on every drive of the erasure set. On 5 servers of 12 NVMe, MinIO picks a 15-wide set by default, so each small object is stored 15 times over. A worked sizing that looks fine for two years and dies in days.