Differences between revisions 18 and 32 (spanning 14 versions)
Revision 18 as of 2010-04-01 23:45:08
Size: 2542
Editor: 24-183-238-75
Comment:
Revision 32 as of 2011-01-30 17:11:41
Size: 3761
Editor: 71-88-174-166
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:
<<TableOfContents>>
Line 3: Line 5:

== 2011 Winter Class ==

 * [[DatabaseManagementSystems/Cptr319Schedule2011|Course Schedule 2011]]
Line 20: Line 26:
== Programming Resources == == Programming & Design Resources ==
Line 23: Line 29:
 * Domain Driven Design has an entire website to look at: http://domaindrivendesign.org/  * [[http://www.fabforce.net/dbdesigner4/|DBDesigner]] is an awesome tool that went for pay by oracle now. Get the old one and don't pay for the ability to reverse engineer a diagram from a database. Works with Oracle, MSSQL and MySQL.
 * [[http://domaindrivendesign.org/|Domain Driven Design website]]
Line 31: Line 38:
 * [[http://www.linqpad.net/|Link Pad]] allows you to write scratch c# LINQ code and claims it can be used as a drop in replacement for SQL Server Management Studio
Line 33: Line 41:

== Chapter Hints ==

=== Chapter 6.1: Relational Algebra ===

READ THIS BEFORE YOU DO YOUR HOMEWORK!

'''Rule 1:''' You don't need to qualify the results of a natural join. The results of a natural join ALWAYS only have one copy of overlapping attributes.

'''Rule 2:''' Predicates, attribute lists and functions in <<latex($\sigma, \Pi, \mathcal{G}$)>> are always subscript.

'''Rule 3:''' Relations, whether expressions or names, NEVER appear as a superscript or subscript.

'''Rule 4:''' Input relations, whether expressions or name, always have parenthesis around them. E.g.

<<latex(\Large$_{sect\_id,course\_id,year,semester}\mathcal{G}_{count(ID)}(student \bowtie takes)$)>>

Database Management Systems

This class is about Database Management Systems. As such we talk about creating, managing and programming SQL databases. When time permits, we also cover spatial/spatial temporal data and database systems. This site contains content developed by Dr. Anderson for his classes.

2011 Winter Class

Programming Examples

Programming & Design Resources

Learning to program something more complex than a one off programming assignments for students can be difficult. Where do the experts learn to program large database applications and what tools and methods do they use? This section is not an answer, but a suggestion on where to look for those answers. Someday, I hope to have a class that explores this in depth.

And many more to follow I'm sure.

Chapter Hints

Chapter 6.1: Relational Algebra

READ THIS BEFORE YOU DO YOUR HOMEWORK!

Rule 1: You don't need to qualify the results of a natural join. The results of a natural join ALWAYS only have one copy of overlapping attributes.

Rule 2: Predicates, attribute lists and functions in <<latex($\sigma, \Pi, \mathcal{G}$)>> are always subscript.

Rule 3: Relations, whether expressions or names, NEVER appear as a superscript or subscript.

Rule 4: Input relations, whether expressions or name, always have parenthesis around them. E.g.

<<latex(\Large$_{sect\_id,course\_id,year,semester}\mathcal{G}_{count(ID)}(student \bowtie takes)$)>>

DatabaseManagementSystems (last edited 2024-02-25 16:33:21 by scot)