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

Data models, why older data models are being replaced by new data models....

why older data models are being replaced by new data models.

Explain briefly concurrent task by taking an example, Explain briefly concu...

Explain briefly concurrent task by taking an example. Concurrent Task- The concurrent occurrence of more than one event is called concurrent task. Operating systems can handl

What are the object-oriented approaches, What are the object-oriented appro...

What are the object-oriented approaches Software systems which are designed with structured design methodology never support some of desired quality attributes for example reus

Sql select employee from table with at least one department, Consider emplo...

Consider employee (e_no, e_name, e_salary, d_code), dept (d_code, d_name) and dependent (depndt_name, e_no, relation). Show the names of employees in purchase and accounts departm

Define 3nf normal form, 3NF Normal Form A relation schema R is in 3NF ...

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

Entity set that does not have sufficient attributes known as, An entity set...

An entity set that does not have sufficient attributes to form a primary key is called? An entity set that doesn't have sufficient attribute to form a primary key is known as w

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

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

Explain naivebayessimple algorithem, Use the IRIS dataset that comes with W...

Use the IRIS dataset that comes with Weka to compare the classification performance of the following algorithms. 1. NaiveBayesSimple 2. MultiLayerPerceptron J48 (

Differentiate between a subquery and a join, Differentiate between a subque...

Differentiate between a subquery and a join If we need to acquire information from one or more tables after that either subquery or join can be used. If the columns which are 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