IP Library Granted Patent US 12,602,384
Granted Patent B2
US 12,602,384 · App. 18/642,424 · Granted Apr 14, 2026

Methods for enhancing rapid data analysis

Inventors: Robert Johnson (Palo Alto, CA); Oleksandr Barykin (Sunnyvale, CA); Alex Suhan (Menlo Park, CA); Lior Abraham (San Francisco, CA); Don Fossgreen (Scotts Valley, CA)
Assignee: Scuba Analytics, Inc.
G06F16/24554G06F16/278H04L63/1425
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,602,384
App. No.
18/642,424
Granted
Apr 14, 2026
Kind
B2
Abstract

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.

Claims (38)

1 . A system, comprising:

a database, wherein data in the database is partitioned into a plurality of data shards; and

a processing subsystem configured to:

receive a query;

identify a set of relevant data shards from the plurality of data shards containing data relevant to the query;

determine a data sample, by:

selecting a subset of the set of relevant data shards according to a set of sampling parameters; and

collecting the data sample from the subset of the set of relevant data shards; and

calculate a result based on an analysis of the data sample.

2 . The system of claim 1 , wherein the subset of the set of relevant data shards comprises a representative sample of a broader population.

3 . The system of claim 1 , wherein each data shard in the plurality of data shards comprises data from an intersection of a subset of rows in the data in the database and a subset of columns of the data in the database.

4 . The system of claim 1 , further comprising a distributed computing system comprising a plurality of data nodes storing the plurality of data shards.

5 . The system of claim 4 , wherein the plurality of data shards are distributed across the plurality of data nodes such that each data node stores data representative of a broader population.

6 . The system of claim 1 , wherein the processing subsystem is further configured to determine a confidence parameter for an accuracy of the result, wherein the set of sampling parameters are determined based on a target confidence parameter.

7 . The system of claim 1 , wherein the result comprises an intermediate calculation for a first pass, wherein the processing subsystem is configured to perform a multipass method comprising at least the first pass and a final pass, the final pass comprising:

determining a final data sample based on the intermediate calculation and a final set of sampling parameters; and

determining a final result based on the final data sample, wherein the processing system is configured to return the final result.

8 . The system of claim 7 , wherein the final set of sampling parameters is different from the set of sampling parameters.

9 . The system of claim 1 , wherein the processing subsystem is further configured to: identify anomalous data in the database, wherein the analysis of the data sample is based on weights assigned to the anomalous data and non-anomalous data, wherein the weights are different for the anomalous data and the non-anomalous data.

10 . The system of claim 1 , wherein the processing subsystem is further configured to: identify data shards in the plurality of data shards containing anomalous data based on an analysis of a sharding structure of the plurality of data shards; and flag the anomalous data with metadata, wherein the data sample is determined based on the metadata.

11 . A system, comprising:

a processing subsystem configured to:

partition a dataset into a plurality of data shards, wherein each data shard of the plurality of data shards stores a representative sample of a population;

compress each data shard of the plurality of data shards;

receive a query;

collect a data sample from a subset of the plurality of data shards; and

calculate a result based on an analysis of the data sample.

12 . The system of claim 11 , wherein the processing subsystem is configured to partition the dataset into the plurality of data shards using vertical partitioning and horizontal partitioning.

13 . The system of claim 12 , wherein vertical partitioning comprises partitioning the dataset into vertical partitions, wherein each vertical partition comprises data for a subset of vertical fields of the dataset, wherein horizontal partitioning comprises partitioning each vertical partition into a predetermined number of horizontal partitions.

14 . The system of claim 13 , wherein each subset of vertical fields comprises a time field.

15 . The system of claim 11 , wherein the processing subsystem is further configured to:

identify data shards of the plurality of data shards containing anomalous data based on an analysis of a sharding structure of the plurality of data shards; and

flag the anomalous data with metadata, wherein the data sample is collected based on the metadata.

16 . The system of claim 15 , wherein analyzing the sharding structure of the plurality of data shards comprises identifying shard keys that are statistical outliers based on a number of entries for each shard key.

17 . The system of claim 11 , wherein the processing subsystem is further configured to: identify anomalous data in the dataset base, wherein the analysis of the data sample is based on weights assigned to the anomalous data and non-anomalous data, wherein the weights are different for the anomalous data and the non-anomalous data.

18 . The system of claim 11 , further comprising a distributed computing system comprising a plurality of nodes, wherein the processing subsystem is further configured to encode the plurality of data shards, and store the encoded plurality of data shards across the plurality of nodes.

19 . The system of claim 11 , wherein the query is determined by a user using a graphical user interface.

20 . The system of claim 11 , wherein the processing subsystem is further configured to return the result of the query.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2024
From: JOHNSON, ROBERT; BARYKIN, OLEKSANDR; SUHAN, ALEX; ABRAHAM, LIOR; FOSSGREEN, DON
To: INTERANA, INC.
Reel/Frame 067299/0866 →
CHANGE OF NAME Recorded May 2, 2024
From: INTERANA, INC.
To: SCUBA ANALYTICS, INC.
Reel/Frame 067305/0470 →
Continuity (6)
Continuation 17581835 · Jan 21, 2022
Continuation 16924613 · Jul 9, 2020
Continuation 16384603 · Apr 15, 2019
Continuation 15043333 · Feb 12, 2016
Provisional Application 62115404 · Feb 12, 2015
Related Publication 20240273102A1 · Aug 15, 2024
References Cited (162)
US 5335345A · Frieder et al. · 1994 [cited by applicant]
US 5668987A · Schneider · 1997 [cited by applicant]
US 5893090A · Friedman et al. · 1999 [cited by applicant]
US 5978791A · Farber et al. · 1999 [cited by applicant]
US 6606618B2 · Delo · 2003 [cited by applicant]
US 6691120B1 · Durrant · 2004 [cited by examiner]
US 6775681B1 · Bellamkonda et al. · 2004 [cited by applicant]
US 7010521B2 · Hinshaw et al. · 2006 [cited by applicant]
US 7213012B2 · Jakobsson et al. · 2007 [cited by applicant]
US 7587394B2 · Chang et al. · 2009 [cited by applicant]
US 7617235B2 · Srinivasan et al. · 2009 [cited by applicant]
US 8239383B2 · Santosuosso · 2012 [cited by applicant]
US 8356050B1 · Olston et al. · 2013 [cited by applicant]
US 8468132B1 · ONeill et al. · 2013 [cited by applicant]
US 8484162B2 · Prahlad et al. · 2013 [cited by applicant]
US 8751460B1 · Annapragada et al. · 2014 [cited by applicant]
US 8756209B2 · Do et al. · 2014 [cited by applicant]
US 8768870B1 · Corrado et al. · 2014 [cited by applicant]
US 8825752B1 · Madhavan · 2014 [cited by applicant]
US 8856169B2 · Zhang et al. · 2014 [cited by applicant]
US 8868580B2 · Gould et al. · 2014 [cited by applicant]
US 8903973B1 · Hindawi et al. · 2014 [cited by applicant]
US 8935318B1 · Konerding et al. · 2015 [cited by applicant]
US 8965915B2 · Ganti et al. · 2015 [cited by applicant]
US 9037747B1 · Vendrow · 2015 [cited by examiner]
US 9053167B1 · Swift et al. · 2015 [cited by applicant]
US 9054864B2 · Bosson · 2015 [cited by applicant]
US 9128877B1 · Cousins · 2015 [cited by applicant]
US 9171104B2 · Gotz et al. · 2015 [cited by applicant]
US 9195826B1 · Fang et al. · 2015 [cited by applicant]
US 9239851B1 · Messer et al. · 2016 [cited by applicant]
US 9246932B2 · Gorny et al. · 2016 [cited by applicant]
US 9251097B1 · Kumar et al. · 2016 [cited by applicant]
US 9280591B1 · Kharatishvili et al. · 2016 [cited by applicant]
US 9323758B1 · Stacey et al. · 2016 [cited by applicant]
US 9323809B2 · Johnson et al. · 2016 [cited by applicant]
US 9405763B2 · Prahlad et al. · 2016 [cited by applicant]
US 9411862B1 · Wang · 2016 [cited by examiner]
US 9424351B2 · Risvik et al. · 2016 [cited by applicant]
US 9465823B2 · Shergill et al. · 2016 [cited by applicant]
US 9547711B1 · Bee · 2017 [cited by examiner]
US 9740762B2 · Horowitz · 2017 [cited by examiner]
US 9747319B2 · Bestler · 2017 [cited by examiner]
US 9774401B1 · Borrill · 2017 [cited by applicant]
US 9843596B1 · Averbuch · 2017 [cited by examiner]
US 9900337B2 · Gorny et al. · 2018 [cited by applicant]
US 9959312B2 · Schneider · 2018 [cited by examiner]
US 10009732B1 · Rice et al. · 2018 [cited by applicant]
US 10146835B2 · Johnson et al. · 2018 [cited by applicant]
US 10148548B1 · Griffin et al. · 2018 [cited by applicant]
US 10198492B1 · O'Neill et al. · 2019 [cited by applicant]
US 10268835B2 · Beckman et al. · 2019 [cited by applicant]
US 10296507B2 · Johnson et al. · 2019 [cited by applicant]
US 10331695B1 · Stickle · 2019 [cited by applicant]
US 10423387B2 · Johnson · 2019 [cited by examiner]
US 10909113B2 · Fabijancic · 2021 [cited by examiner]
US 11030169B1 · Wu · 2021 [cited by examiner]
US 11550505B1 · Gupta · 2023 [cited by examiner]
US 20010032199A1 · Delo · 2001 [cited by applicant]
US 20020178151A1 · Chaudhuri et al. · 2002 [cited by applicant]
US 20030195872A1 · Senn · 2003 [cited by applicant]
US 20030212668A1 · Hinshaw et al. · 2003 [cited by applicant]
US 20040143756A1 · Munson et al. · 2004 [cited by applicant]
US 20040225639A1 · Jakobsson et al. · 2004 [cited by applicant]
US 20040230764A1 · Merchant et al. · 2004 [cited by applicant]
US 20040243568A1 · Wang et al. · 2004 [cited by applicant]
US 20050055254A1 · Schmidtberg et al. · 2005 [cited by applicant]
US 20050065914A1 · Chang et al. · 2005 [cited by applicant]
US 20050114369A1 · Gould et al. · 2005 [cited by applicant]
US 20050182762A1 · Srinivasan et al. · 2005 [cited by applicant]
US 20050223019A1 · Das et al. · 2005 [cited by applicant]
US 20060059439A1 · Hao et al. · 2006 [cited by applicant]
US 20060069955A1 · Oka et al. · 2006 [cited by applicant]
US 20060224793A1 · Purlia · 2006 [cited by applicant]
US 20070011193A1 · Coker · 2007 [cited by examiner]
US 20070118909A1 · Hertzog et al. · 2007 [cited by applicant]
US 20070150949A1 · Futamura et al. · 2007 [cited by applicant]
US 20070156379A1 · Kulkarni · 2007 [cited by examiner]
US 20070179993A1 · Arruza · 2007 [cited by applicant]
US 20070239716A1 · Weininger et al. · 2007 [cited by applicant]
US 20070294214A1 · Santosuosso · 2007 [cited by applicant]
US 20080022261A1 · Gooding · 2008 [cited by applicant]
US 20080091730A1 · Jung · 2008 [cited by examiner]
US 20080109423A1 · Barsness · 2008 [cited by examiner]
US 20080215576A1 · Zhao et al. · 2008 [cited by applicant]
US 20080250497A1 · Mullarkey et al. · 2008 [cited by applicant]
US 20090070752A1 · Alpern et al. · 2009 [cited by applicant]
US 20090271762A1 · Taylor et al. · 2009 [cited by applicant]
US 20100138919A1 · Peng et al. · 2010 [cited by applicant]
US 20100161492A1 · Harvey · 2010 [cited by examiner]
US 20100241629A1 · Tatemura · 2010 [cited by examiner]
US 20100274768A1 · Wang et al. · 2010 [cited by applicant]
US 20110196855A1 · Wable et al. · 2011 [cited by applicant]
US 20110213754A1 · Bindal et al. · 2011 [cited by applicant]
US 20120016633A1 · Wittenstein et al. · 2012 [cited by applicant]
US 20120036580A1 · Gorny et al. · 2012 [cited by applicant]
US 20120130997A1 · Risvik et al. · 2012 [cited by applicant]
US 20130091170A1 · Zhang et al. · 2013 [cited by applicant]
US 20130124574A1 · Brettin et al. · 2013 [cited by applicant]
US 20130159251A1 · Skrenta et al. · 2013 [cited by applicant]
US 20130173597A1 · Do et al. · 2013 [cited by applicant]
US 20130253888A1 · Yang · 2013 [cited by examiner]
US 20130290280A1 · Prahlad et al. · 2013 [cited by applicant]
US 20130304694A1 · Barreto et al. · 2013 [cited by applicant]
US 20130332931A1 · Malewicz et al. · 2013 [cited by applicant]
US 20130346417A1 · Sakurai et al. · 2013 [cited by applicant]
US 20140012814A1 · Bercovici et al. · 2014 [cited by applicant]
US 20140108380A1 · Gotz et al. · 2014 [cited by applicant]
US 20140108421A1 · Isaacson et al. · 2014 [cited by applicant]
US 20140123115A1 · Peretz · 2014 [cited by applicant]
US 20140157370A1 · Plattner et al. · 2014 [cited by applicant]
US 20140188805A1 · Vijayan · 2014 [cited by applicant]
US 20140201171A1 · Vijayan et al. · 2014 [cited by applicant]
US 20140214890A1 · Johnson · 2014 [cited by examiner]
US 20140280276A1 · Prasanna · 2014 [cited by examiner]
US 20140280287A1 · Ganti et al. · 2014 [cited by applicant]
US 20140330785A1 · Isherwood · 2014 [cited by examiner]
US 20140337491A1 · Barreto et al. · 2014 [cited by applicant]
US 20150032684A1 · Gupta · 2015 [cited by applicant]
US 20150039749A1 · Kwan · 2015 [cited by examiner]
US 20150067860A1 · Levow et al. · 2015 [cited by applicant]
US 20150088813A1 · Lahiri et al. · 2015 [cited by applicant]
US 20150095351A1 · Balikov et al. · 2015 [cited by applicant]
US 20150135320A1 · Coskun · 2015 [cited by examiner]
US 20150178305A1 · Mueller et al. · 2015 [cited by applicant]
US 20150186493A1 · Balmin et al. · 2015 [cited by applicant]
US 20150199224A1 · Mihnev · 2015 [cited by examiner]
US 20150213358A1 · Shelton et al. · 2015 [cited by applicant]
US 20150254307A1 · Johnson · 2015 [cited by examiner]
US 20150261776A1 · Attarde et al. · 2015 [cited by applicant]
US 20150261792A1 · Attarde et al. · 2015 [cited by applicant]
US 20150271284A1 · Hindawi et al. · 2015 [cited by applicant]
US 20150317340A1 · Sardina et al. · 2015 [cited by applicant]
US 20150317349A1 · Chao et al. · 2015 [cited by applicant]
US 20150347492A1 · Dickie · 2015 [cited by applicant]
US 20160021122A1 · Pevny · 2016 [cited by examiner]
US 20160036844A1 · Kopp · 2016 [cited by examiner]
US 20160078068A1 · Agrawal et al. · 2016 [cited by applicant]
US 20160080410A1 · Gorny et al. · 2016 [cited by applicant]
US 20160085839A1 · D'Halluin et al. · 2016 [cited by applicant]
US 20160103880A1 · Attaluri · 2016 [cited by examiner]
US 20160124663A1 · Mitkar et al. · 2016 [cited by applicant]
US 20160147797A1 · Dolph et al. · 2016 [cited by applicant]
US 20160154851A1 · Sugaya et al. · 2016 [cited by applicant]
US 20160154963A1 · Kumar et al. · 2016 [cited by applicant]
US 20160171071A1 · Beisiegel et al. · 2016 [cited by applicant]
US 20160306708A1 · Prahlad et al. · 2016 [cited by applicant]
US 20170024452A1 · Budalakoti · 2017 [cited by examiner]
US 20170103098A1 · Hu · 2017 [cited by examiner]
US 20170300490A1 · Kachemir et al. · 2017 [cited by applicant]
US 20230238849A1 · Kaltenberg · 2023 [cited by examiner]
JP 10232804 · 1998 [cited by applicant]
JP 10269248 · 1998 [cited by applicant]
JP 2005100392A · 2005 [cited by applicant]
JP 2012108635A · 2012 [cited by applicant]
JP 2013196565A · 2013 [cited by applicant]
WO 2010018178A1 · 2010 [cited by applicant]
WO 2010148415A1 · 2010 [cited by applicant]
WO 2013016620A2 · 2013 [cited by applicant]
WO 2013033123A2 · 2013 [cited by applicant]
Ekanayake, Jaliya, “Twister: a runtime for iterative mapreduce”, Proceedings of the 19th ACM international symposium on high performance distributed computing. 2010. (Year: 2010). [cited by applicant]
Kokoris-Kogias, Lefteris , “OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding”, IEEE Security & Privacy, May 22, 2018, San Fransisco. [cited by applicant]