Transact-SQL cookbook
This unique cookbook contains a wealth of solutions to problems that SQL programmers face all the time. The recipes inside range from how to perform simple tasks, like importing external data, to ways of handling issues that are more complicated, like set algebra. Authors Ales Spetic and Jonathan...
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Sebastopol, California ; Farnham :
O'Reilly
2002.
|
| Edición: | First edition |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627029506719 |
Tabla de Contenidos:
- Transact-SQL Cookbook; Audience for This Book; Which Platform and Version?; Structure of This Book; Conventions Used in This Book; About the Code; Comments and Questions; Acknowledgments; From Jonathan; 1. Pivot Tables; 1.1.2. Solution; 1.1.3. Discussion; 2. Sets; 2.1.1.2. Elements; 2.1.1.3. Universes; 2.1.2. Set Operations; 2.1.2.2. Intersection; 2.1.2.3. Union; 2.1.2.4. Complement; 2.1.2.5. Difference; 2.2. The Students Example; 2.3. Implementing Set Difference; 2.3.2. Solution; 2.3.2.2. Subtracting one set from all others; 2.3.3. Discussion; 2.3.3.2. Subtracting one set from all others
- 2.3.3.3. Subtracting other sets from one2.4. Comparing Two Sets for Equality; 2.4.2. Solution; 2.4.3. Discussion; 2.5. Implementing Partial Intersection; 2.5.2. Solution; 2.5.3. Discussion; 2.6. Implementing Full Intersection; 2.6.2. Solution; 2.6.3. Discussion; 2.7. Classifying Subsets; 2.7.2. Solution; 2.7.3. Discussion; 2.8. Summarizing Classes of Sets; 2.8.2. Solution; 2.8.3. Discussion; 2.9. Aggregating Aggregates; 2.9.2. Solution; 2.9.3. Discussion; 2.10. Summarizing Aggregated Classes; 2.10.2. Solution; 2.10.3. Discussion; 2.11. Including Nonaggregated Columns; 2.11.2. Solution
- 2.11.3. Discussion2.12. Finding the Top N Values in a Set; 2.12.2. Solution; 2.12.3. Discussion; 2.12.3.2. Using a self-join; 2.13. Reporting the Size of a Set&s Complement; 2.13.2. Solution; 2.13.3. Discussion; 2.14. Finding the Complement of a Set; 2.14.2. Solution; 2.14.2.2. Step 2: Run the query; 2.14.3. Discussion; 2.15. Finding the Complement of a Missing Set; 2.15.2. Solution; 2.15.2.2. Solution 2: Create a student master table; 2.15.3. Discussion; 2.16. Finding Complements of Sets with Different Universes; 2.16.2. Solution; 2.16.3. Discussion; 2.17. Comparing a Set with Its Universe
- 2.17.2. Solution2.17.3. Discussion; 2.18. Dynamic Classification System; 2.18.2. Solution; 2.18.2.2. Step 2: Running the query; 2.18.3. Discussion; 3. Data Structures; 3.1.1.2. Regions; 3.1.1.3. Runs; 3.1.1.4. Sequences; 3.1.2. Stacks and Queues; 3.1.2.2. Queues; 3.1.2.3. Priority queues; 3.1.3. Arrays and Matrices; 3.1.3.2. Matrices; 3.2. Working Example; 3.2.2. Arrays; 3.2.3. Matrices; 3.3. Finding Regions; 3.3.2. Solution; 3.3.3. Discussion; 3.4. Reporting Region Boundaries; 3.4.2. Solution; 3.4.3. Discussion; 3.5. Limiting Region Size; 3.5.2. Solution; 3.5.3. Discussion
- 3.6. Ranking Regions by Size3.6.2. Solution; 3.6.3. Discussion; 3.7. Working with Sequences; 3.7.2. Solution; 3.7.3. Discussion; 3.8. Working with Runs; 3.8.2. Solutions; 3.8.3. Discussion; 3.9. Cumulative Aggregates in Lists; 3.9.2. Solution; 3.9.3. Discussion; 3.10. Implementing a Stack; 3.10.2. Solution; 3.10.2.2. POP function in SQL; 3.10.2.3. PUSH function in SQL; 3.10.3. Discussion; 3.11. Implementing Queues; 3.11.2. Solution; 3.11.2.2. DEQUEUE function in SQL; 3.11.2.3. ENQUEUE function in SQL; 3.11.3. Discussion; 3.12. Implementing Priority Queues; 3.12.2. Solution
- 3.12.2.2. DEQUEUE function in SQL
