As noted in Tuesday’s lecture, next week gives a break from all classes with the University’s Festival of Creative Learning. There’s a cascade of events at the calendar and blog; I’ve just picked out a few here that I liked.
Slides : RecordingFrom the strict rectangles of structured data to the more generous triangles of semistructured data. This morning’s lecture gave an overview of what kind of data is seen as “semistructured”; the idea of trees as a mathematical model of data; the particular form of trees in the XPath data model; and their textual representation in XML — the Extensible Markup Language.
Slides : RecordingToday was the final lecture on Structure Data and covered a range of database topics: ACID properties for transactions; the NoSQL movement; nested SQL queries, set operations, and aggregate queries; ultimate physical limits to computation; the wonders of the heavens captured in SkyServer; and the idea of doing scientific research and experiments from inside the database. Continue reading Lecture 8: SQL Queries→
Tutor notes and solutions for Tutorial 2 are now on the tutorial page, together with next week’s exercises. Tutorial 3 is about formulating queries in tuple relational calculus and finding ways to compute them in relational algebra.
Have a look at the exercises now, and if you have questions about anything then ask on Piazza or after lectures.
Today’s lecture introduced the basic structure and format of SQL queries: SELECT … FROM … WHERE …. That’s enough to write a huge range of queries, from single summary statistics to large integrated views that bring together multiple tables. Continue reading Lecture 7: SQL→
Today, another language for talking about databases. This one is the Tuple Relational Calculus for writing queries that describe information to be extracted from the linked tables of a relational database. There’s a separation of roles here: the tuple relational calculus is good for succinctly stating what we want to find out; while relational algebra from the last lecture describes how to combine and sift tables to extract that information from the data. We distinguish what information we want from how to compute it. Continue reading Lecture 6: Tuple Relational Calculus→
This morning’s lecture presented a mathematical language for slicing and dicing the structured tables of the relational model: selection, projection, renaming; union, intersection, difference; cross product, join, equijoin and natural join. A key feature of this relational algebra is that just six of these operations are enough to capture an extremely wide range of queries and transformations of data. Database implementors work hard to build highly efficient engines to carry out these operations, which can then support many different kinds of user application. Continue reading Lecture 5: Relational Algebra→
Today’s lecture reviewed the high-level conceptual language of ER diagrams and the more concrete structures of the relational model; followed by some recipes for translating from the first into the second. This isn’t always an exact match, and for any particular ER diagram we might go back to its original scenario description to decide how to best represent it as a relational model. Even so, this kind of step-by-step staging towards a fully formal representation is an effective route to capturing the subtleties of real-world systems. Continue reading Lecture 4: From ER Diagrams to Relational Models→