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:
Feb. 21, 2023
Filed:
Oct. 02, 2017
Applicant:
Ocient Llc, Chicago, IL (US);
Inventors:
George Kondiles, Chicago, IL (US);
Rhett Colin Starr, Long Grove, IL (US);
Joseph Jablonski, Chicago, IL (US);
Assignee:
OCIENT, INC., Chicago, IL (US);
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/00 (2019.01); G06F 16/27 (2019.01); G06F 16/22 (2019.01); G06F 16/25 (2019.01); G06F 16/28 (2019.01); G06F 16/23 (2019.01); H04L 67/568 (2022.01); G06F 15/173 (2006.01); H04L 67/1097 (2022.01); G06F 12/02 (2006.01); G06F 13/16 (2006.01); G06F 13/28 (2006.01); G06F 13/42 (2006.01); G06F 3/06 (2006.01);
U.S. Cl.
CPC ...
G06F 16/27 (2019.01); G06F 12/0238 (2013.01); G06F 13/1673 (2013.01); G06F 13/28 (2013.01); G06F 13/4282 (2013.01); G06F 15/17331 (2013.01); G06F 16/22 (2019.01); G06F 16/2358 (2019.01); G06F 16/2365 (2019.01); G06F 16/25 (2019.01); G06F 16/285 (2019.01); H04L 67/1097 (2013.01); H04L 67/568 (2022.05); G06F 3/067 (2013.01); G06F 3/0656 (2013.01); G06F 2212/202 (2013.01); G06F 2213/0026 (2013.01); G06F 2213/0032 (2013.01);
Abstract
A massively parallel database management system includes an index store and a payload store including a set of storage systems of different temperatures. Both the index store and the storage system each include a list of clusters. Each cluster includes a set of nodes with storage devices forming a group of segments. Nodes and clusters are connected over high speed links. Each cluster receives data and splits the data into data rows based on a predetermined size. The data rows are randomly and evenly distributed between all nodes of the cluster.