2015
DOI: 10.14778/2824032.2824074
|View full text |Cite
|
Sign up to set email alerts
|

Query optimization in Oracle 12c database in-memory

Abstract: Traditional on-disk row major tables have been the dominant storage mechanism in relational databases for decades. Over the last decade, however, with explosive growth in data volume and demand for faster analytics, has come the recognition that a different data representation is needed. There is widespread agreement that in-memory column-oriented databases are best suited to meet the realities of this new world. Oracle 12c Database In-memory, the industry's first dual-format database, allows existing row majo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
13
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 11 publications
1
13
0
Order By: Relevance
“…Once the query is coordinated, the SQL query optimizer [13] calculates the degree of parallelism based on the cost of accessing the in-memory object and ensures that at least one parallel execution scanner process gets allocated on the instances populated with the IMCUs for the in-memory object.…”
Section: B Parallel Query Execuiion In a Stable Clustermentioning
confidence: 99%
“…Once the query is coordinated, the SQL query optimizer [13] calculates the degree of parallelism based on the cost of accessing the in-memory object and ensures that at least one parallel execution scanner process gets allocated on the instances populated with the IMCUs for the in-memory object.…”
Section: B Parallel Query Execuiion In a Stable Clustermentioning
confidence: 99%
“…Highly selective OLTP-style queries (e.g. lookup by primary key) are directed by the Optimizer [7] to use the row format, while analytic queries are directed by the Optimizer to use the column formatregardless of which format is used, the same results are returned by the query.…”
Section: Overview Of Oracle Database In-memorymentioning
confidence: 99%
“…The logical expression tree is then processed by the optimizer to generate an execution plan. The optimizer will generate an inmemory execution plan (via the table scan row source) if the cost is less than a non-in-memory plan [7]. The optimizer takes filter and decompression costs into consideration, as well as the percentage of the table being processed in-memoryrecall that with Oracle DBIM, the entire table/segment need not be inmemory [4].…”
Section: Sql Compilation and Optimizationmentioning
confidence: 99%
“…Unlike CPU caches where data is loaded into the cache for free before being used, database caches incur additional overhead reading, parsing and storing intermediate results into an in-memory cache. For the sake of simplicity, however, commercial DBMS and analytics systems use relatively straightforward caching policies [14,33]. First, they cache data in memory using a fixed, pre-defined layout [8,14,33].…”
Section: Introductionmentioning
confidence: 99%
“…For the sake of simplicity, however, commercial DBMS and analytics systems use relatively straightforward caching policies [14,33]. First, they cache data in memory using a fixed, pre-defined layout [8,14,33]. Moreover, they use relatively naive cache admission and eviction policies.…”
Section: Introductionmentioning
confidence: 99%