Build SQL Server graph tables for follows, mutual connections and friends of friends, then use shortest paths and compare a junction table.
Storing Emoji and Short Messages: nvarchar, UTF-8 and Length
Store emoji safely with nvarchar or UTF-8 varchar, compare LEN and DATALENGTH, and choose message limits that fit full Unicode.
Cleaning Messy Data With T-SQL
Cleaning messy data With T-SQL means trimming text, parsing dates safely, and preserving rejected source rows for correction and replay.
Loading Partitions in Parallel
Loading partitions in parallel uses separate staging tables, controlled workers, and partition switching to publish data without chaotic locks.
Getting Through a Technical Book You Actually Finish
Read a technical book with a practical question, small SQL experiments, and reusable notes that turn each useful chapter into working knowledge.
Why a Clustered Index Does Not Guarantee Order Without ORDER BY
Explain order without ORDER BY through parallel scans, NOLOCK allocation scans, alternate indexes, shared scans, and the explicit sort fix.
Shortest Distance Between Two Shapes in SQL Server: Ramsetu or Adam’s Bridge
The shortest distance between two shapes in SQL Server comes from ShortestLineTo and STDistance. The tests here show the numbers behind the three original pictures, what happens when shapes overlap or use different SRIDs, and the same method on the globe near Ramsetu.