From 0959b4c9fe6f5b89bc485e48dc395a4433ee6219 Mon Sep 17 00:00:00 2001 From: FT <140458077+zeevick10@users.noreply.github.com> Date: Tue, 17 Dec 2024 21:22:32 +0100 Subject: [PATCH 1/3] Update USERS.md --- USERS.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/USERS.md b/USERS.md index a7e0ea45dd5..d5c38bfff7e 100644 --- a/USERS.md +++ b/USERS.md @@ -8,7 +8,7 @@ At Facebook, we use RocksDB as storage engines in multiple data management servi 3. ZippyDB -- Facebook's distributed key-value store with Paxos-style replication, built on top of RocksDB.[1] https://www.youtube.com/watch?v=DfiN7pG0D0khtt 4. Laser -- Laser is a high query throughput, low (millisecond) latency, key-value storage service built on top of RocksDB.[1] 4. Dragon -- a distributed graph query engine. https://code.facebook.com/posts/1737605303120405/dragon-a-distributed-graph-query-engine/ -5. Stylus -- a low-level stream processing framework writtenin C++.[1] +5. Stylus -- a low-level stream processing framework written in C++.[1] 6. LogDevice -- a distributed data store for logs [2] [1] https://research.facebook.com/publications/realtime-data-processing-at-facebook/ From 683ba94d384674e9af560a9b96497456cacb56bc Mon Sep 17 00:00:00 2001 From: FT <140458077+zeevick10@users.noreply.github.com> Date: Tue, 17 Dec 2024 21:23:25 +0100 Subject: [PATCH 2/3] Update file_system.h --- include/rocksdb/file_system.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/include/rocksdb/file_system.h b/include/rocksdb/file_system.h index 27e497f432b..c341c1eb88f 100644 --- a/include/rocksdb/file_system.h +++ b/include/rocksdb/file_system.h @@ -689,7 +689,7 @@ class FileSystem : public Customizable { // Underlying FS is required to support Poll API. Poll implementation should // ensure that the callback gets called at IO completion, and return only // after the callback has been called. - // If Poll returns partial results for any reads, its caller reponsibility to + // If Poll returns partial results for any reads, its caller responsibility to // call Read or ReadAsync in order to get the remaining bytes. virtual IOStatus Poll(std::vector& /*io_handles*/, size_t /*min_completions*/) { From 19fd1a9607f9096cff7b66f44f65af75b473d5f8 Mon Sep 17 00:00:00 2001 From: FT <140458077+zeevick10@users.noreply.github.com> Date: Tue, 17 Dec 2024 21:24:21 +0100 Subject: [PATCH 3/3] Update memtable.cc --- db/memtable.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/db/memtable.cc b/db/memtable.cc index d51a85350c2..063125be5e8 100644 --- a/db/memtable.cc +++ b/db/memtable.cc @@ -1061,7 +1061,7 @@ Status MemTable::Add(SequenceNumber s, ValueType type, // It is okay for some reader to load old cache during invalidation as // the new sequence number is not published yet. // Each core will have a shared_ptr to a shared_ptr to the cached - // fragmented range tombstones, so that ref count is maintianed locally + // fragmented range tombstones, so that ref count is maintained locally // per-core using the per-core shared_ptr. std::atomic_store_explicit( local_cache_ref_ptr,