COMPUTER APPLICATIONS
DATABASE MANAGEMENT SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Stored in the form of objects
|
|
|
Stored hierarchically
|
|
|
Stored in fixed structures
|
|
|
None of the above
|
Detailed explanation-1: -A relational database organizes data into rows and columns, which collectively form a table. Data is typically structured across multiple tables, which can be joined together via a primary key or a foreign key.
Detailed explanation-2: -The relational model means that the logical data structures-the data tables, views, and indexes-are separate from the physical storage structures. This separation means that database administrators can manage physical data storage without affecting access to that data as a logical structure.
Detailed explanation-3: -Database tables and indexes may be stored on disk in one of a number of forms, including ordered/unordered flat files, ISAM, heap files, hash buckets, or B+ trees. Each form has its own particular advantages and disadvantages. The most commonly used forms are B-trees and ISAM.