Built online transaction processing, Database Management System

Assignment Help:

Question:

A DBMS built for Online Transaction Processing (OLTP) is generally regarded as unsuitable for data warehousing. Each system is designed with a different set of requirements.

(i) Give example of how OLTP systems differ from data warehousing systems.

(ii) Illustrtae any problems that are associated with developing and managing a data warehouse.

(iii) Explain what is meant by Metadata and what are the purposes of a Metadata in data warehouse architecture.

(iv) Show how data marts differ from data warehouses and identify any two reasons for implementing a data mart.


Related Discussions:- Built online transaction processing

Differance between unordered and ordered file, Differance between Unordered...

Differance between Unordered and ordered file ? Unordered file do no has any sequence although ordered file has arranged in a few sequence and data are assigned in ordered form

Give the relational calculus queries of players in sql, An orchestra databa...

An orchestra database consists of the following relations: CONDUCTS (conductor, composition) REQUIRES (composition, Instrument) PLAYS (Player, Instrument) Give the relational

What is called query processing, What is called query processing? Query...

What is called query processing? Query processing refers to the range of activities included in extracting data from a database.

Appointment systems with sms and voice call feedback, Automated system for ...

Automated system for appointment with sms and call confirmation with service providers and user has to be initiate automatically. After selecting time and date to use service, s

State the meaning of self-transition, What is self-transition? ...

What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f

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.

Sorting field groups we cannot use more than one key field, While sorting f...

While sorting field groups we cannot use more than one key field False.

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

Give example of relational schema, An instance of relational schema R (A, B...

An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val

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