Ba

ze

de

da

teC

TI

Se

m. 3

Curs 0: ORGANIZARE

Conf. dr. Sanda Monica TĂTĂRÂM

tataram@fmi.unibuc.ro

smtataram@yahoo.com

Cam. 326

1. Structura

2. Programa

3. Evaluare

4. Bibliografie

1/9

Cu

rs 0

: O

RG

AN

IZA

RE

• Saptamanal:

3 ore curs + 2 ore seminar + 2 ore laborator;

• Forma de examinare: examen;

• Credite : 5.

2/9

Structura Evaluare

Programa Bibliografie

Cu

rs 0

: O

RG

AN

IZA

RE 1. Obiectivele, arhitectura, caracteristicile si evoluţia

sistemelor de gestiune a bazelor de date2. Clasificarea modelelor de date3. Modelarea semantică a informaţiei (diagrama E/R şi E/R

extinsa)4. Analiza si proiectarea modelului relational5. Construirea diagramei conceptuale6. Executarea şi optimizarea interogărilor. Eliminarea

dependenţelor7. Anomalii în proiectarea modelelor relaţionale8. Normalizarea şi denormalizarea relaţiilor9. Limbaje pentru prelucrarea datelor relaţionale10. Limbajul pentru definirea datelor (crearea, modificarea şi

distrugerea structurii obiectelor)11. Limbajul pentru prelucrarea datelor (inserarea, ştergerea,

reactualizarea şi interogarea)12. Limbajul pentru controlul datelor (toate conceptele vor fi

definite şi exemplificate relativ la Oracle SQL.

3/9

Structura Evaluare

Programa Bibliografie

Cu

rs 0

: O

RG

AN

IZA

RE

4/9

Structura Evaluare

Programa Bibliografie

4

4321 NNNNfinalaNota

unde:

• N1 = examen (nota la subiectul teoretic)

• N2 = examen (nota la problema)

• N3 = nota la seminar

• N4 = nota la laborator

Pentru promovare: i{1, …, 4} : Ni 5;

Studentii care au fost absenti la seminar şi/sau laborator:

rezolvarea unei probleme suplimentare la examen, FARA

extinderea timpului alocat;

Bonificatie la nota finala:

raspunsuri la intrebarile din timpul cursului;

teme de casa.

Cu

rs 0

: O

RG

AN

IZA

RE

1. BONTEMPO, Charles J., MARO SARACCO, Cynthia: Database

Management Principles and Products, Prentice Hall, Upper Saddle

River, NJ, 1995

2. BOWERS, David S.: From Data To Database, Chapman & Hall,

London, UK, ediţia a 2a, 1993

3. CHILDS, D.L.: "Feasability of a Set-Theoretical Data Structure", în

Proc Fall Joint Computer Conference, 1968, p. 557-564

4. CHEN, P.P.: "The Entity-Relationship Model – Toward a Unified View of

Data", ACM Trans. Database Systems, vol. 1, no. 1, (1976), p. 9-36.

5. CODD, Edgar, F.: "A Relational Model of Data for Large Shared

Databanks", Comm. ACM, vol. 13 (1970), no. 6, p. 377-387

6. CODD, Edgar, F.: "Further Normalization of the Data Base Relational

Model", în R. RUSTIN (editor): Data Base Systems, Prentice Hall

Inc. Englewood Cliffs, NJ, 1972

7. CONNOLLY,Thomas, BEGG,Carolyn, STRACHAN, Anne: Database

Systems, A Practical Approach to Design, Implementation, and

Management, 2nd ed., Addison-Wesley, Harlow, 1999. sau

CONNOLLY T., BEGG C., STRACHAN A., Baze de date, Editura

Teora, Bucureşti, 2001. 5/9

Structura Evaluare

Programa Bibliografie

Cu

rs 0

: O

RG

AN

IZA

RE

8. DATE, C. J.: An Introduction to Database Systems, Pearson Education,

Addison Wesley Higher Education, 2004

9. ELMASRI, Ramez, NAVATHE, Shamkant B.: Fundamentals of Database

Systems, 3RD ed., Addison Wesley, Reading, Mass., 2000

10. FAGIN, R.: "A Normal Form for Relational Databases That is Based on

Domains and Keys", în Transactions on Database Systems 6

(Sept.1981)

11. FLEMING, C, von HALLE, B.: Handbook of Relational Database

Design, Addison-Wesley, Reading MA., 1989

12. FOTACHE, Marin: Proiectarea BD: Normalizare şi post-normalizare;

implementări SQL şi Oracle, Ed Polirom, Iaşi, 2005

13. FLORESCU Vasile (coord. grup. BDASEIG): Baze de date;

Fundamente teoretice si practice, Editura Infomega, Bucuresti, 2002

14. GARCIA-MOLINA, Hector, ULLMAN, Jeffrey D., WIDOM, Jennifer: A

First Course in Database Systems, Prentice Hall, Upper Saddle River,

NJ, 2000

6/9

Structura Evaluare

Programa Bibliografie

Cu

rs 0

: O

RG

AN

IZA

RE 15. KROENKE, David M.: Database Processing: Fundamentals, Design &

Impelmentation, Ediţia a 7a, Prentice-Hall Inc., Upper Saddle River, NJ,

2000.

16. O'NEIL, Patrick: Database - principles, programming, performance,

Morgan Kaufmann Publ.Inc., San Fransisco, 1994

17. POPESCU I., Modelarea bazelor de date, Editura Tehnică, Bucureşti,

2001

18. POPESCU I., ALECU A., VELCESCU L., FLOREA G., Programare

avansată în Oracle, Editura Tehnică, Bucureşti, 2004

19. ROB, Peter, CORONEL, Carlos: Database Systems: Design,

Implementation, and Management, International Thomson Publ.,

Cambridge MA., 1997

20. SILBERSCHATZ, Abraham, KORTH, Henry F., SUDARSHAN, S.:

Database System Concepts, McGraw-Hill Co.Inc., New York, 1997

21. STONEBRAKER, M.: Object-Relational DBMSs: The Next Great Wave,

Morgan Kaufmann Publ. Inc., San Francisco Ca., 1996.7/9

Structura Evaluare

Programa Bibliografie

Cu

rs 0

: O

RG

AN

IZA

RE

8/9

The Deluge of Spurious Correlations in Big DataCristian S. Calude and Giuseppe Longo

. . . fatti non foste a viver come bruti, ma per seguir virtute e canoscenza.

Dante Alighieri, Inferno, Canto XXVI.. …you were not born to live like brutes, but to pursue virtue and knowledge

Very large databases are a major opportunity for science and data analytics is a re-markable new fi of investigation in computer science.

However, the effectiveness of these tools seems to encourage an aggressive “philosophy” against the scientific method as developed throughout history. According to this view, computer discovered correlations should replace understanding and guide prediction and action.

The “End of Science” is proudly proclaimed. There is no need to give scientific meaning to phenomena, by proposing, say, causal relations, since regularities in very large databases are enough: “with enough data, the numbers speak for themselves”.

Tema de cercetare?

Cu

rs 0

: O

RG

AN

IZA

RE

9/9

We show, using classical results from finite combinatorics known

as Ramsey Theory, that this “philosophy” is radically wrong.

Specifically , we prove that, exactly because of their very large

size, databases have to contain arbitrary correlations, most of

them spurious.

These correlations appear only due to the size not to the nature of

the data.

In particular, they appear in randomly generated large enough

databases.

Too much information tends to behave like very little

information.

The scientific method can be enriched by computer mining in

immense databases, but surely not replaced by it.

Tema de cercetare?