T-SQL Black Belt
|
156 results found for T-SQL Black Belt, displaying items 1 - 20
|
Handling Arrays as Inputs
Learn how to use a T-SQL split function to handle arrays as inputs for SQL Server stored procedures.
SQL Server Magazine
—
Itzik Ben-Gan
Handling Arrays
One way to use arrays as input for stored procedures is to employ dynamic SQL.
SQL Server Magazine
—
Itzik Ben-Gan
Query Temporal Data
Learn how to handle temporal data in SQL Server queries despite limited support.
SQL Server Magazine
—
Itzik Ben-Gan
Discover the Benefits of Filtered Indexes and Statistics
Learn how you can take advantage of SQL Server 2008’s filtered indexes and statistics feature to improve query performance and obtain detailed and accurate distribution statistics.
SQL Server Magazine
—
Itzik Ben-Gan
SQL Server 2008’s HierarchyID, Part 2
Use the new HIERARCHYID data type to move a subtree from one parent location in the hierarchy to another, and to convert a parent-child representation of the hierarchy to a representation that uses the HIERARCHYID data type.
SQL Server Magazine
—
Itzik Ben-Gan
HierarchyID
Use SQL Server 2008’s new data type to maintain and query hierarchical data.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to June’s puzzle, “Josephus Problem.”
SQL Server Magazine
—
Itzik Ben-Gan
Use T-SQL to Solve the Classic Eight Queens Puzzle
Hone both your logic and programming skills by using T-SQL to solve this logic puzzle.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to May’s puzzle “A Cat, a String, and the Earth,” and prepare your mind for June’s puzzle.
SQL Server Magazine
—
Itzik Ben-Gan
|
[May 9, 2008]
|
 |
SQL Server 2000 Code for Temporal Histograms
If you're running SQL Server 2000, use the code linked to this document in place of Listing 3 and Listing 4 in "Temporal Histograms," May 2008, InstantDoc ID 98360.
SQL Server Magazine
—
Editors
Temporal Histograms
Handling distribution of events over time is tricky. Break the problem into steps. If handling all of a task’s requirements at once is too complicated, relax some requirements, solve a simpler form of the problem, then reintroduce the complexity layers.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to April’s puzzle, “Suicidal Mosquito,” and prepare your mind for May’s puzzle, which involves distance calculation.
SQL Server Magazine
—
Itzik Ben-Gan
Set Operations
Circumvent unsupported logical phases, work around SQL Server 2005’s lack of INTERSECT ALL and EXCEPT ALL, and take advantage of the INTERSECT and EXCEPT operations’ treatment of NULLs.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to March’s puzzle “Too Clever by Half,” and prepare your mind for April’s puzzle, which involves calculating distance.
SQL Server Magazine
—
Itzik Ben-Gan
MERGE
SQL Server 2008’s MERGE statement simplifies the task of merging source data into a target table.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to February’s puzzle “Counterfeit Coins,” and prepare your mind for March’s puzzle.
SQL Server Magazine
—
Itzik Ben-Gan
Beyond MERGE’s Basics
Delve further into the MERGE statement, including its more advanced aspects and its restrictions.
SQL Server Magazine
—
Itzik Ben-Gan
The Logical Puzzle
Get the solution to January’s puzzle “Counting Triangles,” and prepare your mind for February’s puzzle, which involves determining weights.
SQL Server Magazine
—
Itzik Ben-Gan
SQL Server Read-Consistency Problems, Part 3
Under both Read Uncommitted and Read Committed isolations, updates running during an index-order scan can result in reading the same row multiple times or skipping rows.
SQL Server Magazine
—
Itzik Ben-Gan
SQL Server Read-Consistency Problems, Part 2
Now that you're familiar with the read-consistency problems that can develop under the Read Uncommitted isolation, check out these tangible examples that demonstrate those problems and begin to learn some workarounds.
SQL Server Magazine
—
Itzik Ben-Gan
|
|
Register
