-
Recent Posts
- T-SQL Cryptographic Patterns – part 6: a hole in the bucket
- T-SQL Cryptographic Patterns – part 5: running the gauntlet
- T-SQL Cryptographic Patterns – part 4: parts is parts
- T-SQL Cryptographic Patterns – part 3: Dog Food
- T-SQL Cryptographic Patterns – part 2: Hotel Juliet
- T-SQL Cryptographic Patterns – Part 1: hashed, scrambled or over easy?
- Throw FORMATMESSAGE() in the SQL Server 2012 Tool Bag
- Encrypting XML Typed Data in SQL Server
- Considering Cryptography in SQL Server Database Architectures
- Repel Dictionary Attacks With Checksum Truncation of The Random lambda
- Using Authenticity, Signing, Nesting in T-SQL to Protect Sensitive Data from (even) Highly Privileged Users
- Encryption Hierarchy Administration – a T-SQL Template
- The Emperor’s New Transparent Data Encryption
- Protecting Sensitive Data at Rest in SQL Azure
- Persisting Data: part 9 – A Modest Data Collection Proposal
- Implicit conversions will find you
- Persisting Data – part 8: Concurrent Persistence Processing
- Persisting Data – part 7: Concurrency and Deadlocking
- Persisting Data – part 6: TVPs are for SSISies
- Persisting Data – part 5: Concurrency and Locking
- Persisting Data – part 4: Upsert and MERGE
- Persisting Data – part 3: Rows, Sets and Files
- Persisting Data – part 2: The Un-Indexed Heap
- Persisting Data – part 1: The “impedance mismatch”
- Monitoring the Default Trace
Tag Archives: HEAP
Persisting Data – part 2: The Un-Indexed Heap
A heap is a table with no clustered index. The performance and throughput advantages of targeting an un-indexed heap structure when loading multiple rows of data into SQL Server can be fantastic. That does not shed much light on how … Continue reading
