linearizable's Likes

Subscribe

Simulating Catalog and Table Conflicts in Iceberg

cdouglas.github.io·2d·

Discuss: Lobsters, Hacker News

Beyond Cosine Similarity

arxiv.org·4w

Simulating Queueing

NULL BITMAP by Justin Jaffray via buttondown.com·1w·

Discuss: Hacker News

Designing a SIMD Algorithm from Scratch

mcyoung.xyz·3d·

Discuss: Hacker News

Notes on Writing WASM

notes.brooklynzelenka.com·6d·

Discuss: Hacker News, Hacker News

How HNSW Makes Vector Search Fast

pullpanda.io·1w·

Discuss: r/programming

An Interactive Intro to CRDTs

jakelazaroff.com·1w·

Discuss: Lobsters, Hacker News, r/programming

Testing Datadog Explain Plan Visualizer With Oracle Execution Plans

tanelpoder.com·1w·

Discuss: Hacker News

Exposing More Parallelism Is the Hidden Reason Why Some Vectorized Loops Are Faster - Not Vectorization per se

johnnysswlab.com·1w·

Discuss: Hacker News

Building Index-Backed Query Plans in DataFusion

pierrezemb.fr·2w·

Discuss: Lobsters, Hacker News

ann_research

romanbikbulatov.bearblog.dev·2w

Deep Dive: How StarRocks Built a High-Performance Vectorized Engine

starrocks.io·2w

Single Store Vector Search Index: Architecture and Memory Efficiency

memgraph.com·2w·

Discuss: Hacker News

Firefly: Illuminating the path to nanosecond-level clock sync in the data center

cloud.google.com·2w

ByteHouse: A Cloud-Native OLAP Engine with Incremental Computation and Multi-Modal Retrieval

arxiv.org·4w

Lessons from BF-Tree: Building a Concurrent Larger-Than-Memory Index in Rust

zhihanz.github.io·5w·

Discuss: Hacker News

ahead-of-time wasm gc in wastrel

wingolog.org·4w·

Discuss: Lobsters, Hacker News

Scaling Laws for Embedding Dimension in Information Retrieval

arxiv.org·4w

Simulating Leader Election on top of FoundationDB

pierrezemb.fr·5w