Patents by Inventor Niv Dayan
Niv Dayan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11860844Abstract: A method for managing a log structured merged (LSM) tree of key value (KV) pairs, the LSM tree is stored in a non-volatile memory, the method may include merging runs of the LSM tree to provide merged runs; writing merged runs to the non-volatile memory; adding new runs to the LSM tree, wherein the adding comprises writing runs to the non-volatile memory; and updating at least one management data structure (MDS) to reflect the merging and the adding; wherein an MDS of the at least one MDS stores a mapping between keys of the KV pairs of the LSM tree, fingerprints associated with the KV pairs of the LSM tree, and compressed run identifiers that identify runs of the LSM tree.Type: GrantFiled: October 27, 2020Date of Patent: January 2, 2024Assignee: PLIOPS LTD.Inventors: Niv Dayan, Moshe Twitto
-
Publication number: 20230229651Abstract: A method for updating a log structured merged (LSM) tree, the method includes (a) performing preemptive full merge operations at first LSM tree levels; and (b) performing capacity triggered merge operations at second LSM tree levels while imposing one or more restrictions; wherein the second LSM tree levels comprise a largest LSM tree level and one or more other second LSM tree levels that are larger from each first LSM tree level; wherein files of the one or more other second LSM tree levels are aligned with files of the largest LSM tree level.Type: ApplicationFiled: January 18, 2023Publication date: July 20, 2023Applicant: Pliops Ltd.Inventors: Niv Dayan, Edward Bortnikov, Moshe Twitto
-
Patent number: 11675694Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups and storage space. The improved approach involves use of a new merge policy that removes merge operations from all but the largest levels of LSM-tree. In addition, the improved approach may include an improved LSM-tree that allows separate control over the frequency of merge operations for the largest level and for all other levels. By adjusting various parameters, such as the storage capacity of the largest level, the storage capacity of the other smaller levels, and/or the size ratio between adjacent levels in the improved LSM-tree, the improved LSM-tree-based key-value approach may maximize throughput for a particular workload.Type: GrantFiled: July 15, 2021Date of Patent: June 13, 2023Assignee: President and Fellows of Harvard CollegeInventors: Stratos Idreos, Niv Dayan
-
Patent number: 11567952Abstract: Embodiments of the invention utilize a “data canopy” that breaks statistical measures down to basic primitives for various data portions and stores the basic aggregates in a library within an in-memory data structure. When a queried statistical measure involves a basic aggregate stored in the library over a data portion that at least partially overlaps the data portion associated with the basic aggregate, the basic aggregate may be reused in the statistical computation of the queried measure.Type: GrantFiled: April 23, 2018Date of Patent: January 31, 2023Assignee: PRESIDENT AND FELLOWS OF HARVARD COLLEGEInventors: Stratos Idreos, Wasay Abdul, Niv Dayan
-
Patent number: 11392644Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups with any given main memory budget. The improved approach involves allocating memory to Bloom filters differently across different levels so as to minimize the sum of the false positive rates associated with the Bloom filters. In addition, the improved approach may predict the impact of the system design parameter(s) and/or environmental parameter(s) on the lookup performance. Subsequently, the improved approach may “self-tune” the system design parameter(s) and/or environment parameter(s) to maximize the throughput.Type: GrantFiled: January 9, 2018Date of Patent: July 19, 2022Assignee: PRESIDENT AND FELLOWS OF HARVARD COLLEGEInventors: Stratos Idreos, Niv Dayan, Manoussos Gavriil Athanassoulis
-
Patent number: 11372823Abstract: Embodiments of the present invention provide a new multi-level data structure, log-structured merge bush (LSM-bush), to alleviate the performance compromise between LSH-table and LSM-tree data structures. Similar to LSM-tree, LSM-bush may buffer writes in memory, merge the writes as sorted runs across multiple levels in storage, and use in-memory fence pointers and Bloom filters to facilitate lookups. LSM-bush differs from LSM-tree in that it allows newer data to be merged more “lazily” than LSM-tree. This can be achieved by allowing larger numbers of runs to be collected at the smaller levels before merging them.Type: GrantFiled: January 27, 2020Date of Patent: June 28, 2022Assignee: President and Fellows of Harvard CollegeInventors: Niv Dayan, Stratos Idreos
-
Publication number: 20220075552Abstract: A method for managing a log structured merged (LSM) tree of key value (KV) pairs, the LSM tree is stored in a non-volatile memory, the method may include writing a current run from a buffer to a current run location within the LSM tree, the current run comprises current KV pairs; generating or receiving current fingerprints that are indicative of the current KV pairs; performing a run writing update of a management data structure (MDS) by adding to the MDS, mappings between the current KV pairs, the current fingerprints and a current run identifier; updating the LSM tree by merging at least some runs of the LSM tree; and performing a merge update of the MDS to represent the merging.Type: ApplicationFiled: October 27, 2020Publication date: March 10, 2022Applicant: Pliops Ltd.Inventors: Niv Dayan, Moshe Twitto
-
Publication number: 20220075765Abstract: A method for managing a log structured merged (LSM) tree of key value (KV) pairs, the LSM tree is stored in a non-volatile memory, the method may include merging runs of the LSM tree to provide merged runs; writing merged runs to the non-volatile memory; adding new runs to the LSM tree, wherein the adding comprises writing runs to the non-volatile memory; and updating at least one management data structure (MDS) to reflect the merging and the adding; wherein an MDS of the at least one MDS stores a mapping between keys of the KV pairs of the LSM tree, fingerprints associated with the KV pairs of the LSM tree, and compressed run identifiers that identify runs of the LSM treeType: ApplicationFiled: October 27, 2020Publication date: March 10, 2022Applicant: Pliops Ltd.Inventors: Niv Dayan, Moshe Twitto
-
Publication number: 20210342259Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups and storage space. The improved approach involves use of a new merge policy that removes merge operations from all but the largest levels of LSM-tree. In addition, the improved approach may include an improved LSM-tree that allows separate control over the frequency of merge operations for the largest level and for all other levels. By adjusting various parameters, such as the storage capacity of the largest level, the storage capacity of the other smaller levels, and/or the size ratio between adjacent levels in the improved LSM-tree, the improved LSM-tree-based key-value approach may maximize throughput for a particular workload.Type: ApplicationFiled: July 15, 2021Publication date: November 4, 2021Inventors: Stratos IDREOS, Niv DAYAN
-
Patent number: 11151028Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups and storage space. The improved approach involves use of a new merge policy that removes merge operations from all but the largest levels of LSM-tree. In addition, the improved approach may include an improved LSM-tree that allows separate control over the frequency of merge operations for the largest level and for all other levels. By adjusting various parameters, such as the storage capacity of the largest level, the storage capacity of the other smaller levels, and/or the size ratio between adjacent levels in the improved LSM-tree, the improved LSM-tree-based key-value approach may maximize throughput for a particular workload.Type: GrantFiled: January 22, 2019Date of Patent: October 19, 2021Assignee: PRESIDENT AND FELLOWS OF HARVARD COLLEGEInventors: Stratos Idreos, Niv Dayan
-
Publication number: 20210279237Abstract: Embodiments of the invention utilize a “data canopy” that breaks statistical measures down to basic primitives for various data portions and stores the basic aggregates in a library within an in-memory data structure. When a queried statistical measure involves a basic aggregate stored in the library over a data portion that at least partially overlaps the data portion associated with the basic aggregate, the basic aggregate may be reused in the statistical computation of the queried measure.Type: ApplicationFiled: April 23, 2018Publication date: September 9, 2021Inventors: Stratos IDREOS, Wasay ABDUL, Niv DAYAN
-
Publication number: 20200341889Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups and storage space. The improved approach involves use of a new merge policy that removes merge operations from all but the largest levels of LSM-tree. In addition, the improved approach may include an improved LSM-tree that allows separate control over the frequency of merge operations for the largest level and for all other levels. By adjusting various parameters, such as the storage capacity of the largest level, the storage capacity of the other smaller levels, and/or the size ratio between adjacent levels in the improved LSM-tree, the improved LSM-tree-based key-value approach may maximize throughput for a particular workload.Type: ApplicationFiled: January 22, 2019Publication date: October 29, 2020Inventors: Stratos IDREOS, Niv DAYAN
-
Publication number: 20200250148Abstract: Embodiments of the present invention provide a new multi-level data structure, log-structured merge bush (LSM-bush), to alleviate the performance compromise between LSH-table and LSM-tree data structures. Similar to LSM-tree, LSM-bush may buffer writes in memory, merge the writes as sorted runs across multiple levels in storage, and use in-memory fence pointers and Bloom filters to facilitate lookups. LSM-bush differs from LSM-tree in that it allows newer data to be merged more “lazily” than LSM-tree. This can be achieved by allowing larger numbers of runs to be collected at the smaller levels before merging them.Type: ApplicationFiled: January 27, 2020Publication date: August 6, 2020Inventors: Niv DAYAN, Stratos IDREOS
-
Publication number: 20200057782Abstract: Embodiments of the invention utilize an improved LSM-tree-based key-value approach to strike the optimal balance between the costs of updates and lookups with any given main memory budget. The improved approach involves allocating memory to Bloom filters differently across different levels so as to minimize the sum of the false positive rates associated with the Bloom filters. In addition, the improved approach may predict the impact of the system design parameter(s) and/or environmental parameter(s) on the lookup performance. Subsequently, the improved approach may “self-tune” the system design parameter(s) and/or environment parameter(s) to maximize the throughput.Type: ApplicationFiled: January 9, 2018Publication date: February 20, 2020Inventors: Stratos Idreos, Niv Dayan, Manos Athanassoulis
-
Publication number: 20170249257Abstract: Embodiments of the present invention include a method for storing a data page d on a solid-state storage device, wherein the solid-state storage device is configured to maintain a mapping table in a Log-Structure Merge (LSM) tree having a C0 component which is a random access memory (RAM) device and a C1 component which is a flash-based memory device. Methods comprise: writing the data page d at a physical storage page having physical storage page address P in the storage device in response to receiving a write request to store the data page d at a logical storage page having a logical storage page address L; caching a new mapping entry e(L,P) associating the logical storage page address L with the physical storage page address P; providing an update indication for the cached new mapping entry to indicate that the cached new mapping entry shall be inserted in the C1 component; and evicting the new mapping entry from the cache. Corresponding solid-state storage device is also provided.Type: ApplicationFiled: February 29, 2016Publication date: August 31, 2017Inventors: Philippe Bonnet, Niv Dayan