OPTIMIZATION IN VERY LARGE DATABASES BY PARTITIONING TABLES

cris.lastimport.scopus2024-09-17T01:30:56Z
dc.abstract.enVery 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.
dc.affiliationTransportu i Informatyki
dc.contributor.authorPiotr Bednarczuk
dc.date.accessioned2024-07-08T10:53:58Z
dc.date.available2024-07-08T10:53:58Z
dc.date.issued2020
dc.identifier.doi10.35784/iapgos.2056
dc.identifier.issn2391-6761
dc.identifier.issn2083-0157
dc.identifier.urihttps://repo.akademiawsei.eu/handle/item/402
dc.languageen
dc.pbn.affiliationinformation and communication technology
dc.relation.ispartofInformatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
dc.rightsCC-BY
dc.subject.enpartitioning
dc.subject.endata warehouse optimization
dc.subject.enbillionsofrecords
dc.subject.enAdventureWorksDW
dc.titleOPTIMIZATION IN VERY LARGE DATABASES BY PARTITIONING TABLES
dc.typeReviewArticle
dspace.entity.typePublication
oaire.citation.issue3
oaire.citation.volume10