• SQLRNNR (2/5/2014)


    Nice solution.

    Actually, I am not too proud to admit that solution stunk up the house! Not sure what I was thinking there.

    This will be much faster, assuming a PRIMARY KEY consisting of id, cid and startdate of course.

    SELECT id, cid, StartDate

    ,EndDate=CASE

    WHEN DATEPART(year, StartDate) = DATEPART(year, GETDATE()) THEN NULL

    WHEN DATEPART(year, EndDate) = DATEPART(year, StartDate) AND EndDate <> StartDate THEN EndDate

    ELSE DATEADD(year, 1, DATEADD(year, DATEDIFF(year, 0, StartDate), 0))-1

    END

    FROM #table a

    OUTER APPLY

    (

    SELECT TOP 1 StartDate-1

    FROM #table b

    WHERE a.id = b.id AND a.cid = b.cid AND a.startdate < b.startdate

    ORDER BY b.startdate

    ) b(EndDate)

    ORDER BY id, cid, StartDate;


    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