Dbm (discuter | contributions) (→SQLfast) |
Dbm (discuter | contributions) (→SQLfast) |
||
Ligne 230 : | Ligne 230 : | ||
:*<font color="black"><b>From data bulk loading to database book writing</b>, draft version, <i>January 10, 2017.</i></font>[https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto31-Topo-sort.pdf [full text]] | :*<font color="black"><b>From data bulk loading to database book writing</b>, draft version, <i>January 10, 2017.</i></font>[https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto31-Topo-sort.pdf [full text]] | ||
::''Chapter contents'': Introduction. The database loading problem. Representing the table graph of a database. Topological sorting of the table graph. Coping with non acyclic graphs. Cyclic vs hard cyclic kernel of a table graph. Contracting the circuits of the hard kernel. Finding the independent circuits of a graph. Finding the super circuits of a graph. Building the final acyclic graph. Optimizing the final acyclic graph. Loading data: a complex abstract example. The complete data loading generation procedure. Loading the data of a super circuit. Loading data: a real example. Brute force data loading technique. Performance. Complement: extracting the table graph of a database. Topological sorting: application to book development. Other applications. | ::''Chapter contents'': Introduction. The database loading problem. Representing the table graph of a database. Topological sorting of the table graph. Coping with non acyclic graphs. Cyclic vs hard cyclic kernel of a table graph. Contracting the circuits of the hard kernel. Finding the independent circuits of a graph. Finding the super circuits of a graph. Building the final acyclic graph. Optimizing the final acyclic graph. Loading data: a complex abstract example. The complete data loading generation procedure. Loading the data of a super circuit. Loading data: a real example. Brute force data loading technique. Performance. Complement: extracting the table graph of a database. Topological sorting: application to book development. Other applications. | ||
− | |||
− | |||
− | |||
:*<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>. | :*<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>. | ||
Ligne 241 : | Ligne 238 : | ||
<br> | <br> | ||
<!-- ------------------------------------------------------------------------------ --> | <!-- ------------------------------------------------------------------------------ --> | ||
− | :*<b> | + | :*<b>The human factor (Managing a small library)</b>, writing in progress. |
− | <!-- ::''Chapter contents'': | + | <!-- ::''Chapter contents'': . --> |
+ | |||
+ | :*<b>Interactive SQLfast interpreters (incl. Self-assessment SQL training tutor)</b>, writing in progress. | ||
+ | |||
+ | :*<b>Schema-driven code generation</b>, writing in progress. | ||
:*<b>Active databases</b>, writing in progress. | :*<b>Active databases</b>, writing in progress. | ||
− | |||
− | :*<b>Temporal databases</b>, writing in progress. | + | :*<b>Temporal databases - Part 1: Representation, management and simple queries</b>, writing in progress. |
− | + | ||
− | :*<b> | + | :*<b>Temporal databases - Part 2: Join, projection and grouping</b>, writing in progress. |
− | + | ||
− | :*<b> | + | :*<b>Pivot tables: from columns to rows</b>, writing in progress. |
− | + | ||
:*<b>Geographic information systems</b>, writing in progress. | :*<b>Geographic information systems</b>, writing in progress. | ||
− | :*<b> | + | :*<b>Database security</b>, writing in progress. |
− | :*<b> | + | :*<b>Lies, damned lies, and statistics</b>, writing in progress. |
− | + | ||
− | :*<b> | + | :*<b>Bis repetita non (always) placent (Detecting and controlling redundancies)</b>, writing in progress. |
− | :*<b> | + | :*<b>Data analysis and cleaning</b>, writing in progress. |
− | :*<b> | + | :*<b>Database reverse engineering</b>, writing in progress. |
− | :*<b> | + | :*<b>Database prototyping</b>, writing in progress. |
− | :*<b> | + | :*<b>Database Performance</b>, writing in progress. |
+ | <!-- ::''Chapter contents'': Database performance tuning. Index types. The roles of cache memories. Performance evaluation pitfalls. Optimizing select queries. Optimizing data modification queries. Optimizing group by and order by queries. --> | ||
− | :*<b> | + | :*<b>Object/Relational mapping <i>vs</i> Active database</b>, writing in progress. |
− | :*<b> | + | :*<b>Text processing</b>, writing in progress |
− | :*<b> | + | :*<b>Bill of material</b>, rewriting in progress. |
+ | <!-- ::''Chapter contents'': Introduction. The BOM database. The part list of a part. Closure of a BOM. A Tale of Two Worlds. Computing the unit cost of all parts. Updating a BOM. Simulating recursive queries through SQLfast. --> | ||
− | :*<b> | + | :*<b>Classification (Formal Concept Analysis)</b>, writing in progress. |
− | :*<b> | + | :*<b>Business process modeling - Building a workflow engine</b>, writing in progress. |
<br> | <br> | ||
<Retour à la page d'accueil / Back>
Sommaire |
Case studies in preparation