1 / 2

6.830 Lecture 6

Lab 1 Tutorial – Tomorrow, 7 PM, 32-144. 6.830 Lecture 6. Cost Estimation and Access Methods. Study Break. Assuming disk can do 100 MB/sec I/O And the following schema: grades ( cid int , g _sid int , grade char(2)) s tudents ( s_int , name char(100))

nenet
Download Presentation

6.830 Lecture 6

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lab 1 Tutorial – Tomorrow, 7 PM, 32-144 6.830 Lecture 6 Cost Estimation and Access Methods

  2. Study Break • Assuming disk can do 100 MB/sec I/O • And the following schema: grades (cidint, g_sidint, grade char(2)) students (s_int, name char(100)) • Estimate time to sequentially scan grades, assuming it contains 1M records (Consider: field sizes, headers) • Estimate time to join these two tables, using nested loops, assuming students fits in memory but grades does not, and students contains 10K records.

More Related