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).

  • DYNAMIC DATA BLOCK ROUTING VIA A DATABASE SYSTEM
    Publication number: 20220269679
    Abstract: A node is operable to determine to send at least on data block to a destination node. A second relay node of an initial route that includes exactly a predefined number of relay nodes for relaying at least one data block from the node to a destination node is identified. A set of intermediate node options is identified by identifying nodes of the database system capable of receiving the at least one data block from the node and further capable of sending the at least one data block to the second relay node. Intermediate node selection data is generated by selecting one intermediate node from the set of intermediate node options. The at least one data block is transmitted from the node to the one intermediate node via the first direct connection to facilitate sending of the at least one data block from the node to the destination node.
    Type: Application
    Filed: February 28, 2022
    Publication date: August 25, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • PROCESSING QUERIES BASED ON LEVEL ASSIGNMENT INFORMATION
    Publication number: 20220261443
    Abstract: A method for execution by a node includes determining first level assignment information indicating assignment to a first subset of levels of a plurality of levels and determining second level assignment information indicating assignment to a second subset of levels of the plurality of levels. The second level assignment information indicates a second compute sequence number that is different from a first compute sequence number indicated by the first level assignment information. A query indicating the first compute sequence number is determined for execution. Execution of at least one query operator of the query is performed in accordance with a level included in the first subset of levels based on determining to utilize the first level assignment information based on the query indicating the first compute sequence number.
    Type: Application
    Filed: April 29, 2022
    Publication date: August 18, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Dave Boutcher
  • System and method for optimizing large database management systems with multiple optimizers
    Patent number: 11416486
    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.
    Type: Grant
    Filed: July 20, 2020
    Date of Patent: August 16, 2022
    Assignee: Ocient Inc.
    Inventors: Jason Arnold, George Kondiles
  • DATABASE MANAGEMENT SYSTEMS FOR MANAGING DATA WITH DATA CONFIDENCE
    Publication number: 20220253417
    Abstract: A method for managing data storage and retrieval and operated within a database management system includes retrieving a set of confidence data records from memory of the database management system, where a confidence data record of the set of confidence data records includes a set of data columns and one or more confidence columns populated with one or more data confidence values associated with data within one or more data columns of the set of data columns. The method further includes analyzing the set of confidence data records to produce a result, where the result includes a confidence level that is based on corresponding ones of the one or more data confidence values associated with the data within one or more data columns of the set of data columns.
    Type: Application
    Filed: April 25, 2022
    Publication date: August 11, 2022
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
  • DATABASE SYSTEM WITH DESIGNATED LEADER AND METHODS FOR USE THEREWITH
    Publication number: 20220236890
    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.
    Type: Application
    Filed: April 14, 2022
    Publication date: July 28, 2022
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
  • QUERY EXECUTION VIA VIRTUAL SEGMENTS
    Publication number: 20220207044
    Abstract: 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: Application
    Filed: March 15, 2022
    Publication date: June 30, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • PROCESSING ROW DATA FOR DEDUPLICATION BASED ON CORRESPONDING ROW NUMBERS
    Publication number: 20220207008
    Abstract: 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: Application
    Filed: March 15, 2022
    Publication date: June 30, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Ravi V. Khadiwala, Donald Scott Clark, Anna Veselova
  • PROCESSING ROW DATA VIA A PLURALITY OF PROCESSING CORE RESOURCES
    Publication number: 20220207009
    Abstract: 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: Application
    Filed: March 15, 2022
    Publication date: June 30, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George KONDILES, Ravi V. KHADIWALA, Donald Scott CLARK, Anna VESELOVA
  • ENFORCEMENT OF QUERY RULES FOR ACCESS TO DATA IN A DATABASE SYSTEM
    Publication number: 20220197910
    Abstract: 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: Application
    Filed: February 22, 2022
    Publication date: June 23, 2022
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Maximizing IO throughput via a segment scheduler of a database system and methods for use therewith
    Patent number: 11366813
    Abstract: 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: Grant
    Filed: January 22, 2021
    Date of Patent: June 21, 2022
    Assignee: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • REASSIGNMENT OF NODES DURING QUERY EXECUTION
    Publication number: 20220179856
    Abstract: 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: Application
    Filed: February 23, 2022
    Publication date: June 9, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • STORING DATA AND PARITY VIA A COMPUTING SYSTEM
    Publication number: 20220179863
    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.
    Type: Application
    Filed: February 24, 2022
    Publication date: June 9, 2022
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Jason Arnold
  • DATA TRANSITION IN HIGHLY PARALLEL DATABASE MANAGEMENT SYSTEM
    Publication number: 20220179878
    Abstract: 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: Application
    Filed: February 23, 2022
    Publication date: June 9, 2022
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski
  • GENERATING MINIMUM QUERY COST COMPLIANCE DATA FOR QUERY REQUESTS
    Publication number: 20220171780
    Abstract: 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: Application
    Filed: February 23, 2022
    Publication date: June 2, 2022
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Database management system and methods for use therewith
    Patent number: 11334257
    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.
    Type: Grant
    Filed: November 9, 2020
    Date of Patent: May 17, 2022
    Assignee: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
  • Database management systems for managing data with data confidence
    Patent number: 11334542
    Abstract: 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: Grant
    Filed: June 30, 2020
    Date of Patent: May 17, 2022
    Assignee: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
  • MAINTAINING ROW DURABILITY DATA IN DATABASE SYSTEMS
    Publication number: 20220138168
    Abstract: 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: Application
    Filed: March 29, 2021
    Publication date: May 5, 2022
    Applicant: Ocient Holdings LLC
    Inventors: Anna Veselova, Ravi V. Khadiwala, George Kondiles
  • Record deduplication in database systems
    Patent number: 11321288
    Abstract: 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: Grant
    Filed: August 5, 2020
    Date of Patent: May 3, 2022
    Assignee: Ocient Holdings LLC
    Inventors: George Kondiles, Ravi V. Khadiwala, Donald Scott Clark, Anna Veselova
  • RE-ORDERED PROCESSING OF READ REQUESTS
    Publication number: 20220129464
    Abstract: 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: Application
    Filed: January 6, 2022
    Publication date: April 28, 2022
    Applicant: Ocient Holdings LLC
    Inventor: George Kondiles
  • QUERY EXECUTION VIA COMPUTING DEVICES WITH PARALLELIZED RESOURCES
    Publication number: 20220129463
    Abstract: 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: Application
    Filed: January 4, 2022
    Publication date: April 28, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold