zoukankan      html  css  js  c++  java
  • 有效的分页存储过程

    CREATE

    PROCEDURE [dbo].[Profile_GET]

    @PageSize

    int=null,

        @CurrentPage

    int=null,

        @SortExpression   

    nvarchar(max)=null

    AS

    BEGIN

       

    SETNOCOUNTON

       

    DECLARE @SqlString nvarchar(max)

       

    Declare @UpperBand int

       

    Declare @LowerBand int       

       

       

    SET @LowerBand  =(@CurrentPage - 1)* @PageSize

       

    SET @UpperBand  =(@CurrentPage * @PageSize)+ 1   

       

    BEGIN

           

    SET @SqlString='WITH tempProfile AS

            (                   

                SELECT

                    [ProfileId],

                    [Name],

                    [Address],

                    [Email],

                    [Mobile],

                    [Active] = CASE [IsActive] WHEN 1

                    THEN ''Active'' WHEN 0 THEN ''DeActive'' END,                           

                    ROW_NUMBER() OVER (ORDER BY '

    + @SortExpression +' ) AS RowNumber                

                    FROM [dbo].[Profile]

            )    

            SELECT

                [ProfileId],

                [Name],

                [Address],

                [Email],

                [Mobile],

                [Active]                                       

            FROM

                tempProfile

            WHERE

                RowNumber > '

    +CONVERT(VARCHAR,@LowerBand)+' AND RowNumber < '+CONVERT(VARCHAR, @UpperBand)

               

    +' ORDER BY '+ @SortExpression  ;         

       

       

    EXECsp_executesql@SqlString

       

    END

    END

    ;

    CREATE

    PROCEDURE [dbo].[Profile_Total]

    AS

    BEGIN

       

    SETNOCOUNTON

       

    SELECTCOUNT(*)FROMProfile

    END

  • 相关阅读:
    POJ 2653 Pick-up sticks [线段相交 迷之暴力]
    POJ1556 The Doors [线段相交 DP]
    POJ 3304 Segments[直线与线段相交]
    POJ2318 TOYS[叉积 二分]
    挖坑
    HDU3488 Tour [有向环覆盖 费用流]
    BZOJ 3438: 小M的作物 [最小割]
    POJ 2125 Destroying The Graph [最小割 打印方案]
    网络流算法与建模总结
    CF266D. BerDonalds [图的绝对中心]
  • 原文地址:https://www.cnblogs.com/happy-Chen/p/3610926.html
Copyright © 2011-2022 走看看