Intelligently utilizing non-matching weighted indexes
US-2015154254-A1 · Jun 4, 2015 · US
US9679014B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9679014-B2 |
| Application number | US-201414467312-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 25, 2014 |
| Priority date | Jun 12, 2014 |
| Publication date | Jun 13, 2017 |
| Grant date | Jun 13, 2017 |
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 data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value.
Opening claim text (preview).
What is claimed is: 1. A method for generating a cached memory space, wherein the cached memory space is a data sharing space (DSS) for a base table having a set of rows with stored data, the method comprising: receiving a set of requests to generate tables, each request including a query to the base table, wherein the set of requests includes a first query to generate a first table, a second query to generate a second table, and a third query to generate a third table; accessing a row from the set of rows; applying each query to the row to generate a set of query results, wherein the first table and the second table include a same row from the base table as a query result; determining an index value for the row based on the query results; storing, based on the index value, at least a portion of the row in the DSS, wherein the index value is used to map a location of the portion of the row stored in the DSS; storing the same row in the DSS; determining that the first query, the second query, and the third query are a common query; and directing, in response to determining that the third query is the common query, the third query to the DSS to retrieve the same row. 2. The method of claim 1 , further comprising: indicating the tables that include the row using the index value. 3. The method of claim 2 , further comprising: generating an individual binary bit value using each query result from the set of query results; and indicating a table from the tables, corresponding to the individual binary bit, includes the row. 4. The method of claim 1 , wherein receiving a set of requests to generate tables includes requests to update the tables. 5. The method of claim 1 , further comprising: checking a table from the tables for a share parameter in response to accessing the row. 6. The method of claim 5 , further comprising: determining the at least a portion of the row is stored in the DSS using the share parameter. 7. The method of claim 5 , further comprising: determining the table is to be updated using the share parameter.
Database cache management · CPC title
Column-oriented storage; Management thereof · CPC title
using cached or materialised query results · CPC title
Vectors, bitmaps or matrices · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.