Consider a Vehinterest table that contains the following attributes: custNr 8 character customer number. When combined w

[answerhappygod]

Consider A Vehinterest Table That Contains The Following Attributes Custnr 8 Character Customer Number When Combined W 1 (125.18 KiB) Viewed 22 times

Consider a Vehinterest table that contains the following attributes: custNr 8 character customer number. When combined with vehType and vehMake, it is the unique key for Vehinterest. 5 character type of vehicle (e.g., TRUCK, SUV, VAN, ). When combined with custNr and vehMake, this is the unique key for this table. 12 character make of vehicle (e.g., 4Runner, Explorer, Prius, Connect). When combined with custNr and vehType, this is the unique key for this table. customer's age range (e.g., 1:under 20, 2:20-29, 3:30-39, 4:40-49, 5:50-59, 6:60-69, 7:over 70), this is 1 byte 4 byte date representing the last activity for this row customer's email, max of 250 character, average of 36 characters streetAddress customer's street address, max of 150 characters. This average is 40 characters. vehType vehMake ageRangeCd lastActivityDt email Assumptions: 1. There are 10 million rows in the Vehinterest Table. Because there are multiple rows for a customer (due to different combinations of custNr), on the average, there are 5 rows for each customer; therefore, there are 2 million customers. 2. Data and index blocks are 4096 bytes. 3. An index entry for a B+Tree contains: the key (size depends on the contents) and a Row Id which is 4 bytes. 4. There are two variable-sized attributes (email and streetAddress). Each will use a one byte length. Near the beginning of the row, there will be an additional 2 byte offset to access the streetAddress that follows the email. 5. Assume there are 200,000 customers in ageRangeCd=5. 10% of those customers are interested in SUVs. 6. Every character in Java uses 2 bytes.
Question 5 C. For a unique index (called I1) on the combination of custNr,vehType, and vehMake: • what is the size of an I1 index entry? (refer to assumption #3) Question 6 how many entries fit in an index block if we assume 20 bytes of overhead per index block?