Topological sorting and the ETL process

In this paper, we point out that a typical ETL process to populate a database can be thought of as an acyclic directed graph and that existing graph algorithms can thus be used to resolve the order of processing the tables in the load process. While simple databases can easily be managed manually, such methods prove very useful with big and complex data warehouses. We extend an existing sorting algorithm to provide with information on which tables can be loaded in parallel.

Download the paper here.

Thanks for your registration!

Making NLP easyGT-Conference Talk: Zhamak DehghaniDan Linstedt @ D ONEX-Mas: A Closer Look at StoriesArtificial Intelligence in Claim ManagementTalk @ Google Data Cloud Live: Athensinside-it 9. Mai 2018HWZ Yea(h)rbook 2017 FachbeitragSave the Date: common sense18/01D ONE is on MediumWe're at the Data+AI Summit in San Francisco!Data Intelligence Days - introducing a Data PlatformReal-Time Tracking of Swiss Covid-19 CasesInsights of the Data Vault 2.0 Bootcamp with Dan LinstedtMachine learning for productionStart up Winji in der NZZInnovationsschub in Anwaltskanzleien durch Startup Herlock.aiStrata LondonBuilding a Data Vault using dbtvault with google BigQueryData Vault 2.0 Bootcamp and certification with Dan Linstedt by D ONE