Automatic table schema generation
US-9418085-B1 · Aug 16, 2016 · US
US10261950B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10261950-B2 |
| Application number | US-201314090137-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 26, 2013 |
| Priority date | Nov 26, 2013 |
| Publication date | Apr 16, 2019 |
| Grant date | Apr 16, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A system includes generation of a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client, serialization of the second table into the volatile memory, copying of the serialized second table into a second volatile memory of a data server, de-serialization of the serialized second table into the second volatile memory, determination of a plurality of entries of the first database table which are associated with the second table, and determination of the result set from the plurality of entries based on the query parameters.
Opening claim text (preview).
What is claimed is: 1. A system comprising: a first device comprising: a first volatile memory; and a first processor to execute processor-executable program code in order to cause the first computing device to: generate a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in the volatile memory; and serialize the second table into the volatile memory; and a second device comprising: a second volatile memory; and a second processor to execute processor-executable program code in order to cause the second computing device to: receive the serialized second table in the second volatile memory; de-serialize the serialized second table into the second volatile memory; determine a plurality of entries of the first database table which are associated with the second table; determine the result set from the plurality of entries based on the query parameters; wherein determination of the plurality of entries of the first database table which are associated with the second table comprises: determining JOIN columns of the second table; determining a value identifier for each value in the JOIN columns, based on a data dictionary of the first database table; generating a hash function mapping concatenated value identifiers of each row of the second table to a row of the second table; applying the hash function to concatenated value identifiers of a row of the first database table, the concatenated value identifiers stored in columns of the first database table corresponding to the JOIN columns; determining whether the output of the hash function is a valid hash; and if it is determined that the output of the hash function is a valid hash, determining that the row of the first database table is an entry of the first database table which is associated with the second table. 2. The system according to claim 1 , the second processor to further execute processor-executable program code in order to cause the second computing device to: copy the result set into the first volatile memory. 3. The system according to claim 1 , the first processor to further execute processor-executable program code in order to cause the first computing device to: create a third table in the first volatile memory, the third table including the result set. 4. A method comprising: generating a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client; serializing the second table into the volatile memory; copying the serialized second table into a second volatile memory of a data server; de-serializing the serialized second table into the second volatile memory; determining a plurality of entries of the first database table which are associated with the second table; determining the result set from the plurality of entries based on the query parameters; wherein determining the plurality of entries of the first database table which are associated with the second table comprises: determining JOIN columns of the second table; determining a value identifier for each value in the JOIN columns, based on a data dictionary of the first database table; generating a hash function mapping concatenated value identifiers of each row of the second table to a row of the second table; applying the hash function to concatenated value identifiers of a row of the first database table, the concatenated value identifiers stored in columns of the first database table corresponding to the JOIN columns; determining whether the output of the hash function is a valid hash; and if it is determined that the output of the hash function is a valid hash, determining that the row of the first database table is an entry of the first database table which is associated with the second table. 5. The method according to claim 4 , further comprising: creating a third table in the first volatile memory, the third table including the result set. 6. A non-transitory computer-readable medium storing processor-executable program code, the program code executable to cause a computing device to: generate a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client; serialize the second table into the volatile memory; copy the serialized second table into a second volatile memory of a data server; de-serialize the serialized second table into the second volatile memory; determine a plurality of entries of the first database table which are associated with the second table; determine the result set from the plurality of entries based on the query parameters; wherein determination of the plurality of entries of the first database table which are associated with the second table comprises: determination of JOIN columns of the second table; determination of a value identifier for each value in the JOIN columns, based on a data dictionary of the first database table; generation of a hash function mapping concatenated value identifiers of each row of the second table to a row of the second table; application of the hash function to concatenated value identifiers of a row of the first database table, the concatenated value identifiers stored in columns of the first database table corresponding to the JOIN columns; determination of whether the output of the hash function is a valid hash; and if it is determined that the output of the hash function is a valid hash, determination that the row of the first database table is an entry of the first database table which is associated with the second table.
of query operations · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.