• Probably will run a little faster with dynamic SQL though.

    DECLARE @SQL NVARCHAR(MAX) = ''

    DECLARE @MyString VARCHAR(100) = 'aaabbcdefgh'

    ;WITH Replacements (n,a,b) AS (

    SELECT 1, 'aaa|bb|c|d|e|f|g|h','11|2|3|4444|5|6|7|8'),

    Transform (ItemNumber, a, b) AS (

    SELECT ItemNumber, MAX(a), MAX(b)

    FROM (

    SELECT n, ItemNumber, a=a.Item, b=NULL

    FROM Replacements

    CROSS APPLY DelimitedSplit8K(a, '|') a

    UNION ALL

    SELECT n, ItemNumber, NULL, Item

    FROM Replacements

    CROSS APPLY DelimitedSplit8K(b, '|')) a

    GROUP BY n, ItemNumber)

    SELECT @SQL='SELECT r=' + s + '''' + @MyString + ''',' + (

    SELECT '''' + a + ''',''' + b + '''),'

    FROM Transform

    ORDER BY ItemNumber

    FOR XML PATH('')) + 's=''' + @MyString + ''''

    FROM (

    SELECT 'REPLACE('

    FROM Transform

    FOR XML PATH('')) a(s)

    --PRINT @SQL

    EXEC (@SQL)


    My mantra: No loops! No CURSORs! No RBAR! Hoo-uh![/I]

    My thought question: Have you ever been told that your query runs too fast?

    My advice:
    INDEXing a poor-performing query is like putting sugar on cat food. Yeah, it probably tastes better but are you sure you want to eat it?
    The path of least resistance can be a slippery slope. Take care that fixing your fixes of fixes doesn't snowball and end up costing you more than fixing the root cause would have in the first place.

    Need to UNPIVOT? Why not CROSS APPLY VALUES instead?[/url]
    Since random numbers are too important to be left to chance, let's generate some![/url]
    Learn to understand recursive CTEs by example.[/url]
    [url url=http://www.sqlservercentral.com/articles/St