Each question carries 10 marks Attempt aII question (10 X 6 = 60 marks) Describe the structure of both internal and leaf nodes of a B+Trees? Describe Projection operation, Set theoretic operation and join operation?
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online from Scribd
Each question carries 10 marks Attempt aII question (10 X 6 = 60 marks) Describe the structure of both internal and leaf nodes of a B+Trees? Describe Projection operation, Set theoretic operation and join operation?
Each question carries 10 marks Attempt aII question (10 X 6 = 60 marks) Describe the structure of both internal and leaf nodes of a B+Trees? Describe Projection operation, Set theoretic operation and join operation?
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online from Scribd
Each question carries 10 marks Attempt aII question (10 X 6 = 60 marks) Describe the structure of both internal and leaf nodes of a B+Trees? Describe Projection operation, Set theoretic operation and join operation?
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online from Scribd
MI0034 - Database Management System- 4 Credits Assignment Set- 2 (60 Marks) Each question carries 10 marks Attempt aII question (10 X 6 = 60 marks)
1. Define Data Model & discuss the categories of Data Models? What is the difference between logical data ndependence & Physical Data ndependence? 2. What is a B+Trees? Describe the structure of both internal and leaf nodes of a B+Tree? 3. Describe Projection operation, Set theoretic operation & join operation? 4. Discuss Multi Table Queries? 5. Discuss Transaction Processing Concept? 10.2 Describe properties of Transactions? 6. Describe the advantage of Distributed database? What is Client/server Model? Discuss briefly the security and nternet violation?