130-1.1Computer Science 130 -- Files and Databases (3 hours) Spring 2002General informationInstructor Stephen Weiss159 Sitterson [email protected] hours Monday and Friday 10-11 a.m. or by appointmentTAs Suzanne Vogel Richard Mukherjee040 Sitterson 040 Sitterson962-1979 [email protected] [email protected] hours Monday 3:20-5:20 p.m. Office hours Wednesday 3:15-5:15 p.m.Class Tuesdays and Thursdays 9:30-10:45 am in Sitterson 014Texts Fundamentals of Database Systems, Elmasri & Navathe, 3rd edition, Addison Wesley, © 2000Microsoft Access documentation from ATNhttp://help.unc.edu/index.xml?trail=1146,1599&id=1599&sort=score&Prerequisites • Knowing how to program in some high level language (e.g. Pascal, Turing, C, C++, JAVA).• Basic understanding of data representation inside a computer (COMP 120).• Basic data structures, algorithm analysis, and searching and sorting techniques (COMP 114 and 121).• Comfort with mathematics, especially matrix manipulation. Officially MATH 81 is listed as a prerequisite, although there’s nothing specific in that course that will be used here.• Very basic www skills. If you are in doubt about whether or not you meet the prerequisite, see the instructor immediately!Homework • Readings in the text and possibly elsewhere• Written assignments• Programs • Database project: done in small groups involving the selection of data,designing the database, implementing it on a commercial database management system (DBMS), and running some sample130-1.2operations. Each team will make a brief oral presentation of their project.Exams There will be one or two in-class exams plus a final. The final will be Saturday, May 4, 9:00 a.m.-noon. The exams will count for about 50%of your grade; the other graded work (homework, programs, and project) will count for 50%. Incompletes Incompletes will be given in special circumstances only (for example, illness or family emergency, but not for merely falling behind in your work).Honor The Honor Code applies to all graded work for this course. If in doubt, ask!Topics to be covered (tentative)History and overviewwhy do we use files?price performance characteristicsaccess characteristics of tapes and diskstraditional file processingpure sequentialpure transactionmixedLogical view of dataabstract dataentity relationship modelprimary and secondary keysmeta dataPhysical implementation of data on secondary storagesequential methodsprimary key indexingsecondary key indexingtechniques: hashing, indexes, ISAM, B-trees, B+-treesfixed and variable length recordsexternal sort/mergereorganizationDatabase modelslegacy: hierarchical and network130-1.3relationaloperations on relational databasesdatabase design principlesSQLA real DBMS system (Microsoft Access)data descriptionqueriesupdatesAdvanced topicsdistributed and multi user databasesobject oriented