Explain record based logical models, Database Management System

Assignment Help:

Explain Record Based Logical Models?

Record-Based logical Models: Also define data at the conceptual and view levels. Unlike object-oriented models, are used to state overall logical structure of the database, and gives a higher-level description of the implementation. Named so since the database is structured in fixed-format records of various types. Each record type defines a fixed number of fields, or attributes. Each field is commonly of a fixed length (this simplifies the implementation). Record-based models do not involved a mechanism for direct representation of code in the database. Separate languages related along with the model are used to express database queries and updates. The three most widely-accepted models are the relational, network, and hierarchical.


Related Discussions:- Explain record based logical models

Project on designing and creating a database , This project will involve de...

This project will involve designing and creating a database for an organization.  In the design of a database, there is no single "perfect" design.  So your database design may not

Differentiate sub-class and super-class, Differentiate sub-class and super-...

Differentiate sub-class and super-class? The specialization of a class is known as subclasses.eg: employee is a subclass of person and teller is a subclass of employee. Convers

Accounting and external reporting, List the internal controls that should b...

List the internal controls that should be in effect solely because a EDP system is employed, classifing them as (1) Those controls pertaining to input of information and (2) All ot

Should i select imaging software that allows changes, Should I select imagi...

Should I select imaging software that allows changes? An imaging system should not give features to edit or alter images. Images generally are formed as safe and secure records

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Develop a team database, I need a professional to prepare a database to co...

I need a professional to prepare a database to collect and store basic information. The information can be basic info such as contact details etc. One requirement i have is f

How to create values of structured type, How to create values of structured...

How to create values of structured type? Constructor functions are used to make values of structured types. A function with the similar name as a structured type is a construct

Assign, #quesDefine a job scheduling strategy that will meet business requi...

#quesDefine a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pi

Deadlock and its prevention, Deadlock And Its Prevention: As seen earlier,...

Deadlock And Its Prevention: As seen earlier, though two phase locking protocol handles the trouble of serialisability, but it causes some troubles also. For instance, consider th

Apriori algorithm-find all frequent large itemsets, Your friend owns a comp...

Your friend owns a computer store in Yuen Long, selling Desktop and Notebook PCs and other computer peripherals. Having been rather successful with his business there, he decided t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd