Muestra las diferencias entre dos versiones de la página.
| Ambos lados, revisión anterior Revisión previa Próxima revisión | Revisión previa | ||
|
wiki2:global [2020/06/22 09:39] alfred [Questions to make] |
wiki2:global [2021/02/18 14:37] (actual) |
||
|---|---|---|---|
| Línea 82: | Línea 82: | ||
| </code> | </code> | ||
| ===== Python ===== | ===== Python ===== | ||
| + | |||
| + | ==== Examples ==== | ||
| + | |||
| + | * [[https://stackoverflow.com/a/24846766|Fibonacci]] | ||
| ==== Generators ==== | ==== Generators ==== | ||
| Línea 197: | Línea 201: | ||
| Partitioning of relational data usually refers to decomposing your tables either row-wise (horizontally) or column-wise (vertically). | Partitioning of relational data usually refers to decomposing your tables either row-wise (horizontally) or column-wise (vertically). | ||
| + | ==== Modified Preorder Tree Traversal (MPTT) ==== | ||
| + | |||
| + | MPTT is a technique for storing hierarchical data in a database. The aim is to make retrieval operations very efficient. | ||
| + | |||
| + | The trade-off for this efficiency is that performing inserts and moving items around the tree is more involved, as there's some extra work required to keep the tree structure in a good state at all times. | ||
| + | |||
| + | * https://www.sitepoint.com/hierarchical-data-database/ | ||
| + | * http://mikehillyer.com/articles/managing-hierarchical-data-in-mysql/ | ||
| + | * https://www.ibase.ru/files/articles/programming/dbmstrees/sqltrees.html | ||
| ===== Networking ===== | ===== Networking ===== | ||