IP Library Granted Patent US 12,204,591
Granted Patent B1
US 12,204,591 · App. 18/611,982 · Granted Jan 21, 2025

Apparatus and a method for heuristic re-indexing of stochastic data to optimize data storage and retrieval efficiency

Inventors: Barbara Sue Smith (Toronto, CA); Daniel J. Sullivan (Toronto, CA)
Assignee: The Strategic Coach Inc.
G06F16/906G06F16/9027
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,204,591
App. No.
18/611,982
Granted
Jan 21, 2025
Kind
B1
Abstract

An apparatus for heuristic re-indexing of stochastic data to optimize data storage and retrieval efficiency is disclosed. The apparatus includes at least processor and a memory communicatively connected to the processor. The memory instructs processor to receive raw data including at least two datasets. The memory instructs the processor to generate one or more associations as a function of a classification of the plurality of stochastic data within the second dataset to the plurality of deterministic data within the first dataset. The memory instructs the processor to reorganize the raw data as a function of the one or more associations. The memory instructs the processor to store the reorganized raw data in an index structure by implementing an indexing system as a function of the one or more associations, wherein the indexing system is further configured to dynamically adjust the index structure in response to additional raw data.

Claims (40)

1. An apparatus for heuristic re-indexing of stochastic data to optimize data storage and retrieval efficiency, wherein the apparatus comprises:

at least a processor; and

a memory communicatively connected to the at least a processor, wherein the memory contains instructions configuring the at least a processor to:

receive raw data, wherein the raw data comprises at least two datasets, wherein the at least two datasets comprise:

a first dataset having a plurality of deterministic data; and

a second dataset having a plurality of stochastic data;

generate one or more associations as a function of a classification of the plurality of stochastic data within the second dataset to the plurality of deterministic data within the first dataset, wherein the one or more associations are further generated using an association classifier trained using association training data wherein the association training data is iteratively updated as a function of historical input and output results of historical association classifiers;

reorganize the raw data as a function of the classified one or more associations; and

store the reorganized raw data in an index structure by implementing an indexing system as a function of the classified one or more associations, wherein the indexing system is further configured to dynamically adjust the index structure in response to additional raw data.

2. The apparatus of claim 1 , wherein the one or more associations are reflected using one or more association scores.

3. The apparatus of claim 1 , wherein the one or more associations comprises at least an inherent stochastic relationship.

4. The apparatus of claim 1 , wherein generating the one or more associations comprises generating the one or more associations using a statistical model.

5. The apparatus of claim 1 , wherein reorganizing the raw data comprises generating one or more association clusters as a function of the one or more associations.

6. The apparatus of claim 5 , wherein generating one or more association clusters comprises generating the one or more association clusters using hierarchical clustering techniques.

7. The apparatus of claim 1 , wherein generating the one or more associations comprises:

iteratively training an association classifier using association training data, wherein the association training data comprises a plurality of deterministic data and a plurality of stochastic data as inputs correlated to examples of the one or more associations as outputs; and

classifying the plurality of stochastic data within the second dataset to the plurality of deterministic data within the first dataset using a trained association classifier; and

generating the one or more associations as a function of the classification.

8. The apparatus of claim 1 , wherein the index structure comprises a self-balancing tree structure.

9. The apparatus of claim 1 , wherein receiving the raw data comprises receiving the raw data using one or more tracking cookies.

10. The apparatus of claim 1 , wherein receiving the raw data comprises receiving the raw data using a web crawler.

11. A method for heuristic re-indexing of stochastic data to optimize data storage and retrieval efficiency, wherein the method comprises:

receiving, using at least a processor, raw data, wherein the raw data comprises at least two datasets, wherein the at least two datasets comprise:

a first dataset having a plurality of deterministic data; and

a second dataset having a plurality of stochastic data;

generating, using the at least a processor, one or more associations as a function of a classification of the plurality of stochastic data within the second dataset to the plurality of deterministic data within the first dataset, wherein the one or more associations are further generated using an association classifier trained using association training data wherein the association training data is iteratively updated as a function of historical input and output results of historical association classifiers;

reorganizing, using the at least a processor, the raw data as a function of the classified one or more associations; and

storing, using the at least a processor, the reorganized raw data in an index structure by implementing an indexing system as a function of the classified one or more associations, wherein the indexing system is further configured to dynamically adjust the index structure in response to additional raw data.

12. The method of claim 11 , wherein the one or more associations are reflected using one or more association scores.

13. The method of claim 11 , wherein the one or more associations comprises at least an inherent stochastic relationship.

14. The method of claim 11 , wherein generating the one or more associations comprises generating the one or more associations using a statistical model.

15. The method of claim 11 , wherein reorganizing the raw data comprises generating one or more association clusters as a function of the one or more associations.

16. The method of claim 15 , wherein generating one or more association clusters comprises generating the one or more association clusters using hierarchical clustering techniques.

17. The method of claim 11 , wherein generating the one or more associations comprises:

iteratively training an association classifier using association training data, wherein the association training data comprises a plurality of deterministic data and a plurality of stochastic data as inputs correlated to examples of the one or more associations as outputs; and

classifying the plurality of stochastic data within the second dataset to the plurality of deterministic data within the first dataset using a trained association classifier; and

generating the one or more associations as a function of the classification.

18. The method of claim 11 , wherein the index structure comprises a self-balancing tree structure.

19. The method of claim 11 , wherein receiving the raw data comprises receiving the raw data using one or more tracking cookies.

20. The method of claim 11 , wherein receiving the raw data comprises receiving the raw data using a web crawler.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 30, 2024
From: SMITH, BARBARA SUE; SULLIVAN, DANIEL J.
To: THE STRATEGIC COACH INC.
Reel/Frame 067098/0831 →
References Cited (21)
US 6731990B1 · Carter · 2004 [cited by examiner]
US 7840498B2 · Frank et al. · 2010 [cited by applicant]
US 10521526B2 · Haaland · 2019 [cited by examiner]
US 10891701B2 · Jessen et al. · 2021 [cited by applicant]
US 11861528B1 · Brager et al. · 2024 [cited by applicant]
US 20030074251A1 · Kumar · 2003 [cited by examiner]
US 20040073443A1 · Gabrick et al. · 2004 [cited by applicant]
US 20090234899A1 · Kramer · 2009 [cited by examiner]
US 20150199781A1 · Kim et al. · 2015 [cited by applicant]
US 20160292791A1 · Luessi · 2016 [cited by examiner]
US 20190258687A1 · Spangenberg et al. · 2019 [cited by applicant]
US 20210279564A1 · Antic · 2021 [cited by examiner]
US 20230376356A1 · Mahadik · 2023 [cited by examiner]
WO 2003012573A2 · 2003 [cited by applicant]
WO WO2007147166A2 · 2007 [cited by examiner]
Gülpinar, Nalan, et al., “Simulation and optimization approaches to scenario tree generation”, Journal of Economic Dynamics and Comtrol, vol. 28, Issue 7, Apr. 2004, pp. 1291-1315. [cited by examiner]
Prado, Thiago Lima, et al., “A direct method to detect deterministic and stochastic properties of data”, New Journal of Physics, vol. 24, IOP Publishing Ltd, Mar. 2022, 21 pages. [cited by examiner]
Halim, Felix, et al., “Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores”, Proc. of the VLDB Endowment, vol. 5, No. 6, Istanbul, Turkey, Aug. 27-31, 2012, pp. 502-513. [cited by examiner]
Kim, Sunhye & Yoon, Byungun. (Feb. 2021). Patent infringement analysis using a text mining technique based on SAO structure. Computers in Industry. 125. 103379. 10.1016/j.compind.2020.103379, 6 pages. [cited by applicant]
Song, Yewei et al. (Nov. 2019). Evaluation of a Patent value based on AHP fuzzy comprehensive evaluation method. Journal of Physics: Conference Series. 1345. 022023. 10.1088/1742-6596/1345/2/022023, 11 pages. [cited by applicant]
LexisNexis. (Jan. 4, 2023). Navigate the World of Standard Essential Patents and Standards' Contributions, 1 page. [cited by applicant]