Dbm (discuter | contributions) (→SQLfast) |
Dbm (discuter | contributions) (→SQLfast) |
||
Ligne 194 : | Ligne 194 : | ||
<br> | <br> | ||
− | :*SQLfast Tutorial - <font color=" | + | :*SQLfast Tutorial - <font color="black"><b>From data bulk loading to database book writing</b>, draft version, <i>January 10, 2016.</i></font>[https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto31-Topo-sort.pdf [full text]] |
::''Chapter contents'': Topological sorting. The database loading problem. Dealing with non acyclic graphs. Finding the independent circuits of a graph. Graph contraction and condensation. Ordering topics for a database book. | ::''Chapter contents'': Topological sorting. The database loading problem. Dealing with non acyclic graphs. Finding the independent circuits of a graph. Graph contraction and condensation. Ordering topics for a database book. | ||
Ligne 224 : | Ligne 224 : | ||
::''Chapter contents'': Database performance evaluation. Generating high volume of synthetic data. Integrating heterogeneous data sources. Data cleaning. Data anonymization. Random data extraction. Executing very large scripts. Query performance. | ::''Chapter contents'': Database performance evaluation. Generating high volume of synthetic data. Integrating heterogeneous data sources. Data cleaning. Data anonymization. Random data extraction. Executing very large scripts. Query performance. | ||
− | :*SQLfast Tutorial - <font color=" | + | :*SQLfast Tutorial - <font color="black"><b>Directory management</b>, draft version. March 5, 2017. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto48-Directory-Management.pdf [full text]]</font>. |
::''Chapter contents'': File and directory management. File and directory hierarchy representation. Tree processing. Recursive queries. Hierarchy evolution. Hierarchy comparison. Searching for file clones. | ::''Chapter contents'': File and directory management. File and directory hierarchy representation. Tree processing. Recursive queries. Hierarchy evolution. Hierarchy comparison. Searching for file clones. | ||
− | :*SQLfast Tutorial - <font color=" | + | :*SQLfast Tutorial - <font color="black"><b>Path finders, rovers and Ariadne's thread</b>, draft version. December 5, 2016. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto52-Shortest-path.pdf [full text]]</font>. |
::''Chapter contents'': Computing the shortest path between cities, Dijkstra's algorithm, controlling a rover, solving mazes. | ::''Chapter contents'': Computing the shortest path between cities, Dijkstra's algorithm, controlling a rover, solving mazes. | ||
<br> | <br> | ||
Ligne 260 : | Ligne 260 : | ||
:*SQLfast Tutorial - <b>Lies, damned lies, and statistics</b>, writing in progress. | :*SQLfast Tutorial - <b>Lies, damned lies, and statistics</b>, writing in progress. | ||
− | :*SQLfast Tutorial - <b>< | + | :*SQLfast Tutorial - <b>Pivot table: from columns to rows</b>, writing in progress. |
+ | |||
+ | :*SQLfast Tutorial - <b>Classification (Formal Concept Analysis)</b>, writing in progress. | ||
:*SQLfast Tutorial - <b>Business process modeling - Building a workflow engine</b>, writing in progress. | :*SQLfast Tutorial - <b>Business process modeling - Building a workflow engine</b>, writing in progress. |
<Retour à la page d'accueil / Back>
Sommaire |
SQLfast Tutorial - Part 1: INTRODUCTION TO DATABASE PROGRAMMING
SQLfast Tutorial - Part 2: PROBLEM SOLVING WITH DATABASES - CASE STUDIES
Case studies in preparation