The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Sep. 03, 2024
Filed:
Nov. 03, 2022
Applicant:
Xetdata Inc., Seattle, WA (US);
Inventors:
Assignee:
XETDATA INC., Seattle, WA (US);
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/00 (2019.01); G06F 16/11 (2019.01); G06F 16/13 (2019.01); G06F 16/185 (2019.01); G06F 16/215 (2019.01); G06F 16/22 (2019.01); G06F 16/25 (2019.01); H04L 9/06 (2006.01);
U.S. Cl.
CPC ...
G06F 16/137 (2019.01); G06F 16/116 (2019.01); G06F 16/185 (2019.01); G06F 16/215 (2019.01); G06F 16/2246 (2019.01); G06F 16/2255 (2019.01); G06F 16/258 (2019.01); H04L 9/0643 (2013.01);
Abstract
In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.