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: 20210326320
    Abstract: A method includes a host computing device receiving a segment group of data. The method further includes the host computing device evaluating availability status of other computing devices in the storage cluster of computing devices. When one of the other computing devices is unavailable, the method further includes the host computing device dividing the segment group of data into a plurality of lines of data blocks. For a line of the data blocks, the method further includes the host computing device generating at least one parity block. The method further includes the host computing device sending a first data segment that includes first positioned data blocks to a first available computing device. The method further includes the host computing device sending a second data segment that includes second positioned data blocks to a second available computing device. The method further includes the host computing device storing a parity segment.
    Type: Application
    Filed: June 30, 2021
    Publication date: October 21, 2021
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Jason Arnold
  • Publication number: 20210311943
    Abstract: A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.
    Type: Application
    Filed: April 2, 2020
    Publication date: October 7, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Publication number: 20210303570
    Abstract: A method for execution by a node in a database system includes determining to send a data block from a node to a destination node of a database system in accordance with execution of a query. An initial route to the destination node that includes a predefined number of relay nodes in a sequential relay ordering is determined. The second relay node in the sequential relay ordering is identified, and a set of intermediate node options that are each capable of receiving data from the node via a direct connection and capable of sending data to the second relay node via a direct connection is identified. One intermediate node is selected from the set of intermediate node options, and the data block is transmitted from the node to the one intermediate node to facilitate sending of the data to the destination node via exactly the predefined number of relay nodes.
    Type: Application
    Filed: March 25, 2020
    Publication date: September 30, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Publication number: 20210303466
    Abstract: A method for execution by a temporary ingress storage system includes receiving a set of records to be processed for long-term storage. The set of records are temporarily stored in a set of memory resources of the temporary ingress storage system during a first temporal period. Execution of a query is facilitated by accessing a subset of the set of records from at least one memory resource of the set of memory resources during the first temporal period. The set of records are processed to generate a set of segments for long-term storage. Migration of the set of records from the temporary ingress storage system to a long-term storage system for during a second temporal period that begins after the first temporal period has elapsed by sending the set of records to the long-term storage system.
    Type: Application
    Filed: March 25, 2020
    Publication date: September 30, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Publication number: 20210294858
    Abstract: A method for execution by a node of a computing device includes: determining level assignment data indicating assignment to a subset of levels of a plurality of levels of a query execution plan, wherein the plurality of levels includes a lowest level, at least one inner level, and a highest level; determining a query for execution; determining a query discriminator number corresponding to the query; determining to process the query at one of the plurality of levels based on determining the one of the plurality of levels is included in the subset of levels; generating query resultant data by facilitating execution of at least one query operator of the query in accordance with the one of the plurality of levels; selecting one of a plurality of possible parent nodes in a sequentially higher one of the plurality of levels based on the query discriminator number; and sending the query resultant data to the one of the plurality of possible parent nodes for processing.
    Type: Application
    Filed: June 7, 2021
    Publication date: September 23, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Dave Boutcher
  • Patent number: 11106679
    Abstract: A method for execution by a query processing system includes determining a first set of query rules for first data received from a first data provider and to determine a second set of query rules for second data received from a second data provider. A query received from a requesting entity is determined to involve at least one query function that accesses a subset of the first data. Compliance data is generated by determining whether the query complies with 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 for the query based on execution of the query, and the query result is transmitted to the requesting entity. The query result is not transmitted to the requesting entity when the compliance data indicates the query does not comply with the first set of query rules.
    Type: Grant
    Filed: October 30, 2019
    Date of Patent: August 31, 2021
    Assignee: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 11093500
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Grant
    Filed: October 28, 2019
    Date of Patent: August 17, 2021
    Assignee: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20210240718
    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: Application
    Filed: January 22, 2021
    Publication date: August 5, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • Publication number: 20210240713
    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: Application
    Filed: January 31, 2020
    Publication date: August 5, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • Publication number: 20210240716
    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: Application
    Filed: January 22, 2021
    Publication date: August 5, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • Publication number: 20210240709
    Abstract: A computing device comprises a plurality of nodes and a plurality of operating system layers. The plurality of operating system layers includes a local database operating system and a sub-system database operating system. The plurality of nodes utilize the local database operating system to execute at least one database operation independently of other ones of the plurality of nodes. The computing device utilizes the sub-system database operating system in conjunction with other ones of a plurality of computing devices of at least one sub-system to facilitate execution of at least one sub-system operation of the at least one sub-system.
    Type: Application
    Filed: April 22, 2021
    Publication date: August 5, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold
  • Publication number: 20210240717
    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: Application
    Filed: January 22, 2021
    Publication date: August 5, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • Patent number: 11080277
    Abstract: A method includes receiving, by a host computing device of a storage cluster of computing devices, a segment group of data. The method further includes processing, by the host computing device, the segment group of data to produce data segments. The method further includes, sending, by the host computing device, the data segments to the computing devices of the storage cluster. The method further includes allocating, by a host node of the first computing device, data segment divisions of the first data segment to nodes of the first computing device. The method further includes allocating, by a host processing core resource of the first node, data segment sub-divisions of the first data segment division to processing core resources of the first node. The method further includes storing, by the first computing device, the first data segment having the data segment divisions and the first data segment division having the data segment sub-divisions.
    Type: Grant
    Filed: May 2, 2019
    Date of Patent: August 3, 2021
    Assignee: Ocient Inc.
    Inventors: George Kondiles, Jason Arnold
  • Patent number: 11061910
    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 31, 2020
    Date of Patent: July 13, 2021
    Assignee: Ocient Holdings LLC
    Inventors: George Kondiles, Daniel Coombs
  • Patent number: 11010382
    Abstract: A computing device includes main volatile memory and a node. The node includes a central processing module, non-volatile memory; and a non-volatile memory interface unit. A combination of the non-volatile memory and the main volatile memory stores an application specific operating system and at least a portion of a computing device operating system. The application specific operating system includes a plurality of application specific system level operations and the computing device operating system includes a plurality of general system level operations. A first processing module of the central processing module operates in accordance with a selected operating system and ignores operation not included in the selected operating system. The selected operating system includes one or more selected application specific level operations of the application specific operating system.
    Type: Grant
    Filed: February 4, 2019
    Date of Patent: May 18, 2021
    Assignee: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold
  • Publication number: 20210141795
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Application
    Filed: January 15, 2021
    Publication date: May 13, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20210133196
    Abstract: A method for execution by a query processing system includes determining a first set of query rules for first data received from a first data provider and to determine a second set of query rules for second data received from a second data provider. A query received from a requesting entity is determined to involve at least one query function that accesses a subset of the first data. Compliance data is generated by determining whether the query complies with 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 for the query based on execution of the query, and the query result is transmitted to the requesting entity. The query result is not transmitted to the requesting entity when the compliance data indicates the query does not comply with the first set of query rules.
    Type: Application
    Filed: October 30, 2019
    Publication date: May 6, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20210124744
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Application
    Filed: October 28, 2019
    Publication date: April 29, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20210058461
    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: November 9, 2020
    Publication date: February 25, 2021
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
  • Publication number: 20210056107
    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.
    Type: Application
    Filed: November 6, 2020
    Publication date: February 25, 2021
    Applicant: Ocient Inc.
    Inventors: George Kondiles, Jason Arnold