OPTIMIZATION IN VERY LARGE DATABASES BY PARTITIONING TABLES

Main Article Content

DOI

Piotr Bednarczuk

piotr.bednarczuk@wsei.lublin.pl

https://orcid.org/0000-0003-1933-7183

Abstract

Very large databases like data warehouse slow down over time. This is usually due to a large daily increase in the data in the individual tables, counted in millions of records per day. How do we make sure our queries do not slow down over time? Table partitioning comes in handy, and, when used correctly, can ensure the smooth operation of very large databases with billions of records, even after several years.

Keywords:

partitioning, data warehouse optimization, billions of records, AdventureWorksDW

References

Article Details

Bednarczuk, P. (2020). OPTIMIZATION IN VERY LARGE DATABASES BY PARTITIONING TABLES. Informatyka, Automatyka, Pomiary W Gospodarce I Ochronie Środowiska, 10(3), 95–98. https://doi.org/10.35784/iapgos.2056