<samp id="e4iaa"><tbody id="e4iaa"></tbody></samp>
<ul id="e4iaa"></ul>
<blockquote id="e4iaa"><tfoot id="e4iaa"></tfoot></blockquote>
    • <samp id="e4iaa"><tbody id="e4iaa"></tbody></samp>
      <ul id="e4iaa"></ul>
      <samp id="e4iaa"><tbody id="e4iaa"></tbody></samp><ul id="e4iaa"></ul>
      <ul id="e4iaa"></ul>
      <th id="e4iaa"><menu id="e4iaa"></menu></th>

      COMP643代做、代寫SQL語言程序

      時間:2024-06-14  來源:  作者: 我要糾錯



      COMP643 Advanced Database Management 
      Assignment 3 
      Worth: 20% of course marks for COMP643. 
      Due: Friday, 14th June 2024 5:00 p.m. 
      Late Penalty: Work not received by the due time attracts an immediate penalty, up to 25% of 
      the points available. No work will be accepted after Sunday 16
      Submission: via COMP643 on LEARN 
      IMPORTANT 
       
      The use of Artificial Intelligence (AI) tools, such as ChatGPT, to complete this assessment is 
      prohibited. Assessment answers will be analysed for evidence of the use of AI and penalties may be 
      administered. 
       
      The University policy on Academic Integrity can be found here. 
       
      PART 1 – QUERYING AND UPDATING THE DOCUMENT DATABASE (50 POINTS) 
      MongoDB is an open-source document-oriented database that is designed to store large scale data. 
      It is categorised as a NoSQL (Not only SQL) database because the storage and retrieval of data in the 
      MongoDB is not in the form of tables and querying does not have to be done using SQL. Additional 
      learning materials for MongoDB can be found on COMP643 LEARN Page. 
      In Assignment 2, Part 2, you used a database to process orders for roses. A subset of this database 
      have been converted to MongoDB. You can download the JSON file (“rosesdb.json”) for creating this 
      database in your local machine. 
      Based on this document database, write queries in MongoDB for each of the following tasks. Submit 
      the queries in a text file, each query MUST be labelled with the question number (e.g, 1a). 
      a. Display the customer id and customer name of all customers with a balance of $0.00 and who 
      are not from “Christchurch” sorted by customer id. 
      (4 points) 
       
      b. Display the customer id, customer name, customer city and customer balance of all customers 
      sorted by customer name in ascending order. (3 points) 
       
      c. Display the product name and product price for every product in the system. Sort the results by 
      product name. Duplicates should be removed. (3 points) 
       
      d. Display the product name and total for all orders made by customer number 1001 sorted by 
      total in descending order. (4 points) 
       2 | P a g e 
       
       
      e. Display the product name and product price for all products that cost greater than or equal to 
      $50.00. (3 points) 
       
      f. For each customer, display the customer’s name, the number of order and the order total. (5 
      points) 
       
      g. Display the number of distinct products in the system. (3 points) 
       
      h. Display the product name and the product price for the product with highest price. (4 points) 
       
      i. Display the customer name for all customers who have never ordered a product. (2 points) 
       
      j. Display all cities customers are based in and the number of customers in each city. (3 points) 
       
      k. Display the product name and total for all the product(s) ordered by “John”. (3 points) 
       
      l. Display the product name and the number of times each product has been ordered. (3 points) 
       
      m. Insert a new customer, (10013, “Hans”, “Dunedin”, 0.00). (5 points) 
       
      n. Insert a new order for Hans, (“Wenlock”, 40, 3, 120.00) and update the customer balance for 
      Hans to 120.00. (5 points) 
       
       
      PART 2 – EVALUATIONS OF THE DOCUMENT DATABASE (30 POINTS) 
      Lincoln Rose Farm is expanding to 20 different cities in New Zealand. The plan is to have a collection 
      of 1,000 roses in each location and to cater for over 20,000 customers nationwide. Write a one-page 
      summary (excluding references) to discuss the suitability of a document database to store and 
      manage customer orders. Your discussion should consider three factors. These factors may include 
      data model (schema flexibility), usability and performance, data integrity and accuracy, functionality, 
      security and cost. All references must follow APA 7
      th
       Edition reference format. 
      Submit your discussion as a PDF. 
      Part 3 Marking Criteria 
      Description Marks 
      Discussion of suitability of a document database using each of 
      the three selected factors. 
      24 
      Spelling, punctuation, grammar and references 6 
      Total 30 
       
      請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp

















       

      標簽:

      掃一掃在手機打開當前頁
    • 上一篇:代寫ECON2101: Microeconomics 2
    • 下一篇:代做COMP9021、代寫python語言編程
    • 無相關信息
      昆明生活資訊

      昆明圖文信息
      蝴蝶泉(4A)-大理旅游
      蝴蝶泉(4A)-大理旅游
      油炸竹蟲
      油炸竹蟲
      酸筍煮魚(雞)
      酸筍煮魚(雞)
      竹筒飯
      竹筒飯
      香茅草烤魚
      香茅草烤魚
      檸檬烤魚
      檸檬烤魚
      昆明西山國家級風景名勝區
      昆明西山國家級風景名勝區
      昆明旅游索道攻略
      昆明旅游索道攻略
    • 福建中專招生網 NBA直播 短信驗證碼平臺 WPS下載

      關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

      Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網 版權所有
      ICP備06013414號-3 公安備 42010502001045

      主站蜘蛛池模板: 国产精品无码亚洲精品2021| 国产成人午夜无码电影在线观看| 亚洲日韩乱码中文无码蜜桃| 无码国产精品一区二区免费虚拟VR | 亚洲AV无码乱码在线观看代蜜桃 | 亚洲AV无码一区二区三区人 | 中文字幕有码无码AV| 无码性午夜视频在线观看| 久久无码AV一区二区三区| 无码专区永久免费AV网站| 亚洲Av无码精品色午夜| 特级无码毛片免费视频| 亚洲精品无码成人| 国产精品VA在线观看无码不卡| 亚洲精品无码专区| 亚洲ⅴ国产v天堂a无码二区| gogo少妇无码肉肉视频| 在线无码视频观看草草视频| 久久亚洲AV成人无码| 国产在线无码一区二区三区视频 | 无码永久免费AV网站| 免费无码中文字幕A级毛片| 日韩成人无码中文字幕| 国产乱人伦无无码视频试看| 免费无码不卡视频在线观看| 久久久久亚洲AV无码专区首JN| 亚洲一区二区三区无码中文字幕| 无码精品人妻一区二区三区AV| 午夜福利无码一区二区| 无码人妻精品一区二区三区不卡| 久久久久精品国产亚洲AV无码| 色综合AV综合无码综合网站| 国产精品无码a∨精品| 亚洲AV无码成人网站久久精品大 | 亚洲ⅴ国产v天堂a无码二区| 无码无遮挡又大又爽又黄的视频| 无套中出丰满人妻无码| 人妻丰满熟妇AV无码区乱| 亚洲AV成人无码天堂| 无码人妻丰满熟妇片毛片| 亚洲av日韩av无码av|