OPTIMIZATION IN VERY LARGE DATABASES BY PARTITIONING TABLES

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free