Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

LSMs are fun because they combine a bunch of data structures into one! Trees / skip-lists as the storage format. Bloom filters for faster lookups. Priority queues for efficient merges. A little clip from last week's stream showing how the latter works for LSM chunk merging.

89,180 Aufrufe • vor 5 Monaten •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

🚀 Arweave: The Epic Journey Towards Timeless Data Storage Embark on a journey with me as we unravel the marvel that is Arweave, a project meticulously crafted to safeguard data for an eternity without compromise. Let's dive into the intricacies that make this revolutionary endeavor a beacon of #permanence . 🌐 How Does #Arweave Achieve Timeless Data Storage? ✨ Cryptographic Proofs: Imagine a world where data integrity is not just a promise but a #cryptographic reality. Arweave's #foundation lies in cryptographic proofs, ensuring that every new block added to the network is not just stored but validated with unyielding certainty. 🏰 Storage Endowment: Arweave doesn't just store data; it endows it with longevity. Through a groundbreaking approach, data stored on Arweave is prepaid for 20 replicas spanning the next 200 years. This is not a mere estimate; it's a conservative projection, fortifying Arweave's commitment to #securing your data for the long term. 💡 Incentivized Evolution: The #world evolves, and so does Arweave. The #protocol is open, ready for change, and embraces an incentivized evolution model. Arweave positions itself not just as a #platform but as a versatile framework, encouraging innovative forks rewarded through a fair fork methodology. The beauty lies in the compatibility of these forks at the protocol layer, fostering cooperation over competition. 🌍 Unified Dataset for Permanence: Arweave isn't just about storing data; it's about unity. The encouragement of forks aligns seamlessly with the mission of permanent data storage. Keeping the dataset unified is in everyone's best interest, ensuring a collective stride towards a future where data stands the test of time. 🔍 Breaking It Down: Cryptographic Proofs: Ensuring the replication and secure storage of substantial parts of the Arweave dataset. Storage Endowment: A commitment to safeguarding data for a minimum of 200 years. Innovative Forks: Encouraging a continuous stream of innovation for permanent data storage. 📖 For those seeking a deeper understanding, explore DRAFT 17. Delve into the intricacies of Arweave's design, where proofs drive replication, the endowment fortifies storage, and the approach to forks sparks innovation. Join us on this odyssey towards a future where your data remains eternally secure and unaltered. Türkçe için : Arweave Ecosystem Only Arweave ar.io WeaveVM is now Load Network (@useload)

𝚊𝚛://𝚟𝚎𝚟𝚒𝚟𝚘 🐘

26,390 Aufrufe • vor 2 Jahren

Why is Redis Fast? Redis is fast for in-memory data storage. Its speed has made it popular for caching, session storage, and real-time analytics. But what gives Redis its blazing speed? Let's explore: RAM-Based Storage At its core, Redis primarily uses main memory for storing data. Accessing data from RAM is orders of magnitude faster than from disk. This is a major reason for Redis's speed. However, RAM is volatile. To persist data, Redis supports disk snapshots and append-only file logging. This combines RAM's performance with disk's permanence. There is a tradeoff though - recovery from disk is slow. If a Redis instance fails, restarting from disk can be slow compared to failing over to a replica instance fully in memory. So while Redis offers durability via disk, it comes at the cost of slower recovery. A better solution is Redis replication. With a synchronized replica kept in memory, failover is instant with no rehydration. This maintains speed and near-instant recovery. IO Multiplexing & Single-threaded Read/Write Redis uses an event-driven, single-threaded model for its core operations. A main event loop handles all client requests and data operations sequentially. This single-threaded execution avoids context switching and synchronization overhead typical of multi-threaded systems. Redis uses non-blocking I/O to handle multiple connections asynchronously. This allows it to support many client connections with very low overhead, Redis does leverage threading in certain areas: - Background tasks like taking snapshots. - I/O threads are used for certain operations. - Modules can use threads. - Since Redis 6.0, it supports multi-threaded I/O for network communication, improving performance on multi-core systems. Redis also uses pipelining for high throughput. Clients pipeline commands without waiting for each response. This allows more efficient network round trips, boosting overall performance. Efficient Data Structures Redis supports various optimized data structures, from linked lists, zip lists, and skip lists to sets, hashes, and sorted sets, among others. Each is carefully designed for specific use cases for quick and efficient data access. Over to you: With Redis now supporting some multi-threading, how should we configure it to fully utilize all the CPU cores of modern hardware when deploying in production? – Subscribe to our weekly newsletter to get a Free System Design PDF (158 pages):

Sahn Lam

46,910 Aufrufe • vor 2 Jahren