Note: This question is part of series of questions that present the same scenario. Each question in the series contains

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

Note: This question is part of series of questions that present the same scenario. Each question in the series contains

Post by answerhappygod »

Note: This question is part of series of questions that present the same scenario. Each question in the series contains a unique solution that might meet the stated goals. Some question sets might have more than one correct solution, while others might not have a correct solution.After you answer a question in this section, you will NOT be able to return to it. As a result, these questions will not appear in the review screen.You have a table named Table1 that contains 3 billion rows. Table1 contains data from the last 36 months.At the end of every month, the oldest month of data is removed based on a column named DateTime.You need to minimize how long it takes to remove the oldest month of data.Solution: You implement round robin for table distribution.Does this meet the goal?

A. Yes
B. No
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!

This topic has 1 reply

You must be a registered member and logged in to view the replies in this topic.


Register Login
 
Post Reply