Differences between revisions 23 and 31 (spanning 8 versions)
Revision 23 as of 2010-12-31 20:15:44
Size: 2790
Editor: 71-88-174-166
Comment:
Revision 31 as of 2011-01-30 17:11:30
Size: 3761
Editor: 71-88-174-166
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:
<<tableofcontents>>
Line 24: Line 26:
== Programming Resources == == Programming & Design Resources ==
Line 27: Line 29:
 * [[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.
Line 38: 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

<<tableofcontents>>

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)