Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Optimisation des requêtes× | Stratégie d'indexation× | |
|---|---|---|
| Domaine | Systèmes d'information | Systèmes d'information |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1979 | 1972 |
| Auteur d'origine≠ | IBM San Jose Research Laboratory | Rudolf Bayer and Edward M. McCreight |
| Type | Database optimization technique | Database optimization technique |
| Source fondatrice≠ | Jarke, M., & Koch, J. (1984). Query optimization in database systems. ACM Computing Surveys, 16(2), 111-152. DOI ↗ | Bayer, R., & McCreight, E. (1972). Organization and maintenance of large ordered indices. Acta Informatica, 1(3), 173-189. DOI ↗ |
| Alias≠ | — | index design, indexing |
| Apparentées≠ | 2 | 1 |
| Résumé≠ | Query optimization is a critical process in database management that transforms high-level SQL queries into efficient execution plans. Developed systematically by IBM researchers in the late 1970s, it aims to minimize execution time, disk I/O, and resource consumption by selecting the most effective access paths and join strategies. | Indexing strategy is the practice of systematically designing database indexes to accelerate query performance. Developed following Bayer and McCreight's foundational B-tree work in 1972, effective indexing requires analyzing query patterns, choosing appropriate index structures, and maintaining index health as data evolves. |
| ScholarGateJeu de données ↗ |
|
|