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

Similar questions

Suppose that you need to maintain a collection of data whose contents are fixed; you need to search for and retrieve existing items but never need to add or delete items . You may assume that data can fit in the computer's memory. What data structure is the most efficient one to use for this task ? Explain your answer?
Imagine a group of data you would like to put in a computer so it could be accessed and manipulated. For example, if you collect old comic books, you might want to catalog them so you could search for a particular author or a specific date. Design your own group of data and how these data can be manipulated.
Suppose a file with 65536 records is organized using multi-level indexing as the file is ordered on a non-key field. Each record is 48 bytes long and the size of its key field is 4 bytes. The indexing is built on the key field of the file. The size of the disk block is 2 KB, and the block pointer size is 12 bytes. The file organization is unspanned. How many blocks will be required for the inner and outer index respectively in a multi-level index? 512 and 2 b) 512 and 4 e) 1024 and 4 d) 1024 and 8
JSON and CSV are both text-based formats for the storage of data. It's possible to open either one in a plain text editor. Given this similarity, why does a CSV file usually take less memory than a JSON formatted file for the same data? Under what conditions could a JSON file be smaller in memory than a cSV file for the same data?
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectively
What's the dissimilarity between cloning and copying when it comes to data sets?
What is the difference between cloning and copying when it comes to data sets?
In the variable-length record format, a null bitmap is used whenever it is necessary to demonstrate that an attribute does not contain any data. Under certain peculiar circumstances, the vast majority of a tuple's attributes are represented by the value null. It is possible to cut the cost of a null attribute down to just one bit by modifying the method in which entries are stored in a database.
Data fragmentation may be defined in a number of different ways. Does "data fragmentation" suggest anything to you?
There are many ways to explain what it means to say "data fragmentation." What do you think of when you hear the word "data fragmentation"?
The term "data fragmentation" begs the question: what exactly does it mean? When we state that the data are fragmented, what exactly does it imply?
Suppose you need to sort a relation of 40 gigabytes, with 4-kilobyte blocks,using a memory size of 40 megabytes. Suppose the cost of a seek is 5 milliseconds, while the disk transfer rate is 40 megabytes per second. Suppose a flash storage device is used instead of a disk, and it has a latency of 20 microsecond and a transfer rate of 400 megabytes per second. Recompute the cost of sorting the relation, in seconds, with bb = 1 and with bb = 100, in this setting.