Solution is Ctrl+B.

I was just wondering how to write paging functionality embedded in T-SQL.  Immediate google search resulted ROW_NUMBER() function, of which simple use is

SELECT  Description, Date
FROM     (SELECT  ROW_NUMBER() OVER (ORDER BY Date DESC)
             AS Row, Description, Date FROM LOG)
            AS LogWithRowNumbers
WHERE  Row >= 1 AND Row <= 10

As shown below, Json is a bit cumbersome to work with and specially when user query it, they have to go through a sort of DFS. Look at http://goessner.net/articles/JsonPath/, where Stephen Goessner developed JSONPath which is analogy of XPath for JSON. Remembering, JSON is a native for javascript and more compact, JSONPath is a good idea.

{ “book”: [
      { "category": "reference",
        "author": "Nigel Rees",
        "title": "Sayings of the Century",
        "price": 8.95
      },
      { "category": "fiction",
        "author": "Evelyn Waugh",
        "title": "Sword of Honour",
        "price": 12.99 }, { "category": "fiction",
        "author": "Herman Melville",
        "title": "Moby Dick",
        "isbn": "0-553-21311-3",
        "price": 8.99
      },
      { "category": "fiction",
        "author": "J. R. R. Tolkien",
        "title": "The Lord of the Rings",
        "isbn": "0-395-19395-8",
        "price": 22.99
      }
    ],
    “bicycle”: {
      “color”: “red”,
      “price”: 19.95
    }
  }

JSONPath expression

{
"1 1 1",
"1 1 1"
}

Returns: 6

{
"1 -1",
"1 -1"
}

Returns: 2

{
"1 -1 -1 1",
"-1 -1 -1 -1",
"-1 -1 -1 -1",
"1 -1 -1 1"
}

Returns: 4

{
"20 13 -2 100",
"-12 0 4 -3",
"4 1 -36 21"
}

Returns: 131

{
"0"
}

Returns: 0

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

Problem Statement

There is nothing more beautiful than just an integer number.
You are given an integer n. Write down n in decimal notation with no leading zeroes, and let M be the number of written digits. Perform the following operation exactly k times:
Choose two different 1-based positions, i and j, such that 1 <= i < j <= M. Swap the digits at positions i and j. This swap must not cause the resulting number to have a leading zero, i.e., if the digit at position j is zero, then i must be strictly greater than 1.
Return the maximal possible number you can get at the end of this procedure. If it’s not possible to perform k operations, return -1 instead.
Definition

Class:
TheSwap
Method:
findMax
Parameters:
int, int
Returns:
int
Method signature:
int findMax(int n, int k)
(be sure your method is public)

Constraints
-
n will be between 1 and 1,000,000, inclusive.
-
k will be between 1 and 10, inclusive.
Examples
0)

16375
1
Returns: 76315
The optimal way is to swap 1 and 7.
1)

432
1
Returns: 423
In this case the result is less than the given number.
2)

90
4
Returns: -1
We can’t make even a single operation because it would cause the resulting number to have a leading zero.
3)

5
2
Returns: -1
Here we can’t choose two different positions for an operation.
4)

436659
2
Returns: 966354

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

Theory of financial risk and derivative pricing

 Modeling Derivatives in C++

Because of locking and serialization, plus logging inserting once is much more faster than inserting by loop. Here i have tested it using CTE

WITH 

– second CTE which returns 100 million rows by using

– a CROSS JOIN on the first CTE 

, dig AS (
SELECT
(millions.Number * 1000000)
+ (hThousands.Number * 100000)
+ (tThousands.Number * 10000)
+ (thousands.Number * 1000)
+ (hundreds.Number * 100)
+ (tens.Number * 10)
+ ones.Number AS Number
FROM digits AS ones
CROSS JOIN digits AS tens
CROSS JOIN digits AS  hundreds
CROSS JOIN digits AS  thousands
CROSS JOIN digits AS tThousands
CROSS JOIN digits AS hThousands
CROSS JOIN digits AS millions
)

 – Third CTE which generates a “number”. repeated after 50M

 , nums AS (
SELECT number
FROM dig
WHERE number <5000000
)

– the insert statement goes here

INSERT Test.dbo.PerformanceTester (col1,col2,col3)
SELECT number,number, number
FROM  nums

 and performance gain is more than 40 times. Cool.  but this query is bound to memory and if we try to increase 5M to 50M, will complain about revising long running transactions. My trick to this is

insert  

which basically doubles size of the table by 2 much faster.

into Test.dbo.PerformanceTester(col1,col2,col3)
select col1,col2,col3 from Test.dbo.PerformanceTester

– first CTE which returns 10 rows (0-9)
digits AS (
SELECT 0 as  Number
UNION SELECT 1
UNION SELECT 2
UNION SELECT 3
UNION SELECT 4
UNION SELECT 5
UNION SELECT 6
UNION SELECT 7
UNION SELECT 8
UNION SELECT 9
)

select column_name 
from information_schema.columns
where table_name = ’my_table_name’

A object holds reference to certain interface and object, therefore by setting it  is a way of injecting dependency. Really simple example at http://en.wikipedia.org/wiki/Dependency_injection.

It is somehow related with IoC, where Hollywood principle “Don’t call us, we’ll call you” works

this.bSubmit.Attributes.Add(“onclick”, ” this.disabled = true; ” + ClientScript.GetPostBackEventReference(bSubmit, null) + “;”);