Dmitry Potapov

dblp:89/6870 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—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
Data mining · 46% Query processing and optimization · 30% Indexing and storage engines · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.312017
Dimensions Based Data Clustering and Zone Maps · Proc. VLDB Endow. 2017
Data mining › data reduction
data pruning
0.312017
Dimensions Based Data Clustering and Zone Maps · Proc. VLDB Endow. 2017
Query processing and optimization › runtime optimization › data skipping
partition pruning
0.312017
Dimensions Based Data Clustering and Zone Maps · Proc. VLDB Endow. 2017
Indexing and storage engines › synopsis structure
zone maps
0.312017
Dimensions Based Data Clustering and Zone Maps · Proc. VLDB Endow. 2017
Storage systems
data compression
0.012003
Data Compression in Oracle · VLDB 2003
Database system architecture and tuning
commercial database systems
0.012003
Data Compression in Oracle · VLDB 2003
YearPublicationVenuePosition
2017 Dimensions Based Data Clustering and Zone Maps
abstract
In recent years, the data warehouse industry has witnessed decreased use of indexing but increased use of compression and clustering of data facilitating efficient data access and data pruning in the query processing area. A classic example of data pruning is the partition pruning, which is used when table data is range or list partitioned. But lately, techniques have been developed to prune data at a lower granularity than a table partition or sub-partition. A good example is the use of data pruning structure called zone map. A zone map prunes zones of data from a table on which it is defined. Data pruning via zone map is very effective when the table data is clustered by the filtering columns. The database industry has offered support to cluster data in tables by its local columns, and to define zone maps on clustering columns of such tables. This has helped improve the performance of queries that contain filter predicates on local columns. However, queries in data warehouses are typically based on star/snowflake schema with filter predicates usually on columns of the dimension tables joined to a fact table. Given this, the performance of data warehouse queries can be significantly improved if the fact table data is clustered by columns of dimension tables together with zone maps that maintain min/max value ranges of these clustering columns over zones of fact table data. In recognition of this opportunity of significantly improving the performance of data warehouse queries, Oracle 12c release 1 has introduced the support for dimension based clustering of fact tables together with data pruning of the fact tables via dimension based zone maps.
Mohamed Ziauddin, Andrew Witkowski, You Jung Kim, Janaki Lahorani, Dmitry Potapov, Murali Krishna
Proc. VLDB Endow.5
2003 Data Compression in Oracle
Meikel Pöss, Dmitry Potapov
VLDB2