Question: database Problem 1 (I point coch, totol 14 points) for each concept in the left column below, selert the dosest matching item from the nethe
Problem 1 (I point coch, totol 14 points) for each concept in the left column below, selert the dosest matching item from the nethe column. Note that items in the right colvisn are to be used at most once. Place the number of the right columa item next to the corresponding keft column item. 11. entityintegrity 1. index. transartion 2. Microsoft- horizontal decompasition 3. P. Chen- snapshot 4. virtual memory. 0.5 before, after, instead of 5. Sequential Query Language. SEQUEL 6. E.F. Codd. vertical composition 7. DML- 99. virtual relations 8. Oracle. scanning a relation tuple by tuple 9. JolN where duplicate attributes are eliminated. equi.JON 10. e.g. 'Age can not be negative'. referential integrity 11. derived attributes. 1 fast query execution 12. ATM. . PL/SOL 13. prior to, just after, rather than a transaction. to. relational data model 14. inter-relation constraint. 15. restrict. 16. integrity of entity types in the E-R. 17. division. 18. trieger. 19. more general than Natural-JOIN 20. QBE. 21. all or nothing. 22. view. 23. union. 24. horizontal composition of relations. 25. CURSOR. 26. SQL 27. T-SQL 28. refresh
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
