Search time estimate in a data intake and query system
US-2020364223-A1 · Nov 19, 2020 · US
US12360997B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12360997-B2 |
| Application number | US-202017114786-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 8, 2020 |
| Priority date | Dec 8, 2020 |
| Publication date | Jul 15, 2025 |
| Grant date | Jul 15, 2025 |
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 method, a computer program product, and a system for scheduling a first query execution plan for executing a first query for accessing first data sets of data of a relational database system (RDBS) and a second query execution plan for executing a second query for accessing second data sets of the data. The data is divided into data blocks of data sets of the data, wherein metadata of the RDBS comprises respective information about at least one property of the data sets of a respective data block of the data blocks. The scheduling may be performed on the basis of an examination if there is a common partition between a first partition of data blocks which may fulfill a first condition according to the first query and a second partition of data blocks which may fulfill a second condition according to the second query.
Opening claim text (preview).
What is claimed is: 1. A computer implemented method for scheduling a set of query execution plans, the set of query execution plans, compiled by a query compiler, comprising at least a first query execution plan for executing a first query for accessing first data sets of data of a relational database system (RDBS) and a second query execution plan for executing a second query for accessing second data sets of the data, the data being divided into data blocks of data sets of the data, wherein metadata of the RDBS comprises a respective information about a distribution of data values of the data sets of a respective data block of the data blocks, the respective data block corresponding to an amount of physical space in the RDBS, the method comprising: determining a first partition of the data blocks to be potentially accessed when the first query execution plan is executed on the RDBS on the basis of the metadata and a condition the first data sets have to fulfill according to the first query, wherein the determining includes discarding a first complementary partition of the data blocks on the basis of the metadata and the condition the first data, the first complementary partition of the data blocks representing data blocks of the data not being accessed in case the first query execution plan is executed on the RDBS; determining a second partition of the data blocks to be potentially accessed when the second query execution plan is executed on the RDBS on the basis of the metadata and another condition the second data sets have to fulfill according to the second query, wherein the determining includes discarding a second complementary partition of the data blocks on the basis of the metadata and the condition the second data, the second complementary partition of the data blocks representing data blocks of the data not being accessed in case the second query execution plan is executed on the RDBS; examining, by a workload manager, the first partition and the second partition of the data blocks to determine whether there is a common partition of data blocks of the first partition and the second partition that prevents parallel execution of the first query execution plan and the second query execution plan on the RDBS, wherein the common partition of data blocks is identified when the first partition of the data blocks and the second partition of the data blocks are not disjoint; generating, by the workload manager, a schedule based on the examining, wherein parallel execution of the first query execution plan and the second query execution plan is allowed when no common partition exists, and wherein the schedule indicates an execution of the first query execution plan and the second query execution plan; and scheduling the first query execution plan and the second query execution plan on the RDBS based on the schedule. 2. The method of claim 1 , further comprising: scheduling the first query execution plan and the second query execution plan such that the first query execution plan and the second query execution plan are executed in parallel on the RDBS when no common partition of data blocks of the first partition and the second partition exists. 3. The method of claim 1 , further comprising: scheduling the first query execution plan and the second query execution plan such that a result of the first query execution plan is available in a cache memory of the RDBS for a usage of the second query execution plan when a common partition of data blocks of the first partition and the second partition exists. 4. The method of claim 1 , further comprising: deactivating a locking mechanism of the RDBS for locking at least a part of the first partition of the data blocks and the second partition of the data blocks, the locking mechanism provoking that these data blocks may only be accessed by an execution of a single query execution plan at an instant of time, wherein the locking mechanism is deactivated if there is no common partition of data blocks of the first partition and the second partition. 5. The method of claim 1 , further comprising: activating a locking mechanism of the RDBS for locking the data blocks of the common partition such that these data blocks are only accessed by an execution of a single query execution plan at an instant of time, wherein the locking mechanism is activated when a common partition of data blocks of the first partition and the second partition exists. 6. The method of claim 1 , wherein the respective information is a range in which the data values of the data sets of the respective data block lie, the range is defined by a minimal data value in the respective data block and a maximal data value in the respective data block. 7. The method of claim 6 , wherein the data of the RDBS is stored in the RDBS by using a data table and the range is defined by a minimal data value in a column of the data table in the respective data block and a maximal data value in the column of the data table in the respective data block, the respective data block indicating a respective block of rows of the data table. 8. The method of claim 1 , wherein the respective information describes the distribution of the data values. 9. The method of claim 8 , wherein the data of the RDBS is stored in the RDBS using a data table and the distribution refers to a distribution of the data values in a column of the data table in the respective data block and the respective information describes the distribution of the data values in the column of the data table within the respective data block, the respective data block indicating a respective block of rows of the data table. 10. The method of claim 8 , wherein the distribution is represented by a density vector. 11. The method of claim 1 , wherein one of the two query execution plans, the first or the second query execution plan, is running at an actual instant of time and the other one of the two query execution plans is scheduled to be started at a future instant of time. 12. The method of claim 3 , wherein the first query execution plan and the second query execution plan are scheduled to run immediately after each other. 13. The method of claim 1 , the method further comprising receiving the metadata from a query optimizer of the RDBS. 14. The method of claim 1 , the method further comprising receiving information for specifying the first partition and the second partition from a query optimizer of the RDBS. 15. The method of claim 1 , the method further comprising setting boundary conditions for running a query optimizer of the RDBS such that the common partition is void. 16. A computer program product comprising one or more computer readable storage medium, and program instructions stored on the one or more computer readable storage medium for scheduling a set of query execution plans, compiled by a query compiler, the set of query execution plans comprising at least a first query execution plan for executing a first query for accessing first data sets of data of a relational database system (RDBS) and a second query execution plan for executing a second query for accessing second data sets of the data, the data being divided into data blocks of data sets of the data, wherein metadata of the RDBS comprises a respective information about a distribution of data values of the data sets of a respective data block of the data blocks, the respective data block corresponding to an amount of physical space in the RDBS, the computer instructions comprising: program instructions to determine a first partition of the data blocks to be potentially accessed when the
using cached or materialised query results · CPC title
of parallel queries · CPC title
Plan optimisation · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.