Redwood Shores, CA, United States of America

Albert A Hopeman, Iv


Average Co-Inventor Count = 3.9

ph-index = 2

Forward Citations = 33(Granted Patents)


Location History:

  • Redwood Shores, CA (US) (2017)
  • Arlington, MA (US) (2012 - 2020)

Company Filing History:


Years Active: 2012-2020

Loading Chart...
4 patents (USPTO):Explore Patents

Title: Albert A Hopeman, Iv: Innovator in Data Processing Technologies

Introduction

Albert A Hopeman, Iv is a notable inventor based in Redwood Shores, CA (US). He has made significant contributions to the field of data processing, holding a total of 4 patents. His work primarily focuses on enhancing the efficiency of data management and aggregation techniques.

Latest Patents

One of his latest patents is titled "Group determination based on multi-table dictionary codes." This invention discloses techniques related to group determination based on multi-table dictionary codes. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method comprises storing a fact table and a dimension table that share a domain dictionary. The fact table and the dimension table each have a column of encoded join keys that is decodable using the shared domain dictionary. A query may specify one or more row groups for the dimension table. To efficiently process the query, one or more group identifiers are assigned to the one or more row groups. Each row group corresponds to a different group identifier. This enables a code-to-group-identifier mapping to be generated, correlating the encoded join keys to the one or more group identifiers.

Another significant patent is "Aggregating dimensional data using dense containers." This patent describes methods, computer systems, and stored instructions for densely grouping dimensional data and/or aggregating data using a data structure, such as one that is constructed based on dimensional data. When smaller tables are joined with a larger table, a server may analyze the smaller tables first to determine actual value combinations that occur in the smaller tables. These actual value combinations are used to more efficiently process the larger table. A dense data structure may be generated by processing dimensional data before processing data from the fact table. The dense data structure may be generated by compressing ranges of values that are possible in dimensions into a range of values that actually occurs in the dimensions. The compressed range of values may be represented by dense set identifiers rather than the actual compressed range of values.

Career Highlights

Albert A Hopeman, Iv is currently employed at Oracle International Corporation, where he continues to innovate and develop advanced data processing solutions. His work at Oracle has positioned him as a key player in the field of data management technologies.

Collaborations

He has collaborated

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…