公开(公告)号：US12093262B2

公开(公告)日：2024-09-17

申请号：US18509455

申请日：2023-11-15

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/22 ,  G06F16/2453 ,  G06F16/2455

CPC classification number: G06F16/24554 ,  G06F16/221 ,  G06F16/24542

Abstract: A method includes obtaining a plurality of data partitions of a data set for storage in a database system. The method further includes determining a first data storage coding scheme for a first partition of the plurality of data partitions, where the first data storage coding scheme includes first encoding parameters regarding encoding the first partition into first data segments and first parity segments. The method further includes determining a second data storage coding scheme for a second partition of the plurality of data partitions. The method further includes dividing the first partition to produce a first number of first raw data segments, where the first number is based on the first data storage coding scheme. The method further includes dividing the second partition to produce a second number of second raw data segments, where the second number is based on the second data storage coding scheme.

公开(公告)号：US11977545B2

公开(公告)日：2024-05-07

申请号：US16267608

申请日：2019-02-05

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/2453 ,  G06F3/06 ,  G06F7/24 ,  G06F9/4401 ,  G06F9/50 ,  G06F11/10 ,  G06F12/0893 ,  G06F12/109 ,  G06F16/17 ,  G06F16/22 ,  G06F16/23 ,  G06F16/242 ,  G06F16/2455 ,  G06F16/2457 ,  G06F16/2458 ,  G06F16/27 ,  G06F16/901 ,  H03M7/30 ,  H04L67/10

CPC classification number: G06F16/24542 ,  G06F3/0604 ,  G06F3/0647 ,  G06F3/068 ,  G06F7/24 ,  G06F9/4406 ,  G06F9/5016 ,  G06F9/5027 ,  G06F9/5061 ,  G06F11/1004 ,  G06F11/1044 ,  G06F11/1076 ,  G06F12/0893 ,  G06F12/109 ,  G06F16/1727 ,  G06F16/22 ,  G06F16/2246 ,  G06F16/2282 ,  G06F16/2365 ,  G06F16/244 ,  G06F16/2445 ,  G06F16/2453 ,  G06F16/24553 ,  G06F16/24573 ,  G06F16/2458 ,  G06F16/278 ,  G06F16/901 ,  G06F16/9017 ,  H03M7/30 ,  H04L67/10 ,  G06F3/067 ,  G06F16/24547 ,  G06F2211/1011 ,  G06F2212/608

Abstract: A method includes receiving, by a first computing entity of a database system, a query request that is formatted in accordance with a generic query format. The method further includes generating, by the first computing entity, an initial query plan based on the query request and a query instruction set. The method further includes determining, by the first computing entity, storage parameters. The method further includes determining, by the first computing entity, processing resources for processing the query request based on the storage parameters. The method further includes generating, by the first computing entity, an optimized query plan from the initial query plan based on the storage parameters, the processing resources, and optimization tools. The method further includes sending, by the first computing entity, the optimized query plan to a second computing entity for distribution and execution of the optimized query plan.

公开(公告)号：US11971890B2

公开(公告)日：2024-04-30

申请号：US17806119

申请日：2022-06-09

Applicant: Ocient Inc.

Inventor： Jason Arnold ,  George Kondiles

IPC: G06F7/00 ,  G06F16/00 ,  G06F16/21 ,  G06F16/23 ,  G06F16/2453 ,  G06F16/2455 ,  G06F16/901

CPC classification number: G06F16/24542 ,  G06F16/21 ,  G06F16/23 ,  G06F16/24532 ,  G06F16/24545 ,  G06F16/2455 ,  G06F16/901

Abstract: A large highly parallel database management system includes thousands of nodes storing huge volume of data. The database management system includes multiple query optimizers for determining low cost execution plans for queries. The database management system is adapted to receive a data query. An execution plan generator component of the database management system generates an initial execution plan for the query. The initial execution plan is fed as input to more than one query optimizers. Each optimizer starts with the initial execution plan, generates alternative execution plans, and determines a satisfactory execution plan that incurs the lowest cost. The database management system compares the selected execution plans by the optimizers and selects one with the lowest cost. The multiple query optimizers run in parallel.

公开(公告)号：US11893018B2

公开(公告)日：2024-02-06

申请号：US18166103

申请日：2023-02-08

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/901 ,  G06F9/4401 ,  G06F9/50 ,  H04L67/10 ,  G06F3/06 ,  G06F12/0893 ,  G06F16/17 ,  G06F11/10 ,  G06F12/109 ,  G06F16/23 ,  G06F16/242 ,  H03M7/30 ,  G06F16/2457 ,  G06F16/2458 ,  G06F16/27 ,  G06F7/24

CPC classification number: G06F16/24542 ,  G06F3/0604 ,  G06F3/068 ,  G06F3/0647 ,  G06F7/24 ,  G06F9/4406 ,  G06F9/5016 ,  G06F9/5027 ,  G06F9/5061 ,  G06F11/1004 ,  G06F11/1044 ,  G06F11/1076 ,  G06F12/0893 ,  G06F12/109 ,  G06F16/1727 ,  G06F16/22 ,  G06F16/2246 ,  G06F16/2282 ,  G06F16/2365 ,  G06F16/244 ,  G06F16/2445 ,  G06F16/2453 ,  G06F16/2458 ,  G06F16/24553 ,  G06F16/24573 ,  G06F16/278 ,  G06F16/901 ,  G06F16/9017 ,  H03M7/30 ,  H04L67/10 ,  G06F3/067 ,  G06F16/24547 ,  G06F2211/1011 ,  G06F2212/608

Abstract: A computing system is operable to generate a plurality of lines of coding blocks that includes a plurality of data blocks and a plurality of parity blocks. Each of the plurality of lines of coding blocks includes a corresponding subset of data blocks a corresponding subset of parity blocks. A set of segments of a segment group are generated to collectively include the plurality of lines of coding blocks. Different coding blocks of each of the plurality of lines of coding blocks are included within different ones of the set of segments, and the plurality of parity blocks are dispersed across all of the set of segments. The set of segments are stored via a plurality of nodes sets, where different segments of the set of segments are stored via memory resources of different node sets of the plurality of node sets.

公开(公告)号：US20240004852A1

公开(公告)日：2024-01-04

申请号：US18367697

申请日：2023-09-13

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Rhett Colin Starr ,  Joseph Jablonski ,  S. Christopher Gladwin

IPC: G06F16/22 ,  G06F16/28 ,  G06F16/23 ,  G06F16/2457 ,  G06F16/25 ,  G06F17/10

CPC classification number: G06F16/221 ,  G06F16/285 ,  G06F16/2365 ,  G06F16/24578 ,  G06F16/25 ,  G06F17/10

Abstract: A method for execution by one or more database storage nodes of a database management system includes obtaining a row of data that includes a plurality of columns. The method further includes generating a data confidence value for data within one or more columns of the plurality of columns. The method further includes storing the data confidence value in a memory of the database management system.

公开(公告)号：US11599278B2

公开(公告)日：2023-03-07

申请号：US17659203

申请日：2022-04-14

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Rhett Colin Starr ,  Joseph Jablonski ,  S. Christopher Gladwin

IPC: G06F3/06 ,  G06F16/25 ,  H04L67/1097

Abstract: A networked database management system (DBMS) is disclosed. In particular, the disclosed DBMS includes a plurality of nodes, one of which is elected as a designated leader. The designated leader is elected using a consensus algorithm, such as tabulated random votes, RAFT or PAXOS. The designated leader is responsible for managing open coding lines, and determining when to close an open coding line.

公开(公告)号：US20220179863A1

公开(公告)日：2022-06-09

申请号：US17679835

申请日：2022-02-24

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/901 ,  G06F9/4401 ,  G06F9/50 ,  H04L67/10 ,  G06F3/06 ,  G06F12/0893 ,  G06F16/17 ,  G06F11/10 ,  G06F12/109 ,  G06F16/23 ,  G06F16/242 ,  H03M7/30 ,  G06F16/2457 ,  G06F16/2458 ,  G06F16/27 ,  G06F7/24

Abstract: A method includes generating a plurality of parity blocks from a plurality of lines of data blocks. The plurality of lines of data blocks are stored in data sections of memory of a cluster of computing devices of the computing system by distributing storage of individual data blocks of the plurality of lines of data blocks among unique data sections of the cluster of computing devices. The plurality of parity blocks are stored in parity sections of memory of the cluster of computing devices by distributing storage of parity blocks of the plurality of parity blocks among unique parity sections of the cluster of computing devices.

公开(公告)号：US11294902B2

公开(公告)日：2022-04-05

申请号：US17091195

申请日：2020-11-06

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/901 ,  G06F9/4401 ,  G06F9/50 ,  H04L67/10 ,  G06F3/06 ,  G06F12/0893 ,  G06F16/17 ,  G06F11/10 ,  G06F12/109 ,  G06F16/23 ,  G06F16/242 ,  H03M7/30 ,  G06F16/2457 ,  G06F16/2458 ,  G06F16/27 ,  G06F7/24

Abstract: A method includes generating, by a processing entity of a computing system, a plurality of parity blocks from a plurality of lines of data blocks. A first number of parity blocks of the plurality of parity blocks is generated from a first line of data blocks of the plurality of lines of data blocks. The method further includes storing, by the processing entity, the plurality of lines of data blocks in data sections of memory of a cluster of computing devices of the computing system in accordance with a read/write balancing pattern and a restricted file system. The method further includes storing, by the processing entity, the plurality of parity blocks in parity sections of memory of the cluster of computing devices in accordance with the read/write balancing pattern and the restricted file system.

公开(公告)号：US20210056107A1

公开(公告)日：2021-02-25

申请号：US17091195

申请日：2020-11-06

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Jason Arnold

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/901 ,  G06F9/4401 ,  G06F9/50 ,  H04L29/08 ,  G06F3/06 ,  G06F12/0893 ,  G06F16/17 ,  G06F11/10 ,  G06F12/109 ,  G06F16/23 ,  G06F16/242 ,  H03M7/30 ,  G06F16/2457 ,  G06F16/2458 ,  G06F16/27

Abstract: A method includes generating, by a processing entity of a computing system, a plurality of parity blocks from a plurality of lines of data blocks. A first number of parity blocks of the plurality of parity blocks is generated from a first line of data blocks of the plurality of lines of data blocks. The method further includes storing, by the processing entity, the plurality of lines of data blocks in data sections of memory of a cluster of computing devices of the computing system in accordance with a read/write balancing pattern and a restricted file system. The method further includes storing, by the processing entity, the plurality of parity blocks in parity sections of memory of the cluster of computing devices in accordance with the read/write balancing pattern and the restricted file system.

公开(公告)号：US20200341958A1

公开(公告)日：2020-10-29

申请号：US16928509

申请日：2020-07-14

Applicant: Ocient Inc.

Inventor： George Kondiles ,  Rhett Colin Starr ,  Joseph Jablonski ,  S. Christopher Gladwin

IPC: G06F16/22 ,  G06F16/28 ,  G06F16/23 ,  G06F16/2457 ,  G06F16/25 ,  G06F17/10

Abstract: A database management system operates by: obtaining a dataset from a memory of the database management system, wherein the dataset includes a set of data records; determining a set of data characteristics of the dataset; determining a list of analytical calculations that are able to be executed on the dataset; determining an analytical calculation characteristic for each analytical calculation of the list of analytical calculations to produce a set of analytical calculation characteristics, wherein the analytical calculation characteristic indicates an estimated execution time to perform the analytical calculation; ranking each analytical calculation of the list of analytical calculations based on the set of data characteristics and the set of analytical calculation characteristics to produce a ranked list of analytical calculations; selecting an analytical calculation from the ranked list of analytical calculations based on the ranking; and executing the selected analytical calculation on the dataset to produce an analytical calculation result.