|
��U S E [ G e o P l a c e s ]
G O
/ * * * * * * O b j e c t : T a b l e [ d b o ] . [ U s e r s ] S c r i p t D a t e : 0 3 / 0 8 / 2 0 0 9 1 2 : 1 2 : 4 0 * * * * * * /
S E T A N S I _ N U L L S O N
G O
S E T Q U O T E D _ I D E N T I F I E R O N
G O
C R E A T E T A B L E [ d b o ] . [ U s e r s ] (
[ I D ] [ i n t ] I D E N T I T Y ( 1 , 1 ) N O T N U L L ,
[ N a m e ] [ n v a r c h a r ] ( m a x ) N O T N U L L ,
[ P a s s w o r d ] [ n v a r c h a r ] ( m a x ) N O T N U L L ,
C O N S T R A I N T [ P K _ U s e r s ] P R I M A R Y K E Y C L U S T E R E D
(
[ I D ] A S C
) W I T H ( P A D _ I N D E X = O F F , S T A T I S T I C S _ N O R E C O M P U T E = O F F , I G N O R E _ D U P _ K E Y = O F F , A L L O W _ R O W _ L O C K S = O N , A L L O W _ P A G E _ L O C K S = O N ) O N [ P R I M A R Y ]
) O N [ P R I M A R Y ]
G O
/ * * * * * * O b j e c t : T a b l e [ d b o ] . [ P l a c e s ] S c r i p t D a t e : 0 3 / 0 8 / 2 0 0 9 1 2 : 1 2 : 4 2 * * * * * * /
S E T A N S I _ N U L L S O N
G O
S E T Q U O T E D _ I D E N T I F I E R O N
G O
C R E A T E T A B L E [ d b o ] . [ P l a c e s ] (
[ I D ] [ i n t ] I D E N T I T Y ( 1 , 1 ) N O T N U L L ,
[ U s e r I D ] [ i n t ] N O T N U L L ,
[ N a m e ] [ n v a r c h a r ] ( m a x ) N O T N U L L ,
[ D e s c r i p t i o n ] [ n v a r c h a r ] ( m a x ) N O T N U L L ,
[ L o n g i t u d e ] [ f l o a t ] N O T N U L L ,
[ L a t i t u d e ] [ f l o a t ] N O T N U L L ,
C O N S T R A I N T [ P K _ P l a c e s ] P R I M A R Y K E Y C L U S T E R E D
(
[ I D ] A S C
) W I T H ( P A D _ I N D E X = O F F , S T A T I S T I C S _ N O R E C O M P U T E = O F F , I G N O R E _ D U P _ K E Y = O F F , A L L O W _ R O W _ L O C K S = O N , A L L O W _ P A G E _ L O C K S = O N ) O N [ P R I M A R Y ]
) O N [ P R I M A R Y ]
G O
/ * * * * * * O b j e c t : F o r e i g n K e y [ F K _ P l a c e s _ U s e r s ] S c r i p t D a t e : 0 3 / 0 8 / 2 0 0 9 1 2 : 1 2 : 4 2 * * * * * * /
A L T E R T A B L E [ d b o ] . [ P l a c e s ] W I T H C H E C K A D D C O N S T R A I N T [ F K _ P l a c e s _ U s e r s ] F O R E I G N K E Y ( [ U s e r I D ] )
R E F E R E N C E S [ d b o ] . [ U s e r s ] ( [ I D ] )
O N U P D A T E C A S C A D E
O N D E L E T E C A S C A D E
G O
A L T E R T A B L E [ d b o ] . [ P l a c e s ] C H E C K C O N S T R A I N T [ F K _ P l a c e s _ U s e r s ]
G O
|
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please
let us know and we'll add colourisation support for it.
I currently hold the following qualifications (amongst others, I also studied Music Technology and Electronics, for my sins)
- MSc (Passed with distinctions), in Information Technology for E-Commerce
- BSc Hons (1st class) in Computer Science & Artificial Intelligence
Both of these at Sussex University UK.
Award(s)
I am lucky enough to have won a few awards for Zany Crazy code articles over the years
- Microsoft C# MVP 2016
- Codeproject MVP 2016
- Microsoft C# MVP 2015
- Codeproject MVP 2015
- Microsoft C# MVP 2014
- Codeproject MVP 2014
- Microsoft C# MVP 2013
- Codeproject MVP 2013
- Microsoft C# MVP 2012
- Codeproject MVP 2012
- Microsoft C# MVP 2011
- Codeproject MVP 2011
- Microsoft C# MVP 2010
- Codeproject MVP 2010
- Microsoft C# MVP 2009
- Codeproject MVP 2009
- Microsoft C# MVP 2008
- Codeproject MVP 2008
- And numerous codeproject awards which you can see over at my blog