Joe Celko
Joe Celko is an American relational database expert from Austin, Texas. He has participated on the ANSI X3H2 Database Standards Committee, and helped write the SQL-89 and SQL-92 standards. He is the author of a Morgan-Kaufmann series of books on SQL, and over 1000 published articles on SQL and other database topics. He had been a full-time statistician for several years.[1]
He is credited with coining the term lasagna code and popularizing Michael J. Kamfonas' nested set model for trees in SQL, state transition constraints in SQL, a taxonomy of data encoding schemes, and several other design patterns in SQL DDL and DML.[2]
Contents |
[edit] Early life and education
Celko achieved his undergraduate and first Masters degrees in math at Georgia State University. He also has a second Masters degree in computer science from Georgia Tech.[3]
[edit] Career
 |
This section is empty. You can help by adding to it. |
[edit] Bibliography
- Joe Celko's Analytics and OLAP in SQL (Morgan-Kaufmann, 2006) ISBN 978-0-12-369512-3
- Joe Celko's Data and Databases (Morgan Kaufmann, 1999) ISBN 978-1-55860-432-2
- Joe Celko's SQL for Smarties (4-th Edition, Morgan-Kaufmann, 2010) ISBN 978-0-12-369379-2
- Joe Celko's SQL Programming Style ISBN 978-0-12-088797-2
- Joe Celko's SQL Puzzles and Answers (2nd edition, Morgan-Kaufmann 2006) ISBN 978-0-12-373596-6
- Joe Celko's Trees and Hierarchies (Morgan-Kaufmann, 2004) ISBN 978-1-55860-920-4
- Joe Celko’s Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL. (Morgan-Kaufmann, 2008) ISBN 978-0123741370
- Joe Celko’s Data, Measurements and Standards in SQL ISBN 978-0-12-374722-8
[edit] References
- ^ Morris, Richard (2009-10-16). "Geek of the Week: Joe Celko". simple-talk. http://www.simple-talk.com/content/print.aspx?article=842. Retrieved 2011-07-13.
- ^ [1]
- ^ "Joe Celko, Class of '65". Baker High School. June 2006. http://www.hs.org/65/celko-joe.html. Retrieved 2011-07-13.
[edit] External links
 |
This article about a United States writer of non-fiction is a stub. You can help Wikipedia by expanding it. |
