IP Library › Granted Patent US 12,271,382
Granted Patent B2
US 12,271,382 · App. 18/180,065 · Granted Apr 8, 2025

Query prediction modeling for distributed databases

Inventors: Charles Howard Cella (Pembroke, MA); Andrew Cardno (San Diego, CA)
Assignee: Strong Force VCN Portfolio 2019, LLC
G06F16/2455G05D1/0291G05D1/69G06F16/182G06F16/24537G06F16/24544G06F16/24552G06F16/2456G06F16/2462G06F16/2471G06F16/27G06F16/278G06Q10/06315G06Q10/0833G06Q10/087G06Q20/389G06Q30/0202G06Q30/0206G06V10/774H04N23/675G05B2219/49023G06Q2220/00
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,271,382
App. No.
18/180,065
Filed
Mar 7, 2023
Granted
Apr 8, 2025
Kind
B2
Art Unit
2164
USPC
707/737
Abstract

A computer-implemented method for optimizing a distributed database includes receiving, at an aggregator, one or more query logs comprising past queries received by the distributed database. The method includes generating, by the aggregator, a query prediction model based on the one or more query logs. The method includes predicting, by the aggregator, a future query using the query prediction model. The predicted future query is predicted to be received by an edge device. The method includes causing, by the aggregator, data for responding to the predicted future query to be transmitted to the edge device.

Claims (59)

1. A computer-implemented method for optimizing a distributed database, the method comprising:

receiving, at an aggregator, one or more query logs including one or more past queries received by the distributed database;

generating, by the aggregator, a query prediction model based on the one or more query logs;

predicting, by the aggregator, a future query to be received by a first edge device, wherein the aggregator performs the predicting using the query prediction model;

in response to the predicted future query being directed to a data set stored in edge storage of a second edge device, transmitting, by the aggregator, data for responding to the predicted future query to the first edge device via one or more networks,

wherein the data set includes sensor data, and

wherein the transmitting includes causing, by the aggregator, a subset of the data set to be stored as a redundant data set in edge storage of the first edge device;

generating, by the query prediction model, summary data based on the redundant data set;

storing the summary data on a dynamic ledger maintained by the aggregator,

wherein the dynamic ledger includes location information that indicates storage locations in at least one of the edge storage of the first edge device or the edge storage of the second edge device for the sensor data, and

wherein the dynamic ledger includes edge device role data that defines roles for the first edge device and the second edge device; and

responding, by the first edge device, to a future query based at least partially on the summary data.

2. The method of claim 1 wherein the data for responding to the predicted future query includes data stored at the second edge device.

3. The method of claim 1 further comprising:

locating the data for responding to the predicted future query using a shard algorithm,

wherein the shard algorithm is associated with a set of lookup tables that is used to locate the data for responding to the predicted future query in the distributed database.

4. The method of claim 3 wherein the shard algorithm is a neural network algorithm for partitioning of data that is local to an edge cluster of the distributed database.

5. The method of claim 3 wherein the shard algorithm is a genetic algorithm for partitioning of data that is local to an edge cluster of the distributed database.

6. The method of claim 3 wherein the shard algorithm is a logical algorithm for partitioning of data within an edge cluster based on a set of logical rules.

7. The method of claim 1 ,

wherein the second edge device is connected to a set of sensors and is configured to maintain the sensor data generated via the set of sensors in the edge storage of the second edge device, and

wherein the summary data includes at least one of: an average of the sensor data by region, an average of the sensor data by time, a maximum of the sensor data by region, a maximum of the sensor data by time, a minimum of the sensor data by region, or a minimum of the sensor data by time.

8. The method of claim 1 wherein the summary data includes at least one of statistical data or outlier data.

9. The method of claim 1 further comprising instructing, by the aggregator, the second edge device to generate additional summary data.

10. The method of claim 1 wherein the dynamic ledger is a blockchain.

11. The method of claim 1 wherein the data for responding to the predicted future query is a probability distribution model.

12. The method of claim 11 further comprising generating the probability distribution model based on data stored at the second edge device.

13. The method of claim 11 further comprising storing the probability distribution model on the dynamic ledger.

14. The method of claim 1 wherein the future query is an edge query language (EDQL) query.

15. The method of claim 1 wherein the data for responding to the predicted future query is based on the sensor data.

16. The method of claim 1 wherein the distributed database includes a mesh network of edge devices.

17. The method of claim 1 wherein the predicted future query is a distributed join query such that the distributed database is configured to execute any join query.

18. The method of claim 1 wherein the data for responding to the predicted future query is a reference table that is replicated on one or more devices in a cluster.

19. A system for optimizing a distributed database, the system comprising:

a first edge device communicatively coupled to a first edge storage, wherein the first edge device includes processing hardware and storage hardware;

a second edge device communicatively coupled to a second edge storage, wherein the second edge device includes processing hardware and storage hardware; and

an aggregator communicatively coupled to the first edge device and the second edge device,

wherein the aggregator includes processing hardware and storage hardware,

wherein the aggregator is configured to:

receive, from at least one of the first edge device or the second edge device, one or more query logs including one or more past queries received by the distributed database, wherein the one or more query logs are stored in at least one of the first edge storage or the second edge storage;

generate a query prediction model based on the one or more query logs;

predict a future query to be received by the first edge device using the query prediction model;

in response to the predicted future query being directed to a data set stored in the second edge storage, transmit data for responding to the predicted future query to the first edge device via one or more networks, including cause a subset of the data set to be stored as a redundant data set in the first edge storage, wherein the data set includes sensor data;

generate summary data based on the redundant data set using the query prediction model; and

store the summary data on a dynamic ledger,

wherein the dynamic ledger includes location information that indicates storage locations in at least one of the first edge storage or the second edge storage for the sensor data,

wherein the dynamic ledger includes edge device role data that defines roles for the first edge device and the second edge device, and

wherein the first edge device is configured to respond to the future query based at least partially on the summary data.

20. The system of claim 19 ,

wherein the aggregator is configured to locate edge data for responding to the predicted future query using a shard algorithm, and

wherein the shard algorithm is at least one of: a neural network algorithm, a genetic algorithm, or a logical algorithm.

21. The method of claim 1 ,

wherein the redundant data set includes a smaller volume of data than the data set, and

wherein the first edge device generates a response to a future query based on the redundant data set faster than a response to a future data query based on the data set.

22. The method of claim 1 further comprising:

receiving, by the first edge device, a plurality of data queries; and

reducing a failure rate for responding to the plurality of data queries by responding, by the first edge device, to the plurality of data queries based on the redundant data set.

23. The method of claim 1 wherein the causing the subset of the data set to be stored as the redundant data set in the edge storage of the first edge device enables the distributed database to be fault tolerant to a cyberattack to the second edge device.

24. The system of claim 19 wherein the redundant data set includes at least some of the sensor data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 13, 2023
From: CELLA, CHARLES HOWARD; CARDNO, ANDREW
To: STRONG FORCE VCN PORTFOLIO 2019, LLC
Reel/Frame 064242/0531 →
Priority Claims (1)
IN 202211008709 · Feb 18, 2022 · national
Continuity (6)
Continuation PCTUS2022028633 · May 10, 2022
Provisional Application 63302013 · Jan 21, 2022
Provisional Application 63299710 · Jan 14, 2022
Provisional Application 63282507 · Nov 23, 2021
Provisional Application 63187325 · May 11, 2021
Related Publication 20230252047A1 · Aug 10, 2023
References Cited (94)
US 6829654B1 · Jungck · 2004 [cited by applicant]
US 9582603B1 · Acharya · 2017 [cited by examiner]
US 10642847B1 · Nerurkar et al. · 2020 [cited by applicant]
US 10938634B1 · Cruise · 2021 [cited by examiner]
US 10986173B1 · Thomason · 2021 [cited by applicant]
US 11438221B1 · Cruise · 2022 [cited by applicant]
US 11762442B1 · Merli · 2023 [cited by applicant]
US 20020073086A1 · Thompson · 2002 [cited by applicant]
US 20070240061A1 · Cormode · 2007 [cited by applicant]
US 20080009968A1 · Bruemmer · 2008 [cited by applicant]
US 20110238468A1 · Shen · 2011 [cited by examiner]
US 20130211870A1 · Lawson · 2013 [cited by applicant]
US 20130268520A1 · Fisher · 2013 [cited by applicant]
US 20140222610A1 · Mikurak · 2014 [cited by applicant]
US 20140365258A1 · Vestal et al. · 2014 [cited by applicant]
US 20150088807A1 · Toppin · 2015 [cited by applicant]
US 20150312125A1 · Subramanian · 2015 [cited by examiner]
US 20160203407A1 · Sasaki et al. · 2016 [cited by applicant]
US 20160236867A1 · Brazeau et al. · 2016 [cited by applicant]
US 20170032281A1 · Hsu · 2017 [cited by applicant]
US 20170057081A1 · Krohne et al. · 2017 [cited by applicant]
US 20180136633A1 · Small et al. · 2018 [cited by applicant]
US 20180157688A1 · Zessin · 2018 [cited by examiner]
US 20180322157A1 · Lee · 2018 [cited by examiner]
US 20190042878A1 · Sheller · 2019 [cited by examiner]
US 20190050854A1 · Yang et al. · 2019 [cited by applicant]
US 20190138662A1 · Deutsch et al. · 2019 [cited by applicant]
US 20190266278A1 · Park · 2019 [cited by applicant]
US 20190278527A1 · Yeung et al. · 2019 [cited by applicant]
US 20190317935A1 · Berti et al. · 2019 [cited by applicant]
US 20190347358A1 · Mishra et al. · 2019 [cited by applicant]
US 20200012966A1 · Nagaraju · 2020 [cited by applicant]
US 20200019935A1 · Jan et al. · 2020 [cited by applicant]
US 20200050612A1 · Bhattacharjee · 2020 [cited by applicant]
US 20200097582A1 · Jedek · 2020 [cited by examiner]
US 20200104730A1 · Strong · 2020 [cited by applicant]
US 20200111092A1 · Wood et al. · 2020 [cited by applicant]
US 20200118131A1 · Diriye et al. · 2020 [cited by applicant]
US 20200153627A1 · Wentz · 2020 [cited by examiner]
US 20200160288A1 · Bauerschmidt et al. · 2020 [cited by applicant]
US 20200184559A1 · Crumb et al. · 2020 [cited by applicant]
US 20200184560A1 · Crumb et al. · 2020 [cited by applicant]
US 20200184565A1 · Crumb et al. · 2020 [cited by applicant]
US 20200193449A1 · Crumb et al. · 2020 [cited by applicant]
US 20200210966A1 · Nuthi et al. · 2020 [cited by applicant]
US 20200272664A1 · Aggour · 2020 [cited by applicant]
US 20200273278A1 · Sotereanos · 2020 [cited by applicant]
US 20200294128A1 · Cella · 2020 [cited by applicant]
US 20200294129A1 · Cella · 2020 [cited by applicant]
US 20200294142A1 · Edkins et al. · 2020 [cited by applicant]
US 20200372104A1 · Calix · 2020 [cited by applicant]
US 20210084105A1 · Shadmon et al. · 2021 [cited by applicant]
US 20210118166A1 · Temblay et al. · 2021 [cited by applicant]
US 20210133669A1 · Cella et al. · 2021 [cited by applicant]
US 20210138656A1 · Gothoskar et al. · 2021 [cited by applicant]
US 20210166188A1 · Enderby et al. · 2021 [cited by applicant]
US 20210178575A1 · Riek et al. · 2021 [cited by applicant]
US 20210201236A1 · Makhija et al. · 2021 [cited by applicant]
US 20210342339A1 · Renner · 2021 [cited by applicant]
US 20210383523A1 · Simson et al. · 2021 [cited by applicant]
US 20220044117A1 · Song · 2022 [cited by applicant]
US 20220198782A1 · Zhang · 2022 [cited by examiner]
CN 104036007B · 2017 [cited by applicant]
EP 4180953A1 · 2023 [cited by applicant]
KR 20140054897A · 2014 [cited by applicant]
WO 2014015492A1 · 2014 [cited by applicant]
WO 2018172593A2 · 2018 [cited by applicant]
WO 2020142499A1 · 2020 [cited by applicant]
WO 2019070644A2 · 2021 [cited by applicant]
Fryer et al., “Configuring robots from modules: an object oriented approach”, Advanced Robotics, 1997. ICAR '97. Proceedings., 8th International Conference on Monterey, CA, USA Jul. 7-9, 1997, New York, NY, USA, IEEE, U… [cited by applicant]
Craye et al., “BioVision: A Biomimetics Platform for Intrinsically Motivated Visual Saliency Learning”, IEEE Transactions on Cognitive and Developmental Systems, IEEE, vol. 11, No. 3, Sep. 1, 2019, ISSN 2379-8920, pp. 3… [cited by applicant]
Anonymous, “Datasheet: EL-10-30-Series Fast Electrically Tunable Lens Electrical specifications”, Opto Tune, Dec. 10, 2019, pp. 1-16, URL: /https://prologoptics.com/wp-content/uploads/OptotuneEL-10-30.pdf. [cited by applicant]
Kiviat, Trevor, “‘Smart’ Contract Markets: Trading Derivatives Contracts on the Blockchain”, Apr. 2015, URL: https://www.academia.edu/10766594/Smart_Contract_Markets_Trading_Derivatives_on_the_Blockchain. [cited by applicant]
Wise et al., “Legal smart contracts for derivative trading in mining”, Knowledge Engineering Review., Cambridge University Press, vol. 35, Jan. 1, 2020. [cited by applicant]
Bterrell Group, “RPA's role in automation in finance for midmarket financial services companies”, Sep. 28, 2020, URL: https://web.archive.org/web/20200928211033/https://www.bterrell.com/robotic-process.automation-rpa/fi… [cited by applicant]
Sharma, “What Happens when RPA and Blockchain Work Together?”, Blockchain Council, Jun. 12, 2020, URL: https://www.blockchain-council.org/blockchain/what-happens-when-rpa-and-blockchain-work-together/. [cited by applicant]
Harvest Public Media, “Futures Market Explained”, Youtube, May 25, 2016, URL: https://www.youtube.com/watch?v=CC9VeHr13Es. [cited by applicant]
Wilson, “Accenture: building suply chain resilience amidst COVID-19”, Supply Chain Magazine, May 17, 2020. [cited by applicant]
Schatteman, “Supply Chain Lessons from Covid-19: Time to Refocus on Resilience”, Bain & Company, 2020. [cited by applicant]
Ganeriwalla et al., “Three Paths to Advantage with Digital Supply Chains”, BCG Perspectives, 2016. [cited by applicant]
Deloitte, “Digital Technologies Dirve Supply Chain Innovation”, CIO Journal , Sep. 26, 2018. [cited by applicant]
Kelly et al., “Supply chains and value webs”, Deloitte University Press, 2015. [cited by applicant]
IW Staff, “75% of Companies in ISM Virus Survey Report Supply Chain Disruptions”, Industry Week, Mar. 11, 2020. [cited by applicant]
MHI Deloitte, “8. 2019 MHI Annual Industry Report: Elevating Supply Chain Digital Consciousness”, 2019. [cited by applicant]
PwC, “PwC's COVID-19 CFO Pulse”, Jun. 2020. [cited by applicant]
CB Insights, “Supply Chain & Logistics Tech in Numbers” Powerpoint presentation; Jul. 2020. [cited by applicant]
O'Leary, “The Modern Supply Chain is Snapping”, The Atlantic, Mar. 19, 2020. [cited by applicant]
Bukova et al., “The Position of Industry 4.0 in the Worldwide Logistics Chain”, LOGI—Scientific Journal on Transport and Logistics, vol. 9, No. 1, 2018, pp. 18-23. [cited by applicant]
Lin et al., “Here's how global supply chains will change after COVID-19”, World Economic Forum, May 6, 2020. [cited by applicant]
Ferrantino et al., “Understanding Supply Chain 4.0 and its potential impact on global value chains”, Apr. 2017. [cited by applicant]
Anonymous, “AI Set to Drive Global Supply Chain Technology Market to $440 Billion by 2023”, ABI Research, Jan. 29, 2019. [cited by applicant]
Howells, “How the network economy is revolutionizing supply chains”, World Economic Forum, Jan. 14, 2015. [cited by applicant]
WIPO, International Search Report for PCT/US2022/028633, issued Sep. 23, 2022. [cited by applicant]
WIPO, Written Opinion of the International Searching Authority for PCT/US2022/028633, issued Sep. 23, 2022. [cited by applicant]
Cited By (2)
US 12,514,675 US 12,725,090