Patents by Inventor Hoa Binh Nga Tran
Hoa Binh Nga Tran 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).
-
Patent number: 10872071Abstract: A flattened table (FT) of a database of a database management system (DBMS) is defined. The FT logically materializes a number of columns over a number of partitions. The columns include normalized columns, denormalized columns from a plurality of source tables of the database, as well as an aggregate column defining an aggregation of a selected normalized column over a selected denormalized column. A live-aggregate projection (LAP) is defined on the FT of the database. The LAP corresponds to the aggregate column and physically materializes the aggregation of the selected denormalized column over the selected denormalized column, as defined by the aggregate column. The FT is refreshed on-demand, on a per-column, per-partition basis. Responsive to the FT being refreshed on-demand, the LAP is automatically refreshed.Type: GrantFiled: March 28, 2019Date of Patent: December 22, 2020Assignee: MICRO FOCUS LLCInventors: Thao Nguyen Pham, Yuanzhe Bei, Michael Leuchtenburg, Hoa Binh Nga Tran
-
Patent number: 10810171Abstract: In an example, data from a source location is merged into a target location containing existing data, in which the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.Type: GrantFiled: January 8, 2018Date of Patent: October 20, 2020Assignee: MICRO FOCUS LLCInventors: Hoa Binh Nga Tran, Andrew Allinson Lamb, Matthew Steven Fuller
-
Patent number: 10810219Abstract: In an example, a top-k function is associated with a top-k projection for a data storage system. Input data to be loaded into the data storage system is divided and ranked according to the top-k function and stored in the top-k projection.Type: GrantFiled: June 9, 2014Date of Patent: October 20, 2020Assignee: MICRO FOCUS LLCInventors: Hoa Binh Nga Tran, Charles Edward Bear, Jaimin Mukesh Dave, Vivek Bharathan
-
Publication number: 20200311043Abstract: A flattened table (FT) of a database of a database management system (DBMS) is defined. The FT logically materializes a number of columns over a number of partitions. The columns include normalized columns, denormalized columns from a plurality of source tables of the database, as well as an aggregate column defining an aggregation of a selected normalized column over a selected denormalized column. A live-aggregate projection (LAP) is defined on the FT of the database. The LAP corresponds to the aggregate column and physically materializes the aggregation of the selected denormalized column over the selected denormalized column, as defined by the aggregate column. The FT is refreshed on-demand, on a per-column, per-partition basis. Responsive to the FT being refreshed on-demand, the LAP is automatically refreshed.Type: ApplicationFiled: March 28, 2019Publication date: October 1, 2020Inventors: Thao Nguyen Pham, Yuanzhe Bei, Michael Leuchtenburg, Hoa Binh Nga Tran
-
Patent number: 10599625Abstract: According to an example, in a method for managing storage of data from an input table, a projection definition that includes an expression to be executed on data contained in a column of the input table may be accessed. The expression on the data contained in the column of the input table may be executed to obtain results data, which may be stored in an expression projection, in which the expression projection includes a column that provides physical storage for the results data. The results data may be stored in the expression projection, segmented, and encoded. In addition, the expression projection may be stored in a node.Type: GrantFiled: June 9, 2014Date of Patent: March 24, 2020Assignee: MICRO FOCUS LLCInventors: Hoa Binh Nga Tran, Charles Edward Bear, Jaimin Mukesh Dave, Vivek Bharathan
-
Patent number: 10572483Abstract: In an example, an aggregate function is associated with an aggregate projection for a data storage system. Input data to be loaded into the data storage system is aggregated according to the aggregate function and stored in the aggregate projection.Type: GrantFiled: June 9, 2014Date of Patent: February 25, 2020Assignee: MICRO FOCUS LLCInventors: Hoa Binh Nga Tran, Charles Edward Bear, Vivek Bharathan, Jaimin Mukesh Dave
-
Patent number: 10248620Abstract: According to an example, database constraint generation may include receiving data related to a table in a database, analyzing the data to determine a row count for a column of the table, and analyzing the data to determine a number of distinct values for the column of the table. A comparison value may be determined by comparing the row count to the number of distinct values. The database constraint generation may further include determining if the comparison value is within a threshold. If the comparison value is within the threshold, an annotation may be added to the column of the table such that the column is considered unique during a cardinality estimation process involving the table.Type: GrantFiled: April 30, 2013Date of Patent: April 2, 2019Assignee: ENTIT SOFTWARE LLCInventors: Hoa Binh Nga Tran, Lakshmikant Shrinivas, Kanti Marita Mann
-
Publication number: 20180129683Abstract: In an example, data from a source location is merged into a target location containing existing data, in which the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.Type: ApplicationFiled: January 8, 2018Publication date: May 10, 2018Inventors: Hoa Binh Nga Tran, Andrew Allinson Lamb, Matthew Steven Fuller
-
Patent number: 9864763Abstract: In an example, data from a source location is merged into a target location containing existing data, in which both the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.Type: GrantFiled: June 1, 2012Date of Patent: January 9, 2018Assignee: EntIT Software LLCInventors: Hoa Binh Nga Tran, Andrew Allinson Lamb, Matthew Steven Fuller
-
Publication number: 20170185649Abstract: In an example, an aggregate function is associated with an aggregate projection for a data storage system. Input data to be loaded into the data storage system is aggregated according to the aggregate function and stored in the aggregate projection.Type: ApplicationFiled: June 9, 2014Publication date: June 29, 2017Inventors: Hoa Binh Nga TRAN, Charles Edward BEAR, Vivek BHARATHAN, Jaimin Mukesh DAVE
-
Publication number: 20170139959Abstract: According to an example, in a method for managing storage of data from an input table, a projection definition that includes an expression to be executed on data contained in a column of the input table may be accessed. The expression on the data contained in the column of the input table may be executed to obtain results data, which may be stored in an expression projection, in which the expression projection includes a column that provides physical storage for the results data. The results data may be stored in the expression projection, segmented, and encoded. In addition, the expression projection may be stored in a node.Type: ApplicationFiled: June 9, 2014Publication date: May 18, 2017Inventors: Hoa Binh Nga TRAN, Charles Edward BEAR, Jaimin Mukesh DAVE, Vivek BHARATHAN
-
Publication number: 20170132295Abstract: In an example, a top-k function is associated with a top-k projection for a data storage system. Input data to be loaded into the data storage system is divided and ranked according to the top-k function and stored in the top-k projection.Type: ApplicationFiled: June 9, 2014Publication date: May 11, 2017Inventors: Hoa Binh Nga TRAN, Charles Edward BEAR, Jaimin Mukesh DAVE, Vivek BHARATHAN
-
Publication number: 20160078070Abstract: According to an example, database constraint generation may include receiving data related to a table in a database, analyzing the data to determine a row count for a column of the table, and analyzing the data to determine a number of distinct values for the column of the table. A comparison value may be determined by comparing the row count to the number of distinct values. The database constraint generation may further include determining if the comparison value is within a threshold. If the comparison value is within the threshold, an annotation may be added to the column of the table such that the column is considered unique during a cardinality estimation process involving the table.Type: ApplicationFiled: April 30, 2013Publication date: March 17, 2016Inventors: Hoa Binh Nga Tran, Lakshmikant Shrinivas, Kanti Marita Mann
-
Publication number: 20150317359Abstract: Updating statistics in distributed databases includes storing global statistics about at least one distributed table column distributed across multiple database nodes, where the global statistics have sensitive data for a query plan optimization process and insensitive data for the query plan optimization process, and updating the sensitive data of the global statistics more frequently than the insensitive data.Type: ApplicationFiled: November 14, 2012Publication date: November 5, 2015Inventors: Hoa Binh Nga Tran, Benjamin M. Vandiver, Sumeet Suresh Keswani
-
Publication number: 20150088939Abstract: In an example, data from a source location is merged into a target location containing existing data, in which both the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.Type: ApplicationFiled: June 1, 2012Publication date: March 26, 2015Inventors: Hoa Binh Nga Tran, Andrew Allinson Lamb, Matthew Steven Fuller