Concept explainers
a. Definition of data warehouse.
Explanation of Solution
Data warehouse is a large collection of data which is further used by companies for decision making process of management. The data collection is subject-oriented, integrated, time-variant and non-updateable.
b. Definition of data mart.
Explanation of Solution
Data mart: A data warehouse which is limited in scope is called data mart. The data stored in data warehouse is selected and summarized using extract, transform and load process.
c. Definition of reconciled data.
Explanation of Solution
Reconciled data: It is detailed and current data which act as single source for all decision support system. This type of data is stored for enterprise data warehouse and operational data store.
d. Definition of derived data.
Explanation of Solution
Derived data: Data which is being extracted, formatted and segregated for end-user decision support application is known as derived data.
e. Definition of enterprise data warehouse.
Explanation of Solution
Enterprise data warehouse: It is a centralized, integrated data warehouse which act as the control point and only source for all data which is being made available to end user for decision making.
f. Definition of real-time data warehouse.
Explanation of Solution
Real-time data warehouse: It is a type of data warehouse which stores data related to transaction in near real time feeds from system of records. It can analyze data and control business rules in near real time so that appropriate actions can be taken as per current business events. It typically stores moderate size
g. Definition of star schema.
Explanation of Solution
Star schema: It is a database design where in dimensional data is separated from fact or event data. It is simplest type of data warehouse schema. It is called star schema as it is in the shape of start and is similar to relational model where fact table is represented at the centre and multiple dimensional table are connected to the centre fact table.
h. Definition of snowflake schema.
Explanation of Solution
Snowflake schema: It is an extension to star schema where dimensional tables are normalized into several related tables. Normalization of dimensional tables splits this table into multiple tables and the schema diagram resembles that of snowflake.
i. Definition of grain.
Explanation of Solution
Grain: Grain is the description of level of details for a fact table. For example, suppose a fact table stores information related to sales of specific product in various locations on a daily basis. Then grain for this fact table will be “information of product sale by location and by day”
j. Definition of conformed dimension.
Explanation of Solution
Conformed dimension: It is a dimension in which multiple dimension tables which are associated with multiple fact tables has same business meaning and primary key with each fact table.
k. Definition of static extract.
Explanation of Solution
Static extractis a type of data extractionmethod used to capture a snapshot of required source of data at a point of time. It is used to fill the data warehouse during initial phases.
l. Definition of incremental extract.
Explanation of Solution
Incremental extract is also a type of data extraction method which captures only the changes that have occurred in the source data since the last capture. It is used for ongoing warehouse maintenance.
m. Definition of refresh mode.
Explanation of Solution
Refresh modeis a strategy used for filling the data warehouse with data where bulk rewriting of the target data is involved at periodic intervals. Target data are filled in data warehouse initially and then rewritten periodically by replacing the previous content.
Want to see more full solutions like this?
Chapter 9 Solutions
Modern Database Management
- Refer to page 60 for solving the Knapsack problem using dynamic programming. Instructions: • Implement the dynamic programming approach for the 0/1 Knapsack problem. Clearly define the recurrence relation and show the construction of the DP table. Verify your solution by tracing the selected items for a given weight limit. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS3IZ9qoHazb9tC440AZF/view?usp=sharing]arrow_forwardRefer to page 70 for problems related to process synchronization. Instructions: • • Solve a synchronization problem using semaphores or monitors (e.g., Producer-Consumer, Readers-Writers). Write pseudocode for the solution and explain the critical section management. • Ensure the solution avoids deadlock and starvation. Test with an example scenario. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS31Z9qo Hazb9tC440AZF/view?usp=sharing]arrow_forward15 points Save ARS Consider the following scenario in which host 10.0.0.1 is communicating with an external SMTP mail server at IP address 128.119.40.186. NAT translation table WAN side addr LAN side addr (c), 5051 (d), 3031 S: (e),5051 SMTP B D (f.(g) 10.0.0.4 server 138.76.29.7 128.119.40.186 (a) is the source IP address at A, and its value. S: (a),3031 D: (b), 25 10.0.0.1 A 10.0.0.2. 1. 138.76.29.7 10.0.0.3arrow_forward
- 6.3A-3. Multiple Access protocols (3). Consider the figure below, which shows the arrival of 6 messages for transmission at different multiple access wireless nodes at times t=0.1, 1.4, 1.8, 3.2, 3.3, 4.1. Each transmission requires exactly one time unit. 1 t=0.0 2 3 45 t=1.0 t-2.0 t-3.0 6 t=4.0 t-5.0 For the CSMA protocol (without collision detection), indicate which packets are successfully transmitted. You should assume that it takes .2 time units for a signal to propagate from one node to each of the other nodes. You can assume that if a packet experiences a collision or senses the channel busy, then that node will not attempt a retransmission of that packet until sometime after t=5. Hint: consider propagation times carefully here. (Note: You can find more examples of problems similar to this here B.] ☐ U ப 5 - 3 1 4 6 2arrow_forwardJust wanted to know, if you had a scene graph, how do you get multiple components from a specific scene node within a scene graph? Like if I wanted to get a component from wheel from the scene graph, does that require traversing still? Like if a physics component requires a transform component and these two component are part of the same scene node. How does the physics component knows how to get the scene object's transform it is attached to, this being in a scene graph?arrow_forwardHow to develop a C program that receives the message sent by the provided program and displays the name and email included in the message on the screen?Here is the code of the program that sends the message for reference: typedef struct { long tipo; struct { char nome[50]; char email[40]; } dados;} MsgStruct; int main() { int msg_id, status; msg_id = msgget(1000, 0600 | IPC_CREAT); exit_on_error(msg_id, "Creation/Connection"); MsgStruct msg; msg.tipo = 5; strcpy(msg.dados.nome, "Pedro Silva"); strcpy(msg.dados.email, "pedro@sapo.pt"); status = msgsnd(msg_id, &msg, sizeof(msg.dados), 0); exit_on_error(status, "Send"); printf("Message sent!\n");}arrow_forward
- 9. Let L₁=L(ab*aa), L₂=L(a*bba*). Find a regular expression for (L₁ UL2)*L2. 10. Show that the language is not regular. L= {a":n≥1} 11. Show a derivation tree for the string aabbbb with the grammar S→ABλ, A→aB, B→Sb. Give a verbal description of the language generated by this grammar.arrow_forward14. Show that the language L= {wna (w) < Nь (w) < Nc (w)} is not context free.arrow_forward7. What language is accepted by the following generalized transition graph? a+b a+b* a a+b+c a+b 8. Construct a right-linear grammar for the language L ((aaab*ab)*).arrow_forward
- 5. Find an nfa with three states that accepts the language L = {a^ : n≥1} U {b³a* : m≥0, k≥0}. 6. Find a regular expression for L = {vwv: v, wЄ {a, b}*, |v|≤4}.arrow_forward15. The below figure (sequence of moves) shows several stages of the process for a simple initial configuration. 90 a a 90 b a 90 91 b b b b Represent the action of the Turing machine (a) move from one configuration to another, and also (b) represent in the form of arbitrary number of moves.arrow_forward12. Eliminate useless productions from Sa aA BC, AaBλ, B→ Aa, C CCD, D→ ddd Cd. Also, eliminate all unit-productions from the grammar. 13. Construct an npda that accepts the language L = {a"b":n≥0,n‡m}.arrow_forward
Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning