Reference no: EM132495202 , Length: word count:1500
CMI3509 Databases for Large Data Sets Assignment, School and Computing and Engineering - University of Huddersfield, UK
Title - Portfolio Assignment - Databases and Applications
Assignment Aims - This assignment introduces you to some current database products. You will gain knowledge, and ideally experience, of a range of database systems and will learn to appreciate the application areas where each might find an application.
Learning Outcomes -
1. Elicit and conceptualise stakeholder needs.
2. Use a range of modelling techniques to produce effective designs for non-relational databases.
Assessment Brief - The module will introduce you to at least seven current commercial database systems. These include both relational and "NoSQL" databases. In this assignment you will develop small databases using two of these. Choose two current widely available database products and develop paper-based demonstration tutorials for each one. The tutorial should briefly explain a suitable use case for each DBMS and then show clearly how to create and query a database. If you wish, one of your chosen DBMSs can be relational, but not both.
You may use any DBMS that is available to you (if in doubt, consult the module tutor). You will need a working version of the DBMS, and this (along with ease of installation) may influence your choices. You are free to use one or more of the case studies you described in the reading assignment. Indeed, this is probably the easiest way to proceed. Note that the word limit is again tight. Keep the case study description short. Note: You are free to use any relational DBMS should you wish to include that model. However, if you studied CMI3411 last semester you may not use MySQL (as you did a similar exercise with MySQL there). PostgreSQL or SQLite are fine, freely available, alternatives.
This is my Data Base for Large Data Sets Portfolio assignment, in this we need to use only Putty Software with 1 Relational Database (or) 1 No SQL (or) both no SQL.
The below point needs to be there in the assignment -
1. Need to take 1 Relational database and 1 no sql database (or) 2 no sql database----Postgree SQL, Mongo db( One Relational and 1 NoSQL)
2. Need to execute the commands like queries(clearly how to create database with this software) and we need all the screenshots.... for that 2 databases.
3. Without commands and lines screen shots we need 1000 words.
4. Mainly use PUTTY software for queries excurtion.
Attachment:- Databases for Large Data Sets Assignment File.rar
|
What is the value of sum of squares
: If N = 50, M = 3.6, Variance is 2.12, what is the value of Sum of Squares?
|
|
Record the purchase of the computer system
: Record the purchase of the computer system and the depreciation expense for the first year under straight-line and double-declining-balance
|
|
Discuss the transfer tax consequences if meredith is
: Meredith dies. Briana, Meredith's daughter, then redeems the CD when it matures. Discuss the transfer tax consequences if Meredith is
|
|
Calculate the probability or odds of drawing an ace
: Calculate the probability, or odds, of drawing an Ace from a standard deck of 52 playing cards. Simplify to a reduced fraction, when possible.
|
|
CMI3509 Databases for Large Data Sets Assignment
: CMI3509 Databases for Large Data Sets Assignment Help and Solution, University of Huddersfield, UK. Title - Portfolio Assignment - Databases and Applications
|
|
Determine depreciation expense for each of the four years
: Compute the depreciation expense for each of the four years, using units-of-production depreciation. (Round cost per unit to three decimal places)
|
|
Simplify to a reduced fraction when possible
: Calculate the probability, or odds, of NOT getting a 10, Jack, Queen, or King AND an Ace (also known as Black Jack in Poker).
|
|
Prepare the journal entries to recognize depreciation
: Prepare the journal entries to recognize depreciation for each of the five years, assuming that the company uses Straight-line depreciation.
|
|
Find the probability of at least 235 wins
: That is, given n = 431 and p = 0.5, find the probability of at least 235 wins.
|