Dbm (discuter | contributions) (→SQLfast) |
Dbm (discuter | contributions) (→SQLfast) |
||
Ligne 194 : | Ligne 194 : | ||
:*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]] | :*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'': | + | ::''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. |
:*SQLfast Tutorial - <b>Conway's Game of Life</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto32-Life-Game.pdf [full text]] | :*SQLfast Tutorial - <b>Conway's Game of Life</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto32-Life-Game.pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': Introduction. World and automata representation. Computing the next state. Graphical display of automaton evolution. Generation of SQLdraw scripts. Packaging the LIFE application. First performance analysis. Optimization 1: indexing tables. Optimization 2: windowing table access. Optimization 3: building a cheap world. A last, desperate, and (fortunately) unsuccessful optimization. Putting things together. Some representative automata. Family life. Conclusion. |
:*SQLfast Tutorial - <b>Kings of France - Part 1</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto35-Kings-of-France.pdf [full text]] | :*SQLfast Tutorial - <b>Kings of France - Part 1</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto35-Kings-of-France.pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': Introduction. Data structures. Warming up: some easy queries. Rebuilding royal families. King succession. Seeking missing kings. Royal conflicts. |
:*SQLfast Tutorial - <b>Kings of France - Part 2</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto36-Kings-of-France(2).pdf [full text]] | :*SQLfast Tutorial - <b>Kings of France - Part 2</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto36-Kings-of-France(2).pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': The ancestor/descendant relationships. Counting descendants. The descendants of a member. Graphical representation of king genealogy - version 1. Graphical representation of king genealogy - version 2. Recovering the source data from their closure. Extracting the hierarchy of kings. |
:*SQLfast Tutorial - <b>Schema-less databases (1)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto39-Schemaless-DB(1).pdf [full text]] | :*SQLfast Tutorial - <b>Schema-less databases (1)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto39-Schemaless-DB(1).pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': Introduction. The Universal table model. Column-oriented data model. |
:*SQLfast Tutorial - <b>Schema-less databases (2)</b>, draft version, February 13, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto40-Schemaless-DB(2).pdf [full text]] | :*SQLfast Tutorial - <b>Schema-less databases (2)</b>, draft version, February 13, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto40-Schemaless-DB(2).pdf [full text]] | ||
− | ::''Chapter contents'': The Key-Value | + | ::''Chapter contents'': The Key-Value model - Version 1. The Key-Value model - Version 2. Generation of generators. |
:*SQLfast Tutorial - <b>Schema-less databases (3)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto41-Schemaless-DB(3).pdf [full text]] | :*SQLfast Tutorial - <b>Schema-less databases (3)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto41-Schemaless-DB(3).pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': Object-oriented view of Key-Value data. Objects with complex properties. Indexing objects. Comparison of the data models. |
:*SQLfast Tutorial - <b>Bill of material</b>, rewriting in progress. | :*SQLfast Tutorial - <b>Bill of material</b>, rewriting in progress. | ||
− | ::''Chapter contents'': The BOM | + | ::''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. |
:*SQLfast Tutorial - <b>The book of which you are the hero</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto44-Game-Books.pdf [full text]] | :*SQLfast Tutorial - <b>The book of which you are the hero</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto44-Game-Books.pdf [full text]] | ||
− | ::''Chapter contents'': | + | ::''Chapter contents'': Interactive adventure books and computer games. Choosing a sample game book. Designing a text-based interactive adventure game. Story telling. Structure of a game. Analyzing a game. Counting the number of paths. Merging episodes. Toward a better game engine. |
:*SQLfast Tutorial - <b>Test Database Generation</b>, draft version, December 4, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto46-Test-databases.pdf [full text]] | :*SQLfast Tutorial - <b>Test Database Generation</b>, draft version, December 4, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Tuto46-Test-databases.pdf [full text]] | ||
Ligne 227 : | Ligne 227 : | ||
:*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>. | :*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 | + | ::''Chapter contents'': Shortest paths between two cities. Dijkstra’s Algorithm. Representation of the graph. Computing the shortest paths from a starting city. Building a general purpose shortest path engine. Ariadne’s thread: solving mazes. Exploring a planet. Performance and optimization. |
<br> | <br> | ||
<big>'''Case studies in preparation'''</big> | <big>'''Case studies in preparation'''</big> | ||
Ligne 255 : | Ligne 255 : | ||
:*SQLfast Tutorial - <b>Text processing</b>, writing in progress | :*SQLfast Tutorial - <b>Text processing</b>, writing in progress | ||
− | :*SQLfast Tutorial - <b>Object/Relational mapping <i>vs</i> | + | :*SQLfast Tutorial - <b>Object/Relational mapping <i>vs</i> Active database</b>, writing in progress. |
:*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>Pivot | + | :*SQLfast Tutorial - <b>Pivot tables: from columns to rows</b>, writing in progress. |
:*SQLfast Tutorial - <b>Classification (Formal Concept Analysis)</b>, writing in progress. | :*SQLfast Tutorial - <b>Classification (Formal Concept Analysis)</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