1 / 13

Alberto Mendelzon at Princeton: The Blossoming of Relational Database Theory

Alberto Mendelzon at Princeton: The Blossoming of Relational Database Theory. David Maier Dept. of Computer Science Portland State University. DB Theory: Toronto to Princeton.

blake-walls
Download Presentation

Alberto Mendelzon at Princeton: The Blossoming of Relational Database Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Alberto Mendelzon at Princeton:The Blossoming of Relational Database Theory David Maier Dept. of Computer Science Portland State University

  2. DB Theory: Toronto to Princeton • Dennis Tsichritzis (Toronto) goes to IBM Yorktown Heights for the summer to work on OS. Finds database work with Frank King, Don Chamberlin and Ray Boyce more interesting (1973). • Returns to Toronto, announces to OS group (including Phil Bernstein) that they are now the DB group. • Phil does PhD on 3NF synthesis (1975), remains at UT as a postdoc. • Catriel Beeri arrives at Toronto for a postdoc (75-76), shares an office with Phil. Switches from automata to database theory.

  3. The Word Spreads • Phil goes to Harvard (1976) • Catriel goes to Princeton (1976), teaches DB class, gets Ullman and Aho interested in relational databases • Most of Ullman’s PhD students start working on relational database theory Alberto arrives in Fall 1975, becomes one of the first of Ullman’s students working on database theory

  4. Main Questions • Dependency implication + What kind of dependencies are there? • What’s a good DB scheme? + What’s a good a good class of DB schemes? • When are two DB schemes equivalent? + What does “equivalent” mean? • When are two queries equivalent?

  5. Realizations • 2  3 • Not every dependency is an FD • Real DBs aren’t always the projection of a single instance

  6. First Papers J. Howard MY AVA YS RF CB JDU PAB N. Goodman 19771978

  7. We Get Hyper R.E.Ladner ES PH CHP MY AVA YS RF DM CB JDU MYV AOM PAB FS HFK 19771978 1979 1980

  8. 1979-80 Work • MVDS: Independence of inference axioms • Chase: Tableaux as mappings, tableaux as templates [MMS] • Equivalence: Same set of fixpoint instances (vs. embedding equivalent FDs) [BMSU] • Adequacy of decompositions: Distinguishing Rissanen’s, Arora & Carlson’s notions [MMSU] • Generalized mutual dependencies [MM]

  9. Are We Cyclic Yet? C.Delobel ES PH CHP D.S.Parker MY AVA YS RF DM CB JDU MYV AOM DSW PAB FS HFK 19771978 1979 1980 1981

  10. 1981-2 Topics • Acyclic database schemes: 9 characterizations end up being equivalent; JD = MVDs [BFMMUY] • Weak instance model, testing equivalence w/ tableaux • Equivalence of queries with dependencies [GM]

  11. Need to Stop Somewhere ES PH CHP M.Casanova MY S.Walecka S.Kuck AVA YS RF DM CB JDU MYV AOM DSW PAB M.Graham M.Graham FS J.Stein D.Rozenshtein S.Salveter HFK 19771978 1979 1980 1981 1982

  12. 1983 & Beyond Publishing with students at Toronto Graphical query languages Deductive databases

More Related