Patents by Inventor George Kondiles
George Kondiles has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20220236890Abstract: 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.Type: ApplicationFiled: April 14, 2022Publication date: July 28, 2022Applicant: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Publication number: 20220207044Abstract: A processing system of a node is operable to determine a query for execution and determine a set of segments that each include a corresponding set of rows required to execute the query. A first segment of the set of segments is determined to be processed as a virtual segment. A locally rebuilt set of rows corresponding to the first segment is generated by utilizing a recovery scheme based on determining the first segment is to be processed as a virtual segment. Execution of the query is facilitated by utilizing the locally rebuilt set of rows.Type: ApplicationFiled: March 15, 2022Publication date: June 30, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220207008Abstract: A record processing and storage system is operable to receive a plurality of labeled row data from a data source. Each labeled row data of the plurality of labeled row data includes at least one record and a corresponding row number of a plurality of row numbers. A plurality of pages are generated from records included in the labeled row data. The plurality of pages are stored via a page storage system. A plurality of page metadata corresponding to the plurality of pages is generated, where each of the plurality of page metadata is generated based on at least corresponding one row number of at least one labeled row data with records included in a corresponding one of the plurality of pages. Deduplication of duplicated records included the plurality of pages is facilitated based on the plurality of page metadata.Type: ApplicationFiled: March 15, 2022Publication date: June 30, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Ravi V. Khadiwala, Donald Scott Clark, Anna Veselova
-
Publication number: 20220207009Abstract: A record processing and storage system is operable to receive a plurality of row data that each indicate a batch number. Each of the plurality of row data is added to a pending row data pool. A plurality of pages is generated from the plurality of row data via a plurality of processing core resources. Each processing core resource in the plurality of processing core resources processing a corresponding subset of the plurality of row data by retrieving, in each time slice of a plurality of time slices, one row data from the pending row data pool with a most favorably ordered batch number of row data in the pending row data pool. Each processing core resource further processes the one row data in the in each time slice to participate in generation of at least one of the plurality of pages.Type: ApplicationFiled: March 15, 2022Publication date: June 30, 2022Applicant: Ocient Holdings LLCInventors: George KONDILES, Ravi V. KHADIWALA, Donald Scott CLARK, Anna VESELOVA
-
Publication number: 20220197910Abstract: A method includes determining a first set of query rules and receiving a query from a requesting entity. The first set of query rules is filtered to generate a proper subset of the first set of query rules by selecting only ones of the first set of query rules with parameter data comparing favorably to parameters of the query. Compliance data indicating whether the query complies with the first set of query rules is generated by determining whether the query complies with the proper subset of the first set of query rules. When the compliance data indicates the query complies with the first set of query rules, a query result is determined for the query and the query result is transmitted to the requesting entity. When the compliance data indicates the query does not comply with the first set of query rules, transmission of the query is foregone.Type: ApplicationFiled: February 22, 2022Publication date: June 23, 2022Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Patent number: 11366813Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.Type: GrantFiled: January 22, 2021Date of Patent: June 21, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220179856Abstract: A database system is operable to initiate execution of a query via a subset of a plurality of nodes. After initiating the execution of the query, failure detection data is generated indicating a first node included in the subset of the plurality of nodes based on determining execution condition data for the first node compares unfavorably to node execution condition requirements. Node reassignment data is generated based on the failure detection data by assigning a new node in the plurality of nodes to replace the first node in the query execution plan for a remainder of the execution of the query. A resultant is generated for the query in accordance with completion of the execution of the query, where at least a portion of the execution of the query is performed via the new node.Type: ApplicationFiled: February 23, 2022Publication date: June 9, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20220179863Abstract: 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.Type: ApplicationFiled: February 24, 2022Publication date: June 9, 2022Applicant: Ocient Inc.Inventors: George Kondiles, Jason Arnold
-
Publication number: 20220179878Abstract: A method by one or more processing units of a database management system includes determining to transition a collection of data from storage in a set of first temperature storage nodes to storage in a set of second temperature nodes 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 transitioning storage of the collection of data in parallel, by each parallel node pair of the set of parallel node pairs, from storage in the set of first temperature storage nodes to storage in the set of second temperature storage nodes.Type: ApplicationFiled: February 23, 2022Publication date: June 9, 2022Applicant: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski
-
Publication number: 20220171780Abstract: A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.Type: ApplicationFiled: February 23, 2022Publication date: June 2, 2022Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Patent number: 11334257Abstract: 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.Type: GrantFiled: November 9, 2020Date of Patent: May 17, 2022Assignee: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Patent number: 11334542Abstract: A method for managing data storage and retrieval and operated within a database management system includes determining whether a data confidence value of a data record that is stored or is to be stored in memory of the database management system is less than a data confidence threshold, where the data confidence value includes one or more of an estimate of an accuracy of data within the data record, an estimate of the accuracy of the data record, and an estimate of a reliability level of the data. When the data confidence value is less than the data confidence threshold, the method continues by generating a confidence data record based on the data record and the data confidence value. The method continues by storing the confidence data record in memory of the database management system.Type: GrantFiled: June 30, 2020Date of Patent: May 17, 2022Assignee: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Publication number: 20220138168Abstract: A database system operates by: receiving a plurality of row data associated with a first data source; identifying a subset of row data from the plurality of row data that includes only ones of the plurality of row data that compare favorably to maintained row durability data; generating at least one page from ones of the plurality of row data included in the subset of row data; storing the at least one page in long term storage; generating updated row durability data indicating a least favorably ordered row number of a plurality of row numbers corresponding to the subset of row data based on storing the at least one page in long term storage; and updating the maintained row durability data to indicate the least favorably ordered row number of the updated row durability data.Type: ApplicationFiled: March 29, 2021Publication date: May 5, 2022Applicant: Ocient Holdings LLCInventors: Anna Veselova, Ravi V. Khadiwala, George Kondiles
-
Patent number: 11321288Abstract: A method for execution by a record processing and storage system includes receiving a plurality of records and corresponding row numbers. Pages are generated from the received records. Page metadata is generated for each page that includes row number span data based on row numbers of the records included in each page. Pairs of pages are identified in the plurality of pages based on having row number span data in their page metadata that include a row number span overlap. For each pair of pages, row number span data is updated for a first page in the pair by removing the row number span overlap with a second page in the pair. Reads of pages are performed based on their row number span data. Only records of each first page of each pair of pages having row numbers that are within the updated row number span data are read.Type: GrantFiled: August 5, 2020Date of Patent: May 3, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Ravi V. Khadiwala, Donald Scott Clark, Anna Veselova
-
Publication number: 20220129464Abstract: A method includes determining, in accordance with a first ordering, a plurality of read requests for a memory device. The plurality of read requests are added to a memory device queue for the memory device in accordance with the first ordering. The plurality of read requests in the memory device queue are processed, in accordance with a second ordering that is different from the first ordering, to determine read data for each of the plurality of read requests. The read data for the each of the plurality of read requests is added one of a set of ordered positions, based on the first ordering, of a ring buffer as the each of the plurality of reads requests is processed. The read data of a subset of the plurality of read requests is submitted based on adding the read data to a first ordered position of the set of ordered positions of the ring buffer.Type: ApplicationFiled: January 6, 2022Publication date: April 28, 2022Applicant: Ocient Holdings LLCInventor: George Kondiles
-
Publication number: 20220129463Abstract: A computing device includes a computing device controller hub and a plurality of parallelized nodes coupled to the computing device controller hub. Each node of the plurality of parallelized nodes includes a central processing module, a main memory, and at least one disk memory. The plurality of computing devices is operable to collectively execute query requests against at least one database table stored by the plurality of computing devices based on each node of each computing device performing corresponding operations independently from other nodes of the plurality of parallelized nodes.Type: ApplicationFiled: January 4, 2022Publication date: April 28, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold
-
Publication number: 20220129466Abstract: A method includes determining a data set for storage that includes a plurality of uncompressed data slabs in accordance with a serialized data slab ordering. A storage data set that includes a plurality of compressed data slabs is created based on the data set in accordance with the serialized data slab ordering. Each compressed data slab of the plurality of compressed data slabs is generated from at least one corresponding uncompressed data slab of the plurality of uncompressed data slabs that includes a plurality of values based on generating compressed data for each compressed data slab based on the at least one corresponding uncompressed data slab, and generating compression information for each compressed data slab. The storage data set is stored via a plurality of computing devices.Type: ApplicationFiled: January 10, 2022Publication date: April 28, 2022Applicant: Ocient Holdings LLCInventor: George Kondiles
-
Patent number: 11308094Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.Type: GrantFiled: January 22, 2021Date of Patent: April 19, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220114176Abstract: A method for execution by a node of a database system includes receiving a first data block, determining data block processing instruction data for the first data block is not indicated in previously received data blocks, and adding the first data block to an unknown purpose data block cache. Prior to elapsing of a storage time window for storage of the first data block, at least one second data block is received that indicates data block processing instruction data for the first data block. The first data block is processed by applying the data block processing instruction data. A third data block is received and is added to the unknown purpose data block cache. The third data block is removed from the unknown purpose data block cache based on elapsing of a storage time window for storage of the third data block.Type: ApplicationFiled: December 23, 2021Publication date: April 14, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20220114175Abstract: A method for execution by a database system includes determining physical network topology data of a plurality of nodes of the database system utilized to facilitate query executions. Initial route selection data indicating a set of initial relay nodes for each of a plurality of pairs of the plurality of nodes is based on the physical network topology data by selecting one of a plurality of possible initial route options for the each of the plurality of pairs of the plurality of nodes. The initial route selection data is sent to the plurality of nodes. A query resultant is generated by facilitating execution of a query, via the plurality of nodes, by facilitating routing of data blocks between at least one of the plurality of pairs of the plurality of nodes via a set of intermediate nodes selected based on the initial route selection data in accordance with a dynamic data block routing scheme.Type: ApplicationFiled: December 23, 2021Publication date: April 14, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist