Sled – An Embedded Database in Rust
Sled is an embedded database implemented in Rust that offers a variety of features for efficient data management. It supports atomic operations, transactions, and provides a threadsafe API similar to BTreeMap. The database is designed for high performance with optimizations for storage and retrieval, making it suitable for applications requiring structured data handling.
- ▪Sled provides atomic compare and swap operations and supports serializable transactions for multiple keys.
- ▪The database automatically fsyncs every 500ms by default to ensure durability.
- ▪Sled uses modern B-tree techniques to optimize storage costs, particularly for long keys with shared prefixes.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/spacejam/sled |
| Publication time | Fri, 29 May 2026 04:09:50 +0000 |
| Retrieval time | 2026-05-29T04:29:41.942Z |
| Last seen | 2026-05-29T04:29:41.942Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | pYoZTTMQDLFw |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
key value documentation chat about databases with us sled - it's all downhill from here!!! An embedded database. let tree = sled::open("/tmp/welcome-to-sled")?; // insert and get, similar to std's BTreeMap let old_value = tree.insert("key", "value")?; assert_eq!( tree.get(&"key")?, Some(sled::IVec::from("value")), ); // range queries for kv_result in tree.range("key_1".."key_9") {} // deletion let old_value = tree.remove(&"key")?; // atomic compare and swap tree.compare_and_swap( "key", Some("current_value"), Some("new_value"), )?; // block until all operations are stable on disk // (flush_async also available to get a Future) tree.flush()?; $${\color{red}This \space README \space is \space out \space of \space sync \space with \space the \space main \space branch \space which \space…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.