-
公开(公告)号：US12032559B2
公开(公告)日：2024-07-09
申请号：US17323417
申请日：2021-05-18
发明人： Mikhail Danilov , Andrei Paduroiu
IPC分类号： G06F16/215 , G06F16/23
CPC分类号： G06F16/2379 , G06F16/215
摘要： The described technology is generally directed towards fine-grained data expiration to reduce storage capacity used in a streaming data storage system. Segments of events are scanned, with each event's payload evaluated to determine whether that event is expired or unexpired. For example, for a log event, an expiration period can be determined based on the event creation time and the event logging level, both of which are typically within the log event's payload. Unexpired events are copied to a new destination segment that replaces the original, scanned source segment; the expired events are deleted when the source segment is deleted, reclaiming storage capacity used by the expired events. Also described is maintaining and using segment and chunk metadata to bypass individual event processing when the metadata indicates that the chunk contains only expired events and can be safely deleted.
-
2.发明授权公开(公告)号：US11847141B2
公开(公告)日：2023-12-19
申请号：US17152537
申请日：2021-01-19
发明人： Mikhail Danilov , Yohannes Altaye
CPC分类号： G06F16/285 , G06F16/211 , G06F21/6218
摘要： Storage of data according to mapped reliability groups (MRGs) of mapped redundant arrays of independent nodes (mapped clusters) is disclosed. Real reliability groups (RRGs) of a real cluster can provide compartmentalization that can reduce a probability of a data loss event occurring in a cluster storage system. MRGs for a mapped cluster employing the RRGs of the real cluster can provide additional compartmentalization that can further reduce a probability of a data loss event occurring. A data protection set can be stored according to a first group of MRGs and a redundant representation of the data protection set can be stored according to a second group of MRGs, wherein a network distance between the first and second group of MRGs is greater than a network distance between constituent MRGs of either the first or second group of MRGs.
-
公开(公告)号：US11593030B2
公开(公告)日：2023-02-28
申请号：US17316842
申请日：2021-05-11
发明人： Mikhail Danilov , Yohannes Altaye
IPC分类号： G06F3/06
摘要： The described technology is generally directed towards cross-stream transactions in a streaming data storage system, which allows a writer application to commit multiple events to distinct data streams in a single transaction. The system creates a cross-stream transaction for a writer application, and the writer application adds events to the cross-stream transaction, indicating which destination data stream(s) each event's data is to be appended. The system adds the event to a subordinate transaction created for each specified data stream. Upon committing the cross-stream transaction, the system coordinates the committing of the subordinate transactions to their respective data streams. Alternatively, an application writer can request that an event be committed to multiple writer-specified data streams via a cross-stream micro-transaction, in which the streaming data storage system obtains the appropriate segment store instances and segments for each data stream, and coordinates the direct appending of the event to the appropriate segments.
-
公开(公告)号：US11550850B2
公开(公告)日：2023-01-10
申请号：US17467604
申请日：2021-09-07
发明人： Grigorii Skripko , Mikhail Danilov
IPC分类号： G06F16/00 , G06F16/903 , G06F16/909 , G06F16/9035 , G06F16/28 , G06F16/27
摘要： The described technology is generally directed towards quasi-listing table entries that facilitate the efficient return of an object list in response to a query for relevant objects in a data storage system. A quasi-listing table entry is created when an object is created, and subsequently converted to a normal listing table entry. A normal listing table entry is converted to a quasi-listing table entry when an object is deleted, with the quasi-listing table entry subsequently deleted. When an object list request is received, a normal listing table entry can be used directly to add to the object list; only if a quasi-listing table entry is encountered (before it can be converted or deleted) does the object table need to be accessed to determine if the object actually exists. This eliminates most object table accesses, including those in remote geographic zones, thereby making object listing significantly more efficient.
-
公开(公告)号：US11513871B2
公开(公告)日：2022-11-29
申请号：US17038102
申请日：2020-09-30
发明人： Mikhail Danilov , Igor Medvedev
IPC分类号： G06F9/54 , G06F9/4401 , G06F9/451
摘要： Retention of events of an ordered event stream according to at least one triggered retention policy is disclosed. Expiration of events stored in a segment of an ordered event stream (OES) can be desirable. New events can be added to a head of an OES segment, and pruning events from a tail of the OES segment can be desirable. Processing applications can predicate event retention, e.g., restricting expiration of an event, on at least one triggered retention policy. In some embodiments, an additional fixed retention policy can be combined with the triggered retention. The disclosed retention can be performed at the event-level or at less granular levels, e.g., segment-level, OES-level, etc., e.g., via batching of events.
-
公开(公告)号：US20220342725A1
公开(公告)日：2022-10-27
申请号：US17237517
申请日：2021-04-22
发明人： Mikhail Danilov , Yohannes Altaye
摘要： Scaling an ordered event stream (OES) based on an information-unit (IU) metric is disclosed. The IU metric can correspond to an amount of computing resources that can be consumed to access information embodied in event data of an event of the OES. In this regard, the amount of computing resources to access the data of the stream event itself can be distinct from an amount of computing resources employed to access information embodied in the data. As such, where an external application, e.g., a reader, a writer, etc., can connect to an OES data storage system, enabling the OES to be scaled in response to burdening of computing resources accessing event information, rather than merely event data, can aid in preservation of an ordering of events accessed from the OES.
-
公开(公告)号：US11435957B2
公开(公告)日：2022-09-06
申请号：US16698096
申请日：2019-11-27
发明人： Mikhail Danilov , Yohannes Altaye
摘要： Selective instantiation of a mapped cluster storage service (MCSS) is disclosed for storage system supporting a doubly mapped redundant array of independent nodes environment. An instance of a MCSS can be run on computing resources of the storage system supporting a doubly mapped redundant array of independent nodes environment, wherein a real node of a real cluster comprises a real storage device that comprises real extents, and wherein extents of the storage system map to a mapped node of a mapped cluster. The instance of the MCSS can be run near to the highest number of real extents participating in a mapped node. This can reduce computing resource consumption associated with running the MCSS farther from the more concentrated real extents.
-
公开(公告)号：US11435923B2
公开(公告)日：2022-09-06
申请号：US17145581
申请日：2021-01-11
发明人： Mikhail Danilov , Andrei Paduroiu
IPC分类号： G06F3/06 , H04L67/5682
摘要： The technology describes forking (dividing) a data stream into multiple data streams comprising appending a first new data stream and a second new data stream to the original data stream. After forking, the two new data streams have different sets of stream fragments, with one or more of the older stream fragments common to both sets. Data events before the forking operation are read from the original data stream, while data events appended after the forking operation are appended to and read from only one of the data streams, based on which stream each writer/reader is registered to. Also described is truncating the original data stream based on one stream identifier, while leaving the original data intact for another stream identifier. Only when no stream needs a portion of the original data (resulting from separate truncation operations) is the data portion deleted.
-
公开(公告)号：US20220229845A1
公开(公告)日：2022-07-21
申请号：US17152558
申请日：2021-01-19
发明人： Mikhail Danilov , Maksim Vazhenin
IPC分类号： G06F16/25
摘要： Annulment of events written into an ordered event stream (OES) storage system is disclosed. Events can be written to one or more segments of an OES. An event can be invalid and overwriting the event can be desirable. A stream-cut event can be employed to facilitate annulment of the event via altering a portion of a segment of an OES. The stream-cut event can be durable. Annulment can avoid rewriting an entire stream and/or complicating a stream by adding mitigating events without overwriting invalid events. In an aspect, annulment can comprise moving a write cursor according to a stream-cut event. The annulment can be lossy or lossless. In an embodiment, annulment can be performed in single tier OES storage system. In another embodiment, multi-tier OES storage systems can facilitate annulment.
-
公开(公告)号：US20220229568A1
公开(公告)日：2022-07-21
申请号：US17153602
申请日：2021-01-20
发明人： Mikhail Danilov , Nickolay Dalmatov
摘要： Allocation of parity data storage extents for a virtual RAID is disclosed. A virtual RAID can be enabled by a virtual storage device pool (VSDP) mapped to a physical storage device pool (PSDP) that can comprise physical extents of physical disks. In an aspect, the physical disks can be co-located, remotely located, or combinations thereof. Mapping of the VSDP can enable allocation of virtual extents in a virtual RAID that can, for example, emulate a RAID4 while still providing parity data storage diversity that can, for example, emulate RAID5, RAID6, etc. Moreover, the disclosed subject matter can support proactive wear leveling, for example, based on historical storage of parity data via an extent, e.g., extents previously used to store parity data. Furthermore, the disclosed subject matter can support active wear leveling.
-
-
-
-
-
-
-
-
-
搜索结果
311 条记录 (耗时 0.052 秒)
