8. Assume you are working in Grameenphone, and you are asked to manage records of 70 million users by their Phone numbers. You are asked to store these numbers and perform frequent searches, insertion, and deletion on them. Each record size is about 10KB (Kilobytes). Any array in your system can hold at most 4GB (Gigabytes) of data. How would you design the data structure to hold the record? Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph and/or Hash Tables. Discuss your choice based on space and runtime complexity.

8. Assume you are working in Grameenphone, and you are asked to manage records of 70 million users by their Phone numbers. You are asked to store these numbers and perform frequent searches, insertion, and deletion on them. Each record size is about 10KB (Kilobytes). Any array in your system can hold at most 4GB (Gigabytes) of data. How would you design the data structure to hold the record? Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph and/or Hash Tables. Discuss your choice based on space and runtime complexity.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: external fragmentation is caused by anything else.

A: In this question we will understand about the external fragmentation in operating system and how it…

Q: Read question properly and give correct answer fastttt within 30 minutes.... will upvote Answer the…

A: Answer: We have explain each question in the brief. so for the more details we will see in the…

Q: How does it operate when the data is cached using a format that is entirely associative?

A: Answer When data is cached using a format that is fully associative, this mans that any cache line…

Q: Please showing working out and explaination for the following: Find types of File System Type…

A: Given,Find types of File System Type (e.g., FAT32, NFTS, EXT3 etc.)

Q: A certain computer provides its users with a virtual-memory space of 128Gigabyte bytes (128GB). The…

A: Solution:

Q: Suppose the price of memory falls by half, and the speed of disk access (number of accesses per…

A: Answer: Below is the detailed answer:

Q: What can be done about external fragmentation?

A: Fragmentation occurs when memory is broken into small sized blocks. These fragmentations are non…

Q: Explain why, from a programmer's point of view, deep access is better than shallow access, not just…

A: From a programmer's point of view deep access is often considered better than shallow access for…

Q: Take, for instance, an airline database using a technique called "snapshot isolation." If the…

A: Given: An airline database that uses "snapshot isolation" technique. Task: Evaluate if the overall…

Q: The world's first practical cipher Who was the one who initiated it? What is the significance of a…

A: GIVEN: The world's first practical cipher Who was the one who initiated it? What is the…

Q: capturing directory accesses, you are provided two bits. In what ways would you make use of the four…

A: The way we would make use of the four operations in disposal.

Q: For the SIC/XE dump A=000000 X=000005 L=000000 B=000005 S=FFFFFF T=FFFFFF P=00000D CC=LT 01A0…

A: Answer: Our instruction is answer the first three part from the first part and . I have given…

Q: For each scenario described below, discuss the algorithm and the data structure you would use to…

A: As per the given information, we need to discuss the algorithm and the data structure I would use to…

Q: Contrast the performance of the three techniques for allocating disk blocks (contiguous, linked, and…

A: 1) The allocation methods define how the files are stored in the disk blocks. 2) There are three…

Q: On a 16 GB hard disk drive (HDD), each cluster consists of 32 sectors and each sector has a fixed…

A: Given data, Text file size = 150,000 bytes Fixed size of Sector = 512 bytes Number of sectors per…

Question

8. Assume you are working in Grameenphone, and you are asked to manage records of 70 million users
by their Phone numbers. You are asked to store these numbers and perform frequent searches,
insertion, and deletion on them.
Each record size is about 10KB (Kilobytes).
Any array in your system can hold at most 4GB (Gigabytes) of data.
How would you design the data structure to hold the record?
Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph
and/or Hash Tables. Discuss your choice based on space and runtime complexity.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…
Suppose you need to store a very large number of small files, each of size say 2 kilobytes. If your choice is between a distributed file system and a distributed key-value store, which would you prefer, and explain why.
Make it clear that the values stored in the database may be changed at any time without prior notice. The creation of error-detection codes is predicated on the concept of longitudinal parity. The bit s is calculated and retained for all bits in the nth position of each byte; for all bits in the Oth position, another parity bit is computed and stored; and so on.
5.Find out how many parts are there in a floppy disk? Suppose a 3.5 inches floppy disk contained 80 tracks, each of which is divided into sectors capable of holding 512 characters. How many characters will the disk hold if each track is divided into 9 sectors? What if each track contains 18 sectors? How does these capacities compare to the size of 400-page novel in which each page contains 3500 characters?