HomeworkLib
Question

What is the average cost for linear search on equality on a primary key field? Assume...

What is the average cost for linear search on equality on a primary key field? Assume 100,000 records, 10 records/block, 5 ms access time, 100 MB/s transfer rate, and 4 KB block size. Assume sequential access.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

So, from the data we can say the total number of block= 100000/10= 10000

block size of 1 block= 4KB

block size of 10000 blocks=40000KB=40MB

Transfer Rate=100MB/s

Total time for transferring block will be= 40/100 sec= 4ms

Access time=5ms

Retrieve a single record that satisfies the corresponding equality condition

so, Cost = (hi + 1) * (tT + tS )=(1+1)*(5+4)=18

0 0
Add a comment
Know the answer?
Add Answer to:
What is the average cost for linear search on equality on a primary key field? Assume...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • What is the average I/O time if a 3600-RPM disk transfers an 800 KB block with a 7 ms average see...

    What is the average I/O time if a 3600-RPM disk transfers an 800 KB block with a 7 ms average seek time, a 100 MB/sec transfer rate, and a 0.17 ms controller overhead?

  • Assume a sorted relation has 40 GB (file size), block size is 4KB, each block stores 40 records. ...

    Assume a sorted relation has 40 GB (file size), block size is 4KB, each block stores 40 records. Assume the index B+ tree has entries for each record, and the fanout of the node for B+ tree is 100. Select with an equality condition on the attribute, search key of index. Assume the disk seek cost is 5 milliseconds, and block transfer cost is 1 milliseconds. Also assume if the selection is a non key attribute, there are 100 matching...

  • 7. [1+1+1-3 points] Compute the (a) transfer time, (b) average rotational latency, and(c) disk access time for the following input data for a disk? Rotational speed- 7200 rpm, sector size- 0.5 KB...

    7. [1+1+1-3 points] Compute the (a) transfer time, (b) average rotational latency, and(c) disk access time for the following input data for a disk? Rotational speed- 7200 rpm, sector size- 0.5 KB, average seek time 5.7 ms, transfer rate 24.5 MB per sec, controller overhead -1 ms 7. [1+1+1-3 points] Compute the (a) transfer time, (b) average rotational latency, and(c) disk access time for the following input data for a disk? Rotational speed- 7200 rpm, sector size- 0.5 KB, average...

  • Average and minimum times for reading and writing to storage devices common measurements used to compare...

    Average and minimum times for reading and writing to storage devices common measurements used to compare devices. Using techniques from Chap- ter 6, calculate values related to read and write time for disks with the following characteristics are RPM Controller Transfer Rate Average Seek Time Disk Transfer Rate 100 MB/s 90 MB/s 10 ms 7500 a. b. 200 MB/s 7 ms 40 MB/s 10,000 6.3.1 [10] <6.2, 6.3> Calculate the average time to read or write a sector for each...

  • 2) b. A disk drive has a speed of 12000 RPM, an average seek time of...

    2) b. A disk drive has a speed of 12000 RPM, an average seek time of 5 ms, and a transfer rate of 140 MB/sec. How much time does it take to perform 50 random reads of 10 KB? (In other words, the 50 reads are from random spots on the drive, but each individual read is performed sequentially.) Give your answer in units of seconds. c. Given the same information as in b) above, what is the I/O rate...

  • 1. Randomized Binary Search Which are true of the randomized Binary Search algorithm? Multiple answers:You can...

    1. Randomized Binary Search Which are true of the randomized Binary Search algorithm? Multiple answers:You can select more than one option A) It uses a Variable-Size Decrease-and-Conquer design technique B) Its average case time complexity is Θ(log n) C) Its worst case time complexity is Θ(n) D) It can be implemented iteratively or recursively E) None of the above 2. Randomized Binary Search: Example Assume you have an array, indexed from 0 to 9, with the numbers 1 4 9...

  • C programming (you don't need to write program) Problem 1 [Linear Search with Early Stop] Below...

    C programming (you don't need to write program) Problem 1 [Linear Search with Early Stop] Below you will find a linear search function with early stop. A linear search is just a naive search - you go through each of the elements of a list one by one. Early stop works only on sorted list. Early stop means, instead of going through whole list, we will stop when your number to search can no longer be possibly found in the...

  • Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface,...

    Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface, and 1024 (=2^10) sectors per track. Sector size is 2KBytes (=2^10 Bytes ). Assume the average seek time 0.02 ms, the seek time from a track to its adjacent track can be ignored. The drive rotates at 5400 rpm. Successive tracks in a cylinder can be read without head movement. Furthermore, disks can be handled independently, so multiple tracks in a cylinder can be...

  • JAVA Objectives: 1. Apply linear search algorithm 2. Apply select sort algorithm 3. Apply array iteration...

    JAVA Objectives: 1. Apply linear search algorithm 2. Apply select sort algorithm 3. Apply array iteration skill Problem description: Write the following eight methods and write a main function to test these methods // return the index of the first occurrence of key in arr // if key is not found in arra, return -1 public static int linearSearch(int arr[], int key) // sort the arr from least to largest by using select sort algorithm public stati void selectSort(int arr[])...

  • P13-1. What is the hexadecimal equivalent of the following Ethernet address? 01011010 00010001 01010101 00011000 10101010...

    P13-1. What is the hexadecimal equivalent of the following Ethernet address? 01011010 00010001 01010101 00011000 10101010 00001111 P13-6. Suppose the length of a 10Base5 cable is 2500 m. If the speed of propagation in a thick coaxial cable is 200,000,000 m/s, how long does it take for a bit to travel from the beginning to the end of the network? Assume there is a 10 μs delay in the equipment P13-7. Suppose you are to design a LAN for a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT