Scribd Logo
Upload

Welcome to Scribd!

  • 43 views

    Dbms Intro

    Uploaded by

    Karthikeyan Ramajayam
    The document discusses five fundamental database structures: hierarchical, network, and relational. [1] Hierarchical structures organize records in a tree-like structure but searching from the bottom or middle is difficult. [2] Network structures allow many-to-many relationships but are costly to develop and maintain. [3] Relational structures store data in simple tables that are logically but not physically connected, allowing any question to be answered if the data is well-defined.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Dbms Intro

    Uploaded by

    Karthikeyan Ramajayam
    43 views2 pages
    The document discusses five fundamental database structures: hierarchical, network, and relational. [1] Hierarchical structures organize records in a tree-like structure but searching from the bottom or middle is difficult. [2] Network structures allow many-to-many relationships but are costly to develop and maintain. [3] Relational structures store data in simple tables that are logically but not physically connected, allowing any question to be answered if the data is well-defined.

    Original Description:

    dbms

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses five fundamental database structures: hierarchical, network, and relational. [1] Hierarchical structures organize records in a tree-like structure but searching from the bottom or middle is difficult. [2] Network structures allow many-to-many relationships but are costly to develop and maintain. [3] Relational structures store data in simple tables that are logically but not physically connected, allowing any question to be answered if the data is well-defined.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    43 views2 pages

    Dbms Intro

    Uploaded by

    Karthikeyan Ramajayam
    The document discusses five fundamental database structures: hierarchical, network, and relational. [1] Hierarchical structures organize records in a tree-like structure but searching from the bottom or middle is difficult. [2] Network structures allow many-to-many relationships but are costly to develop and maintain. [3] Relational structures store data in simple tables that are logically but not physically connected, allowing any question to be answered if the data is well-defined.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    LECTURE NOTES #2

    The relationships among the many individual records in databases are based on one of several logical data
    structures or models. DBMS are designed to provide end users with quick, easy access to information
    stored in databases. Five fundamental database structures are:

    Hierarchical Structure:
    Early mainframe DBMS packages used the hierarchical structure, in which:
    - Relationships between records form a hierarchy or treelike structure.
    - Records are dependent and arranged in multilevel structures, consisting of one root record and any
    number of subordinate levels.
    - Relationships among the records are one-to-many, since each data element is related only to one
    element above it.
    - Data element or record at the highest level of the hierarchy is called the root element.

    In this case, to store or retrieve data, system must start at the top. This structure is fast when youre
    looking for the data from the top. The most serious problem starts when were looking for data from
    the bottom or middle of hierarchy.

    Network Structure:
    The network structure can represent more complex logical relationships, and is still used by many
    mainframe DBMS packages.
    - Allows many-to-many relationships among records. That is, the network model can access a
    data element by one of several paths, because any data element or record can be related to
    any number of other data elements.
    - Items in the network model are interconnected, however, physically separated.
    - There are 2/more entry points through which the pre-defined items can be searched
    - The arrows display possibility of making an efficient connection for searching for data in a
    particular module.
    - Although this structure solves the hierarchical problems, it is rather costly to develop and
    maintain (e.g. at the arrow points, there are indexes of modules requiring duplication of
    records that are grouped for search purposes what requires processing capabilities and huge
    amount of storage space. Besides the storage requirement disadvantage, the designer must
    know in advance, which questions might be asked of the data.)

    Relational Structure (originated by E. F. Codd):


    The relational structure is the most popular of the database structures.
    - Used by most microcomputer DBMS packages, as well as many minicomputer and mainframe
    systems.
    - Data elements within the database are stored in the form of simple tables, which are also referred to
    as relations. Each table stores attributes in columns that describe specific entities. These sets (tables)
    are not physically connected to each other. The connection (relationship) exists through the matching
    data in each table. (they are related if they contain common fields.)
    - DBMS packages based on the relational model can link data elements from various tables to provide
    information to users.

    The biggest advantage of this structure is that the designer doesnt have to know in advance what
    questions might be asked of the data. If the data is carefully defined, the DBMS can answer basically any
    question.

    You might also like