Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ekrem Soylemez

dblp:163/3965 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 60% Database system architecture and tuning · 20% Indexing and storage engines · 15%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
aggregation
0.312018
Accelerating Joins and Aggregations on the Oracle In-Memory Database · ICDE 2018
Query processing and optimization
join processing
0.312018
Accelerating Joins and Aggregations on the Oracle In-Memory Database · ICDE 2018
Database system architecture and tuning
main-memory database
0.212015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015
Indexing and storage engines › column store
main-memory column store
0.112018
Accelerating Joins and Aggregations on the Oracle In-Memory Database · ICDE 2018
Indexing and storage engines
columnar storage
0.112015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015
Transaction processing and concurrency control › consistency
transactional consistency
0.112015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015

Methods — techniques the papers use, named apart from their topics

SIMD vectorization · 0.3row-column dual format · 0.2
YearPublicationVenuePosition
2018 Accelerating Joins and Aggregations on the Oracle In-Memory Database
abstract
OLAP and real-time analytic workloads in data management systems are dominated by joins, aggregations, scan and filtering costs. In-Memory columnar databases have successfully optimized scans by many orders of magnitude using compressed data formats and SIMD vectorization techniques, but have largely made little impact to the rest of the query execution plan. The Oracle Database In-Memory (DBIM) Option introduced new SQL execution operators that accelerate a wide range of analytic queries, delivering orders of magnitude performance improvement by optimizing aggregation over joins for star and similar schemas. Group-by expressions are pushed down into the scans of dimension tables, creating a unique key per distinct group called a Dense Grouping Key (DGK). A structure called a Key Vector is allocated that maps join keys to DGKs, which is used to filter non-matching rows during the fact table scan. Passing rows are then aggregated directly on compressed codes into DGK-indexed result buffers using SIMD and other novel aggregation techniques. Our innovative solution replaces traditional join and group-by processing (bloom filters, hash table build and probe, serial aggregation) with blazing fast inlined scan operators. And with DBIM's unique dual-format architecture, DML activity (inserts, updates, deletes) do not dampen the phenomenal gains we see with our solution. Using a set of aggregation-heavy queries against the Star Schema Benchmark (SSB) schema, we show that our technique can drastically reduce query elapsed time by more than 10x, making real-time analytics truly achievable.
Shasank Chavan, Albert Hopeman, Dennis Lui, Ajit Mylavarapu, Ekrem Soylemez
ICDE6
2015 Oracle Database In-Memory: A dual format in-memory database
abstract
The Oracle Database In-Memory Option allows Oracle to function as the industry-first dual-format in-memory database. Row formats are ideal for OLTP workloads which typically use indexes to limit their data access to a small set of rows, while column formats are better suited for Analytic operations which typically examine a small number of columns from a large number of rows. Since no single data format is ideal for all types of workloads, our approach was to allow data to be simultaneously maintained in both formats with strict transactional consistency between them.
Tirthankar Lahiri, Shasank Chavan, Maria Colgan, Dinesh Das, Amit Ganesh, Mike Gleeson, Sanket Hase, Allison Holloway, Jesse Kamp, Teck-Hua Lee, Juan Loaiza, Neil MacNaughton, Vineet Marwah, Niloy Mukherjee, Atrayee Mullick, Sujatha Muthulingam, Vivekanandhan Raja, Marty Roth, Ekrem Soylemez, Mohamed Zaït
ICDE19