Entit Software LLC

Micro Focus Lcc

Hewlett-packard Development Company, L.p.

Matthew Steven Fuller

Andrew Allinson Lamb

Lakshmikant Shrinivas

Hoa Binh Nga Tran

William Frederick Mann, Iii

Benjamin M Vandiver

Charles Edward Bear

Hongmin Fan

Mingsheng Hong

Adam Benjamin Seering

Sreenath Bodagala

In some examples, formatting semi-structured data in a database includes obtaining semi-structured data in a column store database, assigning the semi-structured data to a semi-structured column with a key and value format, and formatting the semi-structured data with an optimal search format.

Formatting semi-structured data in a database

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.

Merging data from a source location into a target location

A method for query processing includes receiving a query, and determining a query type by determining if the query is a structured query language (SQL) query including multiple distinct aggregates (MDAs), or a SQL query including cube, rollup or grouping sets operations. Based on the determination, the method includes processing the query to generate an output, and performing a predetermined number of maximum group by operations on the output based on the query type to generate a response to the query.

Query processing

A query that is submitted to a database is analyzed so as to determine a join order restriction. The join order restriction is associated with a join between two tables of a plurality of tables of the database that participate in the query. The join order restriction constrains its associated join to be executed prior to another join of the query. At least one join plan is generated, the join plan being constrained by the join order restriction. Different join plans include different join orders. A join plan is selected from among the join plans for execution of the query.

Join order restrictions

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.

A record-pattern expression of a record pattern of data records is translated to a character-pattern expression of a character pattern. A data-record series of data records is converted to a character string in which each character in the character string corresponds to a respective data record in the data-record series. Pattern instances of the character pattern in the character string are searched to identify ordinal character positions in the character string of characters in the character pattern instances. Data records at ordinal record positions in the record series of data records corresponding to the ordinal character positions are reported.

Growing community of inventors

Medfield, MA, United States of America

Matthew Steven Fuller