Explore >> Select a destination
|
You are here 
|
initialcommit.com | ||
| | | | |
markodenic.com
|
|
| | | | | Free programming books, algorithms, public APIs, and much more. | |
| | | | |
www.evidentlyai.com
|
|
| | | | | In this blog we recap Ask-Me-Anything session with Hamza Tahir, that covered MLOps trends and tools, the future of real-time ML, and building an open-source startup. | |
| | | | |
www.decodable.co
|
|
| | | | | At Decodable, we have long believed that Apache Flink is the best stream processing system, with a proven track record of meeting the demands of some of the largest and most sophisticated businesses in the world, such as Netflix, Uber, Stripe, and many more. We are excited to welcome Confluent to the ranks of companies, like ourselves, who regard Flink as the industry standard for meeting the real-time stream processing needs of businesses, large and small. | |
| | | | |
jack-vanlightly.com
|
|
| | | In today's post I want to walk through a fascinating indexing technique for data lakehouses which flips the role of the index in open table formats like Apache Iceberg and Delta Lake. We are going to turn the tables on two key points: 1. Indexes are primarily for reads. Indexes are usually framed as read optimizations paid for by write overhead: they make read queries fast, but inserts and updates slower. That isn't the full story as indexes also support writes such as with faster uniqueness enforcement and reducing lock contention (for example, by avoiding range locks during table scans) but the dominant mental model is that indexing serves reads while writes pay the bill. 2. OTFs don't use tree-based indexes. Open-table format indexes are data-skipping ind... | ||
