-
公开(公告)号:US20220075784A1
公开(公告)日:2022-03-10
申请号:US17527430
申请日:2021-11-16
Applicant: Ocient Inc.
Inventor: George Kondiles , Jason Arnold
IPC: G06F16/2455 , G06F16/22 , G06F16/2453
Abstract: A method includes receiving, by a first computing entity of a database system, a data set that is organized in rows and columns. The method further includes determining whether to partition the data set based on a parameter associated with the data set. When determining to partition the data set, the method includes determining partitioning parameters for the data set, and partitioning the data set into a plurality of data partitions in accordance with the partitioning parameters. The method further includes determining a first coding scheme for a first data partition and determining a first number of first raw data segments for a first segment group of the first partition based on the coding scheme. The method further includes dividing the first partition to produce the first number of first raw data segments for storage in the database system.
-
12.
公开(公告)号:US20200349162A1
公开(公告)日:2020-11-05
申请号:US16933174
申请日:2020-07-20
Applicant: Ocient Inc.
Inventor: Jason Arnold , George Kondiles
IPC: G06F16/2453 , G06F16/23 , G06F16/901 , G06F16/21 , G06F16/2455
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.
-
13.
公开(公告)号:US10747765B2
公开(公告)日:2020-08-18
申请号:US15991192
申请日:2018-05-29
Applicant: OCIENT INC.
Inventor: Jason Arnold , George Kondiles
IPC: G06F7/00 , G06F16/00 , G06F16/2453 , G06F16/23 , G06F16/901 , G06F16/21 , G06F16/2455
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.
-
公开(公告)号:US20250021240A1
公开(公告)日:2025-01-16
申请号:US18901266
申请日:2024-09-30
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.
-
公开(公告)号:US20240378016A1
公开(公告)日:2024-11-14
申请号:US18765755
申请日:2024-07-08
Applicant: Ocient Inc.
Inventor: Jason Arnold , George Kondiles
IPC: G06F7/08 , G06F7/24 , G06F9/50 , G06F16/2453 , G06F16/2455 , G06N7/01 , G06N20/10 , H04L45/12 , H04L45/122 , H04L45/24 , H04L47/125
Abstract: A method for execution, by a first intermediate node of a plurality of nodes in a database management system, includes processing a message that includes data that is being sent in accordance with a routing path from a source node to a destination node, is a first size, and indicates a next node of the routing path, wherein the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, and wherein the subset of nodes includes the next node. The method further includes maintaining a tracking table that indicates a total amount of data sent to each node of the subset of nodes during a first time period. The method further includes resetting the total amount of data sent to each of the subset of nodes to zero based one or more of a command and an initiation of a second time period.
-
公开(公告)号:US12099876B2
公开(公告)日:2024-09-24
申请号:US16732560
申请日:2020-01-02
Applicant: Ocient Inc.
Inventor: George Kondiles , Rhett Colin Starr
IPC: G06F9/50 , G06F9/48 , G06F16/2453
CPC classification number: G06F9/5027 , G06F9/4881 , G06F9/5016 , G06F9/5077 , G06F16/24532
Abstract: A computing device includes a plurality of nodes, where a first node operates in accordance with a computing device operation system (OS) and remaining nodes operate in accordance with a custom OS. The remaining nodes include a plurality of sets of processing core resources that process a plurality of sets of threads of an application. The computing device also includes a main memory divided into a computing device memory section and a custom memory section that includes portions logically allocated as a plurality of buffers. The computing device also includes a memory access control module operable to coordinate access to the plurality of buffers by at least some of the plurality of sets of threads in accordance with the custom OS. The computing device also includes disk memory and a disk memory access control module operable to coordinate access to the disk memory in accordance with the computing device OS.
-
公开(公告)号:US20240273074A1
公开(公告)日:2024-08-15
申请号:US18643242
申请日:2024-04-23
Applicant: Ocient Inc.
Inventor: George Kondiles , Rhett Colin Starr , Joseph Jablonski , S. Christopher Gladwin
CPC classification number: G06F16/221 , G06F16/2365 , G06F16/24578 , G06F16/25 , G06F16/285 , G06F17/10
Abstract: A method for execution by a computer of a database management system includes obtaining a dataset that includes a set of data records, where the data set is associated with a set of data characteristics. The method includes executing a selected ranked analytical calculation of a ranked list of analytical calculations on the dataset to produce an analytical calculation result, where the ranked list of analytical calculations is generated by ranking a list of analytical calculations that are able to be executed on the dataset, based on a set of analytical calculation characteristics associated with the list of analytical calculations, where an analytical calculation characteristic of the set of analytical calculation characteristics indicates an estimated execution time to perform an analytical calculation of the list of analytical calculations, and the selected ranked analytical calculation is selected based on the set of data characteristics to produce the selected ranked analytical calculation.
-
公开(公告)号:US20240193181A1
公开(公告)日:2024-06-13
申请号:US18581724
申请日:2024-02-20
Applicant: Ocient Inc.
Inventor: George Kondiles , Rhett Colin Starr , Joseph Jablonski
IPC: G06F16/27 , G06F3/06 , G06F12/02 , G06F13/16 , G06F13/28 , G06F13/42 , G06F15/173 , G06F16/22 , G06F16/23 , G06F16/25 , G06F16/28 , H04L67/1097 , H04L67/568
CPC classification number: G06F16/27 , G06F12/0238 , G06F13/1673 , G06F13/28 , G06F13/4282 , G06F15/17331 , G06F16/22 , G06F16/2358 , G06F16/2365 , G06F16/25 , G06F16/285 , H04L67/1097 , H04L67/568 , G06F3/0656 , G06F3/067 , G06F2212/202 , G06F2213/0026 , G06F2213/0032
Abstract: A method by one or more processing units of a database management system includes transitioning storage of a collection of data from storage in a set of first temperature storage nodes of the database management system to storage in a set of second temperature storage nodes of the database management system based on one or more criteria associated with the collection of data, where each first temperature storage node of the set of first temperature storage nodes is paired with a corresponding second temperature storage node of the set of second temperature storage nodes to form a set of parallel node pairs. The method further includes, after determining the collection of data has been stored in the set of second temperature storage nodes, deleting the collection of data in the set of first temperature storage nodes.
-
公开(公告)号:US11886436B2
公开(公告)日:2024-01-30
申请号:US17527430
申请日:2021-11-16
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 receiving, by a first computing entity of a database system, a data set that is organized in rows and columns. The method further includes determining whether to partition the data set based on a parameter associated with the data set. When determining to partition the data set, the method includes determining partitioning parameters for the data set, and partitioning the data set into a plurality of data partitions in accordance with the partitioning parameters. The method further includes determining a first coding scheme for a first data partition and determining a first number of first raw data segments for a first segment group of the first partition based on the coding scheme. The method further includes dividing the first partition to produce the first number of first raw data segments for storage in the database system.
-
公开(公告)号:US20230195749A1
公开(公告)日:2023-06-22
申请号:US18170225
申请日:2023-02-16
Applicant: Ocient Inc.
Inventor: George Kondiles , Rhett Colin Starr , Joseph Jablonski
IPC: G06F16/27 , G06F16/22 , G06F16/25 , G06F16/28 , G06F16/23 , H04L67/568 , G06F15/173 , H04L67/1097 , G06F12/02 , G06F13/16 , G06F13/28 , G06F13/42
CPC classification number: G06F16/27 , G06F16/22 , G06F16/25 , G06F16/285 , G06F16/2358 , G06F16/2365 , H04L67/568 , G06F15/17331 , H04L67/1097 , G06F12/0238 , G06F13/1673 , G06F13/28 , G06F13/4282 , G06F3/0656
Abstract: A payload store within a database management system includes a first set of nodes that include a first node that includes a memory, a network interface, a storage device, and a processing unit. The processing unit receives, via the network interface, a first portion of data to be stored in a plurality of storage devices of the first set of nodes, and splits the first portion into a first set of data rows that includes a plurality of subsets of data rows and a last subset of data rows. The processing unit further randomly assigns the plurality of subsets of data rows and the last subset of data rows between the first set of nodes and stores a first number of data rows in the storage device. The processing unit further sends, via the network interface, a second number of data rows to the second node for storage therein.
-
-
-
-
-
-
-
-
-