US 11,809,396 B2
Tree-like metadata structure for composite datasets
George Aleksandrovich, Hoffman Estates, IL (US); Allie K. Watfa, Urbana, IL (US); Robin Sahner, Urbana, IL (US); and Mike Pippin, Sunnyvale, CA (US)
Assigned to YAHOO ASSETS LLC, New York, NY (US)
Filed by YAHOO ASSETS LLC, Dulles, VA (US)
Filed on Nov. 21, 2022, as Appl. No. 18/057,552.
Application 18/057,552 is a continuation of application No. 16/727,172, filed on Dec. 26, 2019, granted, now 11,507,554.
Prior Publication US 2023/0086741 A1, Mar. 23, 2023
Int. Cl. G06F 16/2457 (2019.01); G06F 16/242 (2019.01); G06F 16/2455 (2019.01); G06F 16/22 (2019.01)
CPC G06F 16/2246 (2019.01) [G06F 16/2282 (2019.01); G06F 16/244 (2019.01); G06F 16/2456 (2019.01); G06F 16/24573 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
loading, by a processor, a plurality of datasets from a data storage device;
converting, by the processor, a tree representing the plurality of datasets into a plurality of terms of a corresponding algebraic relationship of the tree, each term in the plurality of terms comprising at least two factors, each of the at least two factors associated with a dataset in the plurality of datasets;
serializing, by the processor, and storing the plurality of terms in a metadata file associated with the plurality of datasets in the data storage device;
receiving, by the processor, a command to re-construct a composite dataset over a network;
loading, by the processor, the metadata file from the data storage device; and
re-constructing, by the processor, the composite dataset including the plurality of datasets in response to the command by generating at least one partial dataset based on the plurality of terms read from the metadata file.