Skip to main content

Logical database model and Relational database management system-computer world

 Logical Database model

The logical database models are used in describing data at the conceptual and view level.However in contrast to conceptual database models, these model are to specify the overall logical structure of the database .These model are also known as record based logical database models. In the record based logical database models, the database is structured in fixed format re-cred of different types.Each record type define a fixed numbers of fields, or attributes an each field is of a fixed length.

Relational database management system

Relational database management system(RDBMS) is a software package used to store and retrieve data that is organised in the form of tables. Relational database management system, where all data are kept in tables or relations. Relational database management system are much more flexible and easy to use, in the comparison to other models.


A Relational database management system(RDBMS) has following properties : 

  1. It store data in the form of table.
  2. It support the concepts of null value. 
  3. It does not require the user to understand it's physical implementation. 

A table should contain the following properties : 

  1. All rows in a table should be distinct, duplicate row are not allowed. 
  2. Each column should be assigned with a distinct heading. 
  3. The rows and the column of a table can be viewed in any sequence at any time without affecting the information. 



Comments

Post a Comment

Popular posts from this blog

Deadlock in operating system-computer world

  Deadlock in operating system-computer world Deadlock :  In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs.   so we can say that in this situation none of the process gets executed  since the resource it needs, is held by some other process which is also waits for some other resource to be released.  Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3.   After sometime P1 demands for R1 which is being used by  P2.
9 comments
Read more

CPU scheduling in operating system-computer world

  CPU scheduling in operating system CPU scheduling :  Whenever the CPU becomes idle, the operating system must select one of the processes. The selection process is carried by the short-term scheduler. The scheduler selects a process from the processes in memory that that are ready to execute and allocate the CPU to that process. The objective of time sharing is to skip the CPU among processes that user interact with each program while the program is in running position. As we discuss above the process scheduler selects an process for execution on the CPU. There will never more then one running process for a single processor system. If there are many processes, the process will have to wait until the CPU is free CPU Scheduling is basis of multi-programming operating system. In CPU scheduling many processes are kept in memory at a time. The CPU scheduler select a process from the many processes. The process scheduler scheduled different processes to be assigned to the CPU based on part
3 comments
Read more

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit into a partition use overlay te
Post a Comment
Read more