Patents by Inventor Oleksandr Barykin
Oleksandr Barykin 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).
-
Publication number: 20220147530Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: ApplicationFiled: January 21, 2022Publication date: May 12, 2022Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Patent number: 11263215Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: GrantFiled: July 9, 2020Date of Patent: March 1, 2022Assignee: SCUBA ANALYTICS, INC.Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Publication number: 20200341985Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: ApplicationFiled: July 9, 2020Publication date: October 29, 2020Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Patent number: 10747767Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: GrantFiled: April 15, 2019Date of Patent: August 18, 2020Assignee: Interana, Inc.Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Publication number: 20190266163Abstract: Systems and methods for query processing. An event flow structure is defined, a query is received and interpreted, intermediate calculations are performed, and a query result is calculated.Type: ApplicationFiled: February 28, 2019Publication date: August 29, 2019Inventors: Robert Carlton Johnson, Oleksandr Barykin
-
Publication number: 20190243835Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: ApplicationFiled: April 15, 2019Publication date: August 8, 2019Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Patent number: 10296507Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: GrantFiled: February 12, 2016Date of Patent: May 21, 2019Assignee: Interana, Inc.Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Publication number: 20170147615Abstract: Techniques provided herein allow for management of data. In various embodiments, systems and methods prune and retain data being managed by a data management system, where the managed data can include log data aggregated from one or more servers for analysis purposes. According to some embodiments, pruning can be triggered according to one or more constraints, such as the age of managed data (e.g., retain only 30 days of managed data) or the memory space required to store the managed data (e.g., retain only 100 GB worth of managed data). The constraints that trigger data pruning can be based on a data retention policy. When triggered, pruning can be performed on a fraction of the managed data stored based on the data retention policy (e.g., 3 days of full managed data, 27 days of pruned managed data). The pruning may be performed by sampling, at a desired rate, the managed data.Type: ApplicationFiled: December 31, 2016Publication date: May 25, 2017Inventors: Oleksandr Barykin, Josh Metzler, Lior Abraham
-
Patent number: 9600503Abstract: Techniques provided herein allow for management of data. In various embodiments, systems and methods prune and retain data being managed by a data management system, where the managed data can include log data aggregated from one or more servers for analysis purposes. According to some embodiments, pruning can be triggered according to one or more constraints, such as the age of managed data (e.g., retain only 30 days of managed data) or the memory space required to store the managed data (e.g., retain only 100 GB worth of managed data). The constraints that trigger data pruning can be based on a data retention policy. When triggered, pruning can be performed on a fraction of the managed data stored based on the data retention policy (e.g., 3 days of full managed data, 27 days of pruned managed data). The pruning may be performed by sampling, at a desired rate, the managed data.Type: GrantFiled: July 25, 2013Date of Patent: March 21, 2017Assignee: Facebook, Inc.Inventors: Oleksandr Barykin, Josh Metzler, Lior Abraham
-
Patent number: 9501521Abstract: Techniques provided herein allow for estimating data missing in query results provided in response to queries performed on data managed by a data management system. In the event that one or more leaf nodes are unable or unavailable to process a query, a final query result provided in response to the original query may be missing data that exists on those leaf nodes. A data accounting service monitors what managed data is being stored on the leaf nodes and on what leaf node. The data accounting service can estimate how much data is missing from a final query result when one or more of the leaf nodes are unable or unavailable to process a query.Type: GrantFiled: July 25, 2013Date of Patent: November 22, 2016Assignee: Facebook, Inc.Inventors: Oleksandr Barykin, Josh Metzler
-
Patent number: 9442967Abstract: A query may be provided to aggregators at hierarchical levels in an in-memory data storage module. The query may be provided to leaf nodes of the in-memory data storage module. The leaf nodes may execute the query, returning results of the query to the aggregators. One or more aggregations may be performed based on the results. In an embodiment, log entries associated with a logged event may be serialized and divided into distributed chunks for storage in the leaf nodes. A leaf node, from the leaf nodes, having storage capacity for a distributed chunk may be identified. The distributed chunk may be stored in the leaf node.Type: GrantFiled: July 25, 2013Date of Patent: September 13, 2016Assignee: Facebook, Inc.Inventors: Oleksandr Barykin, Josh Metzler
-
Publication number: 20160241577Abstract: A method for enhancing rapid data analysis includes receiving a set of data; storing the set of data in a first set of data shards sharded by a first field; and identifying anomalous data from the set of data by monitoring a range of shard indices associated with a first shard of the first set of data shards, detecting that the range of shard indices is smaller than an expected range by a threshold value, and identifying data of the first shard as anomalous data.Type: ApplicationFiled: February 12, 2016Publication date: August 18, 2016Inventors: Robert Johnson, Oleksandr Barykin, Alex Suhan, Lior Abraham, Don Fossgreen
-
Patent number: 9128968Abstract: Event data comprising an unordered string set may be received. String set dictionary indexes may be assigned for strings of the unordered string set in a string set dictionary. The unordered string set may be sorted to provide a sorted series based on the string set dictionary indexes for the unordered string set. A differential series may be computed from the sorted series. The differential series may be encoded into binary code words. In an embodiment, the event data also may comprise strings. A schema version associated with the strings in a row may be determined. Computing resources may be allocated based on the schema version.Type: GrantFiled: July 25, 2013Date of Patent: September 8, 2015Assignee: Facebook, Inc.Inventors: Oleksandr Barykin, Josh Metzler
-
Publication number: 20150032726Abstract: Techniques provided herein allow for estimating data missing in query results provided in response to queries performed on data managed by a data management system. In the event that one or more leaf nodes are unable or unavailable to process a query, a final query result provided in response to the original query may be missing data that exists on those leaf nodes. A data accounting service monitors what managed data is being stored on the leaf nodes and on what leaf node. The data accounting service can estimate how much data is missing from a final query result when one or more of the leaf nodes are unable or unavailable to process a query.Type: ApplicationFiled: July 25, 2013Publication date: January 29, 2015Inventors: Oleksandr Barykin, Josh Metzler
-
Publication number: 20150032707Abstract: Techniques provided herein allow for management of data. In various embodiments, systems and methods prune and retain data being managed by a data management system, where the managed data can include log data aggregated from one or more servers for analysis purposes. According to some embodiments, pruning can be triggered according to one or more constraints, such as the age of managed data (e.g., retain only 30 days of managed data) or the memory space required to store the managed data (e.g., retain only 100 GB worth of managed data). The constraints that trigger data pruning can be based on a data retention policy. When triggered, pruning can be performed on a fraction of the managed data stored based on the data retention policy (e.g., 3 days of full managed data, 27 days of pruned managed data). The pruning may be performed by sampling, at a desired rate, the managed data.Type: ApplicationFiled: July 25, 2013Publication date: January 29, 2015Inventors: Oleksandr Barykin, Josh Metzler, Lior Abraham
-
Publication number: 20150032757Abstract: Event data comprising an unordered string set may be received. String set dictionary indexes may be assigned for strings of the unordered string set in a string set dictionary. The unordered string set may be sorted to provide a sorted series based on the string set dictionary indexes for the unordered string set. A differential series may be computed from the sorted series. The differential series may be encoded into binary code words. In an embodiment, the event data also may comprise strings. A schema version associated with the strings in a row may be determined. Computing resources may be allocated based on the schema version.Type: ApplicationFiled: July 25, 2013Publication date: January 29, 2015Inventors: Oleksandr Barykin, Josh Metzler
-
Publication number: 20150032725Abstract: A query may be provided to aggregators at hierarchical levels in an in-memory data storage module. The query may be provided to leaf nodes of the in-memory data storage module. The leaf nodes may execute the query, returning results of the query to the aggregators. One or more aggregations may be performed based on the results. In an embodiment, log entries associated with a logged event may be serialized and divided into distributed chunks for storage in the leaf nodes. A leaf node, from the leaf nodes, having storage capacity for a distributed chunk may be identified. The distributed chunk may be stored in the leaf node.Type: ApplicationFiled: July 25, 2013Publication date: January 29, 2015Inventors: Oleksandr Barykin, Josh Metzler