Dbm (discuter | contributions) (→SQLfast) |
Dbm (discuter | contributions) (→SQLfast) |
||
Ligne 202 : | Ligne 202 : | ||
::''Chapter contents'': An emergency situation. First mission: recovering the data. The basic functions. Conclusion. | ::''Chapter contents'': An emergency situation. First mission: recovering the data. The basic functions. Conclusion. | ||
− | :*<b>Case 4. Schema-less databases (1)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 4. Schema-less databases (1)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case04-Schemaless-DB(1).pdf [full text]] |
::''Chapter contents'': Introduction. The Universal table model. Column-oriented data model. | ::''Chapter contents'': Introduction. The Universal table model. Column-oriented data model. | ||
− | :*<b>Case 5. Schema-less databases (2)</b>, draft version, February 13, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 5. Schema-less databases (2)</b>, draft version, February 13, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case05-Schemaless-DB(2).pdf [full text]] |
::''Chapter contents'': The Key-Value model - Version 1. The Key-Value model - Version 2. Generation of generators. | ::''Chapter contents'': The Key-Value model - Version 1. The Key-Value model - Version 2. Generation of generators. | ||
− | :*<b>Case 6. Schema-less databases (3)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 6. Schema-less databases (3)</b>, draft version, April 6, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case06-Schemaless-DB(3).pdf [full text]] |
::''Chapter contents'': Object-oriented view of Key-Value data. Objects with complex properties. Indexing objects. Comparison of the data models. | ::''Chapter contents'': Object-oriented view of Key-Value data. Objects with complex properties. Indexing objects. Comparison of the data models. | ||
− | :*<b>Case 14. The book of which you are the hero</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 14. The book of which you are the hero</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case14-Game-Books.pdf [full text]] |
::''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. | ::''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. | ||
− | :*<font color="black"><b>Case 15. Directory management</b>, draft version. March 5, 2017. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<font color="black"><b>Case 15. Directory management</b>, draft version. March 5, 2017. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case15-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. | ||
− | :*<b>Case 21. Test Database Generation</b>, draft version, December 4, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 21. Test Database Generation</b>, draft version, December 4, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case21-Test-databases.pdf [full text]] |
::''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. | ||
− | :*<b>Case 24. Kings of France - Part 1</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 24. Kings of France - Part 1</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case24-Kings-of-France(1).pdf [full text]] |
::''Chapter contents'': Introduction. Data structures. Warming up: some easy queries. Rebuilding royal families. King succession. Seeking missing kings. Royal conflicts. | ::''Chapter contents'': Introduction. Data structures. Warming up: some easy queries. Rebuilding royal families. King succession. Seeking missing kings. Royal conflicts. | ||
− | :*<b>Case 25. Kings of France - Part 2</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 25. Kings of France - Part 2</b>, draft version, October 1, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case25-Kings-of-France(2).pdf [full text]] |
::''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. | ::''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. | ||
− | :*<b>Case 27. Conway's Game of Life</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<b>Case 27. Conway's Game of Life</b>, draft version, June 2, 2014. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case27-Life-Game.pdf [full text]] |
::''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. | ::''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. | ||
− | :*<font color="black"><b>Case 28. 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- | + | :*<font color="black"><b>Case 28. 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-Case28-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>Case 31. Path finders, rovers and Ariadne's thread</b>, draft version. December 5, 2016. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast- | + | :*<font color="black"><b>Case 31. Path finders, rovers and Ariadne's thread</b>, draft version. December 5, 2016. [https://staff.info.unamur.be/dbm/Documents/Tutorials/SQLfast/SQLfast-Case31-Shortest-path.pdf [full text]]</font>. |
::''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. | ::''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> |
<Retour à la page d'accueil / Back>
Sommaire |
Case studies in preparation