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

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Accessing information permissions users, Accessing information about permis...

Accessing information about permissions to all users- Object level permissions: With the use of data dictionary you can see the permissions to user. Let us get the table name fro

In which relational modes cardinality is termed, In which relational modes,...

In which relational modes, cardinality is termed? Answer : Cardinality is termed in a number of tuples relational modes.

Note gate, i want notes on this topic

i want notes on this topic

Create a database, Project: Microsoft Access You have been asked by the ...

Project: Microsoft Access You have been asked by the ABC Tanning Salon to create a database that can be used to track the salon's customers.  You are to create a table in Access

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Benefits abd drawback of hashed file organisation, Benefits of Hashed file ...

Benefits of Hashed file Organisation 1.      Insertion or search on hash-key is quick. 2.      Best if equality search is required on hash-key. Drawbacks of Hashed file

Non-redundant cover and canonical cover, Given the following set of functio...

Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.

Explain the process-oriented decomposition, Breaking into Subsystems D...

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

Can a domain, Can a domain, assigned to a data element be changed? Yes....

Can a domain, assigned to a data element be changed? Yes.  We can do so by just overwriting the entry in the field domain.

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