- Programming Digest
- Posts
- The Design Philosophy of Great Tables
The Design Philosophy of Great Tables
Over the past 5,000 years, tables have evolved from simple grids to highly structured displays of data
Jakub Chodounsky
April 08, 2024
The Design Philosophy of Great Tables
17 minutes by Rich Iannone and Michael Chow
We’ve spent a lot of time thinking about tables. Tables—like plots—are crucial as a last step toward presenting information. There is surprising sophistication and nuance in designing effective tables. Over the past 5,000 years, they’ve evolved from simple grids to highly structured displays of data. Although we argue that the mid-1900s served as a high point, the popularization and wider accessibility of computing seemingly brought us back to the simple, ancient times.
Make your API integrations up to 50% faster with SDKs, Terraform providers, docs & more
sponsored by Speakeasy
Slow API integrations can block revenue streams. Great SDKs solve this problem but tend to be very resource-intensive. Speakeasy’s platform makes crafting type-safe, idiomatic SDKs for enterprise APIs easy. Make SDK generation part of your API’s CI/CD and distribute libraries that users love at a fraction of the cost of maintaining them in-house.
What we know about the xz Utils backdoor that almost infected the world
4 minutes by Dan Goodin
Malicious updates made to a ubiquitous tool were a few weeks away from going mainstream.
What Happens on GitLab When You do git push?
15 minutes by Li Zhennan
Ever wondered how Git and GitLab operate under the hood? Grab your favorite IDE and join me on an exploratory journey into the mechanics of these tools.
What’s in a Name?
2 minutes
Have you ever read an identifier only to realize later it doesn’t do what you expected? Or had to read the implementation in order to understand an interface? These indirections eat up our cognitive bandwidth and make our work more difficult.
FIFO is Better than LRU: the Power of Lazy Promotion and Quick Demotion
14 minutes by by Juncheng Yang
Historically FIFO-based algorithms are thought to be less efficient (having higher miss ratios) than LRU-based algorithms. In this blog, we introduce two techniques, lazy promotion, which promotes objects only at eviction time, and quick demotion, which removes most new objects quickly. We will show that
System Design Newsletter
sponsored by System Design Newsletter
If you want to become good at system design, join the system design newsletter. And receive weekly simplified case studies with 51,001+ like-minded engineers.
how did you like this issue? |