Table scan predicate with integrated semi-join filter
US-2024419650-A1 · Dec 19, 2024 · US
US10318507B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10318507-B2 |
| Application number | US-201815992641-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 30, 2018 |
| Priority date | May 22, 2015 |
| Publication date | Jun 11, 2019 |
| Grant date | Jun 11, 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.
Methods and systems for database optimization include compacting columns in an unoptimized database that co-appear in queries to the database into a single hyper-column using a processor to form an optimized database. Queries are received according to a schema for the unoptimized database. The received queries are translated into queries according to a schema for the optimized database.
Opening claim text (preview).
The invention claimed is: 1. A method for database optimization, comprising: compacting a plurality of columns in an unoptimized database that co-appear in queries to the database into a single hyper-column using a processor to form an optimized database; and receiving queries according to a schema for the unoptimized database; and translates the received queries into queries according to a schema for the optimized database. 2. The method of claim 1 , wherein the plurality of columns co-appear in select clauses. 3. The method of claim 1 , wherein the plurality of columns co-appear in where clauses. 4. The method of claim 1 , further comprising generating an index for the hyper-column. 5. The method of claim 4 , wherein entries for the hyper-column comprise only numerical data and wherein the index is an R-tree. 6. The method of claim 1 , further comprising compressing entries in the hyper-column if the entries in the hyper-column consist of textual data. 7. The method of claim 1 , wherein detecting the plurality of columns that co-appear in queries to the database comprises performing clustering across all columns in the database. 8. The method of claim 7 , wherein performing clustering comprises an approximation of K-minimum cut. 9. The method of claim 1 , wherein generating the interface comprises generating a virtual view of the database according to the schema for the unoptimized database. 10. The method of claim 1 , further comprising representing the columns in the unoptimized database as a unidirected graph, with nodes of the graph representing columns and with edges of the graph representing a co-appearing frequency for the connected columns. 11. The method of claim 1 , wherein each entry in the hyper-column comprises data from a corresponding entry in each of the plurality of columns.
Column-oriented storage; Management thereof · CPC title
Join order optimisation · CPC title
Electricity · mapped topic
Tablespace storage structures; Management thereof · CPC title
Trees, e.g. B+trees · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.