Patents by Inventor Benjamin Daniel Rabe

Benjamin Daniel Rabe 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: 20250231938
    Abstract: A processing module of a database system is operable to determining a query for execution. A plurality of row sets are processed over a temporal period in conjunction with execution of the query based on automatically selecting a requested number of rows to be included in each row set based on row scheduling parameters, generating a scheduling request for the requested number of rows, and receiving each row set for processing in response to the scheduling request via access to one segment of a set of segments required for execution of the query. A query resultant for the query is generated based on processing of the plurality of row sets, and further based on processing of an additional plurality of rows included in the set of segments via a set of other processing modules implemented in parallel with the processing module.
    Type: Application
    Filed: January 12, 2024
    Publication date: July 17, 2025
    Applicant: Ocient Holdings LLC
    Inventors: Benjamin Daniel Rabe, Greg R. Dhuse, Richard George Wendel, III
  • Publication number: 20250231939
    Abstract: A processing module of a database system is operable to determining a query for execution. A plurality of row sets are processed over a temporal period in conjunction with execution of the query based on automatically selecting a requested number of rows to be included in each row set based on row scheduling parameters, generating a scheduling request for the requested number of rows, and receiving each row set for processing in response to the scheduling request via access to one segment of a set of segments required for execution of the query. A query resultant for the query is generated based on processing of the plurality of row sets, and further based on processing of an additional plurality of rows included in the set of segments via a set of other processing modules implemented in parallel with the processing module.
    Type: Application
    Filed: July 10, 2024
    Publication date: July 17, 2025
    Applicant: Ocient Holdings LLC
    Inventors: Benjamin Daniel Rabe, Greg R. Dhuse, Richard George Wendel, III
  • Publication number: 20250068612
    Abstract: A database system is operable to generate an IO pipeline that includes a primary cluster key pipeline element serially after a secondary index pipeline element. The IO pipeline is executed based on applying the secondary index pipeline element of the IO pipeline to generate row list output, and applying the primary cluster key pipeline element to determine a first set of row ranges, determine a second set of row ranges of row list output generated by the secondary index pipeline element, and generate, from the first set of row ranges and the second set of row ranges, a result set having a plurality of outputs, each indicating a cluster key and a row range for the cluster key.
    Type: Application
    Filed: November 13, 2024
    Publication date: February 27, 2025
    Applicant: Ocient Holdings LLC
    Inventors: Richard George Wendel, III, Greg R. Dhuse, Hassan Farahani, Matthew Ashbeck, Anna Veselova, Benjamin Daniel Rabe
  • Publication number: 20250036622
    Abstract: A database system is operable to generate an addendum part indicating deletion of a set of rows of a plurality of rows of a dataset based on generating a row list based on identifying the set of rows for deletion from the dataset and compressing the row list in a set of compressed blocks written to disk memory resources. Based on determining to process the addendum part, the addendum part is read based on decompressing the row list based on access in the set of compressed block in the disk memory resources and emitting the row list for processing.
    Type: Application
    Filed: August 3, 2023
    Publication date: January 30, 2025
    Applicant: Ocient Holdings LLC
    Inventors: Greg R. Dhuse, Anna Veselova, Benjamin Daniel Rabe, Matthew Ashbeck, Pieter Charles Jas Svenson, Richard Wang
  • Publication number: 20250028700
    Abstract: A database system operates by: executing a query against a relational database table indicating a predicate applied to geospatial data of a geospatial data column, based on: applying an inner predicate to internal level nodes when traversing a set of internal levels of the each tree-based index structure to identify a first subset of leaf nodes in a plurality of leaf nodes of the each tree-based index structure based on identifying internal nodes having internal node bounding boxes meeting the inner predicate; and applying a leaf predicate to only leaf nodes included in the first subset of leaf nodes of the tree-based index structure to identify a second subset of leaf nodes of the first subset of leaf nodes corresponding to only leaf nodes of the first subset of leaf nodes having corresponding leaf node bounding boxes meeting the leaf predicate; wherein a query resultant of the query is generated based on geospatial objects of the geospatial data column for ones of a plurality of rows of the relational datab
    Type: Application
    Filed: August 13, 2024
    Publication date: January 23, 2025
    Applicant: Ocient Holdings LLC
    Inventors: Anna Veselova, Greg R. Dhuse, Richard George Wendel, III, Benjamin Daniel Rabe
  • Patent number: 12182093
    Abstract: A method includes performing a search of an inverted index structure indexing values of a column to generate an in-range indexed value set by identifying all indexed values of the inverted index structure falling within a range corresponding to a range-based filter. A set of characteristics of the in-range indexed value set are identified based on performing the search of an inverted index structure. When the set of characteristics compare favorably to the set of index-usage requirements, output is generated based on performing a plurality of searches to the inverted index structure based on the in-range indexed value set. When the set of characteristics compare unfavorably to the set of index-usage requirements, the output is generated without performing any searches to the inverted index structure.
    Type: Grant
    Filed: September 15, 2023
    Date of Patent: December 31, 2024
    Assignee: Ocient Holdings LLC
    Inventors: Richard George Wendel, III, Greg R. Dhuse, Hassan Farahani, Matthew Ashbeck, Anna Veselova, Benjamin Daniel Rabe
  • Patent number: 12117986
    Abstract: A database system is operable to write to a file buffer corresponding to geospatial index data for a plurality of rows based on processing each given row of the plurality of rows. A new leaf node of a set of leaf nodes in a temporary leaf node buffer when the given row includes a geospatial object. When the temporary leaf node buffer is determined to have a number of leaf nodes meeting a predetermined threshold number of leaf nodes, a new tree-based index structure of a set of tree-based index structures of the geospatial index data is built via processing the temporary leaf node buffer. The geospatial index data is stored based on writing the file buffer to disk memory resources. A query is executed against a relational database table based on accessing the geospatial index data in the disk memory resources.
    Type: Grant
    Filed: July 20, 2023
    Date of Patent: October 15, 2024
    Assignee: Ocient Holdings LLC
    Inventors: Anna Veselova, Greg R. Dhuse, Richard George Wendel, III, Benjamin Daniel Rabe
  • Publication number: 20240232197
    Abstract: A database system is operable to determine a query for execution. A disjunction of a plurality of conjunctive normal form (CNF) filtering predicates is determined based on filtering predicates of the query. An IO pipeline is generated based on the disjunction of the plurality of CNF filtering predicates that includes, based on applying at least one type of optimization, at least one shared IO element common to multiple ones of plurality of the CNF filtering predicates. The IO pipeline is executed in accordance with execution of the query to generate a filtered subset of a plurality of rows that each meet at least one of the plurality of CNF filtering predicates.
    Type: Application
    Filed: October 12, 2023
    Publication date: July 11, 2024
    Applicant: Ocient Holdings LLC
    Inventors: Sarah Kate Schieferstein, Jason Arnold, Austen Thomas Darre, Darius Russell Kish, Matthew Ashbeck, Greg R. Dhuse, Anna Veselova, Benjamin Daniel Rabe, Pieter Charles Jas Svenson
  • Publication number: 20240134858
    Abstract: A database system is operable to determine a query for execution. A disjunction of a plurality of conjunctive normal form (CNF) filtering predicates is determined based on filtering predicates of the query. An IO pipeline is generated based on the disjunction of the plurality of CNF filtering predicates that includes, based on applying at least one type of optimization, at least one shared IO element common to multiple ones of plurality of the CNF filtering predicates. The IO pipeline is executed in accordance with execution of the query to generate a filtered subset of a plurality of rows that each meet at least one of the plurality of CNF filtering predicates.
    Type: Application
    Filed: October 11, 2023
    Publication date: April 25, 2024
    Applicant: Ocient Holdings LLC
    Inventors: Sarah Kate Schieferstein, Jason Arnold, Austen Thomas Darre, Darius Russell Kish, Matthew Ashbeck, Greg R. Dhuse, Anna Veselova, Benjamin Daniel Rabe, Pieter Charles Jas Svenson
  • Publication number: 20240111745
    Abstract: A method includes performing a search of an inverted index structure indexing values of a column to generate an in-range indexed value set by identifying all indexed values of the inverted index structure falling within a range corresponding to a range-based filter. A set of characteristics of the in-range indexed value set are identified based on performing the search of an inverted index structure. When the set of characteristics compare favorably to the set of index-usage requirements, output is generated based on performing a plurality of searches to the inverted index structure based on the in-range indexed value set. When the set of characteristics compare unfavorably to the set of index-usage requirements, the output is generated without performing any searches to the inverted index structure.
    Type: Application
    Filed: September 15, 2023
    Publication date: April 4, 2024
    Applicant: Ocient Holdings LLC
    Inventors: Richard George Wendel, III, Greg R. Dhuse, Hassan Farahani, Matthew Ashbeck, Anna Veselova, Benjamin Daniel Rabe