Design Relationships, Indexes, Queries, & More (Individual/Team Of 2) Assignment 20 USE PENCIL

Transcription

1 Relationships-1-HW.docx CSCI 3321 Initials P a g e 1 If this lab is an Individual assignment, you must do all coded programs on your own. You may ask others for help on the language syntax, but you must organize and present your own logical solution to the problem. No lab is complete until the student submits the signed pledge form associated with that lab. I realize that no coded programs will be graded until I turn in the sign & pledge form associated with that program; any late penalties will continue to compound until the pledge form is submitted. If this lab is a team assignment, both team members may share logic as they program side by side on their own computers. Each person must type all of his/her own code as part of the learning process. Team assignments are never to be "You do this portion and I ll do that portion" or "You do this lab and I ll do the next lab". Some of the lab assignments will have short answer questions. These short answer questions will be spot checked and graded for completion, but not checked for accuracy. Once these labs are graded and returned, I encourage you to compare answers with another class member who has also had the lab graded and returned. These short answer questions will be spot checked and graded for completion, but not checked for accuracy. I encourage you to form a study group; get together to prepare for exams. Once your homework and labs are graded and returned, I encourage you to compare answers others in your study group who have also had the lab, or homework, graded and returned. You may not share this work outside the class; it is a violation of academic integrity to share your work with others outside the class. It is a violation of academic integrity to receive the software engineering work completed by other students. You must answer at least 90% of the short answer questions correctly! I/We realize that the penalty for turning in work that is not my own, or assisting others in doing so, can range from an "F" in the class to dismissal from Trinity University. Print Name Time Required =. Hrs. Signature (pledged) Design Relationships, Indexes, Queries, & More (Individual/Team Of 2) Assignment 20 USE PENCIL Create Genre <7 Points> 1] Import A Copy Of One Of The LibrarySE?sql files from Mars. 2] Add Table Genre To The Application. You must have at least 10 Genre Items (your choice) 3] Add Table BookGenre To Your System. Each Book Is To Have 1-6 Genre Items; they may be nonsensical. Make this happen! 4] Backup Your Database - Call the backup LibraryJTH-3 using your initials. 5] Place LibraryJTH-3.sql in your To Be Graded Folder on Mars. Database Deficiencies 1] This elementary school library database is very, very, very inadequate but even with what is here there are two really glaring deficiencies! A] There should be a UserMajor Table (ID, UserID, MajorID, Deleted) that ties the Majors to the Users; a User could then have many different Majors. B] Authors should not be in the Book Table. There should be an Authors Table (ID, Author, Deleted) and a BookAuthors Table (ID, AuthorID, BookID) that ties the authors to the Books; a Book could then have many different Authors.

2 Relationships-1-HW.docx CSCI 3321 Initials P a g e 2 Query Practice 1 1] SQL is an acronym for _?_ TABLE X TABLE Y 2] Sketch the results of the Query SELECT * FROM X, Y 3] Assume the dimensions of table M = 100 x 10 and Table N = 200 x 20. What are the dimensions of SELECT * FROM X, Y 4] According to the slides, _?_ {Fully/Minimally} qualified names are usually preferred, but some considerations apply. 5] According to the slides, _?_ Trees are used to accelerate searching in most modern relational databases.

3 Relationships-1-HW.docx CSCI 3321 Initials P a g e 3 Hardware 1] In the sketch above, the red ring represents a A] Block B] Track C] Sector 2] In the sketch above, each of the three green chuncks represent a A] Block B] Track C] Sector 3] In the sketch above, the blue chunck represents a A] Block B] Track C] Sector 4] The slides illustrated an administrative windows command line utility program that allows us to see the size of block on our hard drive; this program is called D_?_. When you execute the command filesystem, this program also allows you to see (1) the block size, (2) the format structure of the drive, and (3) ideal buffer sizes. B Tree Assume M = 9 sizeof(infotype) = 9,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 20 x 4096 = 81,920 Partial Credit Possible If You Show The Equations You Use For Calculations (Where Appropriate)! 1] This B Tree node has the capacity to hold _?_ records? {Numerical Value?}. 2] {T/F} The records in the B Tree node will be sorted in ascending order. 3] This B Tree node will contain _?_ Pointers (to other B Tree Nodes)? {Numerical Value?} 4] This B Tree node will contain _?_ Actual Number Counter 5] A B Tree node will contain _?_ records? (Express in terms of M) 6] A B Tree node will contain _?_ Pointers (Express in terms of M)? 7-8] In the space below, sketch a B Tree Node for this application M = 9 scenario. Hint Include records, ptrs, counters.

4 Relationships-1-HW.docx CSCI 3321 Initials P a g e ] The size of this B Tree Node = _?_ Bytes {Numerical Value Not In Terms Of M Partial Credit Possible If You Show The Values Used In The Calculation} 11] Maximum # of records in first level = _?_ {Numerical Value Not In Terms Of M} 12] Minimum # of records in first level = _?_ {Numerical Value Not In Terms Of M} 13] Assume that there is one level in the B tree and that there are 8 records represented in that level. The number of Reads/Writes that would be required to access the data in any one of those 8 records would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 14] Maximum # of records in the second level = _?_ {Numerical Value Not In Terms Of M} 15] Minimum # of records in the second level = _?_ {Numerical 16] Avrerage # of records in the second level = _?_ {Numerical 17] Assume that there are two levels in the B tree and that there are 72 records represented in just the second level. The number of Reads/Writes that would be required to access the data in any one of those 72 records would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 18] Maximum # of records in the third level = _?_ {Numerical 19] Minimum # of records in the third level = _?_ {Numerical 20] Average # of records in the third level = _?_ {Numerical 21] Assume that there are three levels in the B tree and that there are 648 records represented in just the third level. The number of Reads/Writes that would be required to access the data in any one of those 648 records would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 22] Maximum # of records in the fourth level = _?_ {Numerical

5 Relationships-1-HW.docx CSCI 3321 Initials P a g e 5 23] Maximum # of records in the fifth level = _?_ {Numerical 24] Maximum # of records in the sixth level = _?_ {Numerical 24] Maximum # of records in the seventh level = _?_ {Numerical 25] Minimum # of records in the seventh level = _?_ {Numerical 26] Assume that there are seven levels in the B tree and that there are 2,125,764 records represented in just the seventh level. The number of Reads/Writes that would be required to access the data in any one of those records would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 27] If M = 9, it would require no more _?_ levels to store a tree with 1 million records. 28] With the exception of the root node, every node on a B Tree, would be at least _?_ % full. 29] With the exception of the root node, the average node on a B Tree, would be _?_ % full. Assume M =? sizeof(infotype) = 9,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 20 x 4096 = 81, ] The optimal value for M = _?_ {Numerical Value No Partial Credit Unless You Show The Work Of Your Calculations Below}

6 Relationships-1-HW.docx CSCI 3321 Initials P a g e 6 B+ Tree Assume M = 5,120 sizeof(infotype) = 9,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 20 x 4096 = 81,920 Partial Credit Possible If You Show The Equations You Use For Calculations (Where Appropriate)! 1] This B+ Tree node has the capacity to hold _?_ key sets? {Numerical Value?} 2] {T/F} The keys (in the key sets) of the B+ Tree node will be sorted in ascending order. 3] This B+ Tree node will contain _?_ Pointers (to other B+ Tree Nodes)? {Numerical Value?} 4] This B+ Tree node will contain _?_ Actual Number Counter 5] A B+ Tree node will contain _?_ key sets? (Express in terms of M) 6] A B+ Tree node will contain _?_ Pointers (Express in terms of M)? 7-8] In the space below, sketch a B+ Tree Node for this application M = 9 scenario. Hint Include key sets, ptrs, counters. 9-10] The size of this B+ Tree Node = _?_ Bytes {Numerical Value Not In Terms Of M Partial Credit Possible If You Show The Values Used In The Calculation} 11] Maximum # of key sets in first level = _?_ {Numerical Value Not In Terms Of M} 12] Minimum # of key sets in first level = _?_ {Numerical Value Not In Terms Of M} 13] Assume that there is one level in the B+ Tree and that there are 5,119 key sets represented in that level. The number of Reads/Writes that would be required to access the data in any one of those 5,119 key sets would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 14] Maximum # of key sets in the second level = _?_ {Numerical Value Not In Terms Of M} 15] Minimum # of key sets in the second level = _?_ {Numerical

7 Relationships-1-HW.docx CSCI 3321 Initials P a g e 7 16] Average # of key sets in the second level = _?_ {Numerical 17] Assume that there are two levels in the B tree and that there are 26,209,280 key sets represented in just the second level. The number of Reads/Writes that would be required to access the data in any one of those 26,209,280 key sets would be = _?_ ; assume that the root node is kept in memory. {Numerical Value Not In Terms Of M} 18] Maximum # of key sets in the third level = _?_ {Numerical 19] If M = 5,120, it would require no more _?_ levels to store a tree with 1 million key sets. 20] If M = 5,120, it would require no more _?_ levels to store a tree with 1 billion key sets. 21] With the exception of the root node, every node on a B+ Tree, would be at least _?_ % full. 22] With the exception of the root node, the average node on a B+ Tree, would be _?_ % full. Assume M =? sizeof(infotype) = 9,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 20 x 4096 = 81, ] The optimal value for M = _?_ {Numerical Value No Partial Credit Unless You Show The Work Of Your Calculations Below} Why Use B+Trees Instead Of BTrees? 1] {BTrees/B+Trees} The two buffering scenarios above, one for BTrees and one for B+Trees, use the same records and the same keys. Which of the two solutions would provide faster Searching with a million items on the tree? 2] {BTrees/B+Trees} The two buffering scenarios above, one for BTrees and one for B+Trees, use the same records and the same keys. Which of the two solutions would provide faster Insertion with a million items on the tree?

8 Relationships-1-HW.docx CSCI 3321 Initials P a g e 8 3] {BTrees/B+Trees} The two buffering scenarios above, one for BTrees and one for B+Trees, use the same records and the same keys. Which of the two solutions would provide faster Deletion with a million items on the tree? 4] {BTrees/B+Trees} The two buffering scenarios above, one for BTrees and one for B+Trees, use the same records and the same keys. Which of the two solutions would provide better space management? 5] {BTrees/B+Trees} The two buffering scenarios above, one for BTrees and one for B+Trees, use the same records and the same keys. Which of the two solutions would be better for implementing multiple sets of keys to the same record/table set? Indexing 1-2] According to the slides, all of the form O_?_ Fields should be indexed. 3-4] According to the slides, all of the form F_?_ Fields should be indexed. 5-6] According to the slides, all of the fields associated with any S_?_ should be indexed. 7-10] According to the slides, all of the fields associated with any of the query Sp_?_ should be indexed. 11] {T/F} According to the slides, all fields should be indexed ] The slides included four reasons why we should not update every database field. List them. Indexing takes Sp_?_. Indexing slows down the In_?_ process Indexing slows down the De_?_ process Indexing can slow down the Up_?_ process

9 Relationships-1-HW.docx CSCI 3321 Initials P a g e 9 Query Practice 2 Write Good Queries Which Minimize Joins 1-A] Write a query that will show the fullname and usertype for all users in alphabetical order by name. 1-B] Assume that queries, similar to the one in part A above, were run at least once a year. Good Software design would require the software engineer index three fields in order to avoid sequential searching; list these fields below. Hint: 3 of them! 2-A] Write a query that will show all of the information about the most expensive book 2-B] Assume that queries, similar to the one in part A above, were run at least once a year. Good Software design would require the software engineer index one field in order to avoid sequential searching; list these fields below. Hint: 1 of them!

10 Relationships-1-HW.docx CSCI 3321 Initials P a g e 10 3-A] Write a query that will show the FullName, date info as shown above, and Title of all folks that have checked out Software Engineering: A Practitioner's Approach in alphabetical order by name. 3-B] Assume that queries, similar to the one in part A above, were run at least once a year. Good Software design would require the software engineer index eight fields in order to avoid sequential searching; list these fields below. Hint: 8 of them!

11 Relationships-1-HW.docx CSCI 3321 Initials P a g e 11 4-A] Write a query that will show the FullName, Gender, date info as shown above, and Title for all of the books checked out by Martinez, John. 4-B] Assume that queries, similar to the one in part A above, were run at least once a year. Good Software design would require the software engineer index ten fields in order to avoid sequential searching; list these fields below. Hint: 10 of them!

12 Relationships-1-HW.docx CSCI 3321 Initials P a g e 12 5] The fields in your Genres, GenreBooks, & Books shall be as follows. Rename them if necessary. 6] Each of our genre selections will be contingent upon how you built your Genre and GenreBooks tables. Write a query that will show the Title and Genre for "Software Engineering: A Practitioner's Approach ; alphabetize all of the Genre that you have associated with this listing. You should have 1-6 results. 7] Write a query that will change the Genre, of the eighth Genre record, to Mystery ; if you already have a genre, called Mystery then do not execute this line of code. When done, Mystery should be in your Genre.

13 Relationships-1-HW.docx CSCI 3321 Initials P a g e 13 8] Write a query that will display the Title and Genre of all Genre that begins with an M ; order the books by Title. 9] The User of our system will have to log in with their password and their . Write a query that will create an index, called . Write a query that will create an index, called Password. 10] Write a query that will display all of the index information in the Users Table. Do not use Describe or Select!