Implement the star Schema in PostgreSQL. Write the code for table creating in PostgreSQL CustomerCustomerIDCustomerNameCustomerNIDCustomerAddressSuperstoreStorelDSupplierAddressSupAddressStreetProcurement_SupSale_transaction_supCityDistrictSupplier(FK)SupAddressProduct_sup_type (FK)SupIDSupAddressSup_NameProduct_sup_typefact table(FK)CustomerIDCustomerIDStorelDSupIDTransIDItemlDCustomerIDTransIDSup_IDStore_IDItemIDCustomerAddressCustomerIDHouseNoThanaCityDistrict(FK)(FK)(FK)(FK)Product_to_supplyProduct_sup_typeMachineriesFoodClothes(FK)DivisionAgeGroupTransactionTypeTransactionTransIDTrans_typeTime_StamplDTimeOfDayWeek_DayDateWeekMonthYearQuantityTransID(FK)ItemItemlDItemNameItemTypeItem_Country_ManfCashCardUnitPriceTotal_price

Code for creating tables: create table Customer(CustomerID int primary key, CustomerName text,…

SupplierAddress SupAddress Street City District Superstore StorelD Procurement_Sup Sale_transaction_sup Customer CustomerID CustomerName CustomerNID CustomerAddress Supplier SupAddress (FK) Product_sup_type (FK) SupID SupAddress Sup_Name Product_sup_type fact table CustomerID (FK) CustomerID (FK) StorelD CustomerAddress CustomerID HouseNo Thana City District Division AgeGroup (FK) SupID (FK) TransID ItemID CustomerID TransID Sup_ID Store_ID ItemlD (FK) Product_to_supply Product_sup_type Machineries Food Clothes (FK) Transaction TransID Trans_type Time_StampID TimeOfDay Week_Day Date Week Month Year Quantity UnitPrice TransactionType TransID (FK) Cash Card Item ItemID ItemName ItemType Item_Country_Manf Total_price

SupplierAddress SupAddress Street City District Superstore StorelD Procurement_Sup Sale_transaction_sup Customer CustomerID CustomerName CustomerNID CustomerAddress Supplier SupAddress (FK) Product_sup_type (FK) SupID SupAddress Sup_Name Product_sup_type fact table CustomerID (FK) CustomerID (FK) StorelD CustomerAddress CustomerID HouseNo Thana City District Division AgeGroup (FK) SupID (FK) TransID ItemID CustomerID TransID Sup_ID Store_ID ItemlD (FK) Product_to_supply Product_sup_type Machineries Food Clothes (FK) Transaction TransID Trans_type Time_StampID TimeOfDay Week_Day Date Week Month Year Quantity UnitPrice TransactionType TransID (FK) Cash Card Item ItemID ItemName ItemType Item_Country_Manf Total_price

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: What are the practical uses of hashing or graphing in terms of data structures and algorithms?

A: Data Structure and Alogorithms: A data structure is a named area that can be utilized to store and…

Q: How do you use SQL QUEUE Containers to view the order list in c++? For example I have 4 commands :…

A: Queue in C++ Standard Template Library (STL) Difficulty Level : Easy Last Updated : 17 Jan, 2022…

Q: Explain the role of arrays and linked lists as complex data types in computer programming. When…

A: An array is a grouping of objects with related data types.A linked list is a collection of items…

Q: What is the main difference between composition and aggregation? Provide a concise explanation.

A: Comparison between aggregation and composition.

Q: Make a thorough note about hashing. Applications of hashing, hash tables, collisions, collision…

A: Data of any size can be mapped to fixed-size values using a process called hashing. Hashing is the…

Q: Distinguish between the key-based 2NF and 3NF definitions and the generic definitions. Provide a…

A: 2NF: This states that no non-prime qualities of a relation in first normal form should be…

Q: Compare and contrast a hash table and an STL map. How is a hash table implemented? If the number of…

A: Both hash tables and STL maps are data structures that are used to store and obtain key-value pairs.

Q: What distinguishes a clustered index from a sparse index, please?

A: In DBMS , Indexing is used to increase the performance of the database by reducing the accesses of…

Q: It is important to contrast and compare a hash table and an STL map. What is the application of a…

A: Hash tables and STL maps are both commonly used data structures in computer science and have…

Q: Are RDBMS and NoSQL the same thing?

A: answer is

Q: How does a dictionary differ from a list or an array in terms of data storage and access?

A: The dictionaries are primarily used for associating keys with values and have fast retrieval times…

Q: Which of the following is true? Group of answer choices Reduce-Reduce conflicts never occur in…

A: It is false that reduce conflicts never occurs in shift reduce parsers. As in shift reduce parsers…

Concept explainers

Transaction Processing

Transaction processing is a computational style generally performed by server computers, which supports interactive applications (apps). Transaction processing is also known as information processing, which divides the work into indivisible and individual operations called transactions. The transaction is a set of tasks; a single task is considered as the minimum processing unit that cannot be divided again.

Question

Implement the star Schema in PostgreSQL. Write the code for table creating in PostgreSQL

Customer
CustomerID
CustomerName
CustomerNID
CustomerAddress
Superstore
StorelD
SupplierAddress
SupAddress
Street
Procurement_Sup
Sale_transaction_sup
City
District
Supplier
(FK)
SupAddress
Product_sup_type (FK)
SupID
SupAddress
Sup_Name
Product_sup_type
fact table
(FK)
CustomerID
CustomerID
StorelD
SupID
TransID
ItemlD
CustomerID
TransID
Sup_ID
Store_ID
ItemID
CustomerAddress
CustomerID
HouseNo
Thana
City
District
(FK)
(FK)
(FK)
(FK)
Product_to_supply
Product_sup_type
Machineries
Food
Clothes
(FK)
Division
AgeGroup
TransactionType
Transaction
TransID
Trans_type
Time_StamplD
TimeOfDay
Week_Day
Date
Week
Month
Year
Quantity
TransID
(FK)
Item
ItemlD
ItemName
ItemType
Item_Country_Manf
Cash
Card
UnitPrice
Total_price

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

4. Compare static and dynamic linking.
In this question don’t change code, just in python postgreSQL but solve the question and follow the instructions
What is the primary difference between composition and aggregation? Give a concise summary.
Data structures. How to write modified merge sort on Java? Please help!
Select problem below. Your post must include: The problem statement. A description of your solution highlighting the use of the split(), join(), lists and the different list operations involved in solving the problems. Include line numbers from your program. please make it simple and DONT use Java Create a program and reads a MAC address and determines whether it is syntactically correct or not. Assume the format of the MAC address is dd-dd-dd-dd-dd-dd where dd represents a 2-character hexadecimal number (each character is a digit or a letter between a and f). Use the `split function to access the values in the input MAC address.
Describe a situation where an array is more suitable than a linked list in terms of access and retrieval efficiency. Justify your choice.
Briefly explain extended source index
Make a detailed note about hashing. (Hashing, hash table, collision, collision detection methods, time complexity, and uses of hashing). Explain in detail one way that hashing is used. Do you know of any Java tools that could help with this?
Create a thorough note on Hashing. (Hashing, hash table, collision, collision detection algorithms, time complexity, and hashing applications). Describe in detail one application of hashing. Do you know of any Java libraries that can be used for this purpose?
How does the "fork-join" model relate to multithreading? Provide an example of its practical use.
Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts…
Develop an in-depth study guide for hashing. (Hashing, hash table, collision, techniques for detecting collisions, temporal complexity, and hashing applications). Describe in some detail one use case for the hashing algorithm. Do you have any idea whether there are any Java libraries that might be used for anything like this?