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

Consider finding a prefix code for a file that consists of the letters a, b, c, d, and e. Suppose that these letters appear in the file with the following frequencies. f(a) = 20; f(b) = 7; f(c) = 10; f(d) = 4 and f(e) = 18: Suppose each character was represented by four binary digits before compression. What is the total number of bits utilized by the data before compression? Apply the Huffman Encoding technique to compress the data and find the total number of bit required to represent the complete file after compression. What is percentage of space saved by the compression technique?
for a given data set size of 500, the execution time is .005 micro secondes, if the size of the data grew to 10, 000 what is the execution time for the new data size if the underlying algorithm is: a) O(n) b) log2(n)
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.
Imagine you get a data set from a client that contains addresses from 150 countries all around the world and your task is to verify them, the data is stored in 3 fields – Address Line, City, ZIP code. What you also have available is address verification solution for each country, but the data set does not include the country code. Your task is to design logic that will process the data and find the country for each record, so they can be run through a validation component. Think of the most efficient way.
1. Suppose an array with six rows and eight columns is stored in a row major order starting at address 20 (base 10). If each entry in the array requires only one memory cell, what is the address on the entry in the third row and fourth columns? What if each entry requires two memory cells?
Data that has been stored in memory may be retrieved in one of two distinct ways: either sequentially or directly. Why do essential modern devices make use of direct access, and what are the advantages of doing so? How can the data that has been written on a device that only supports the sequential access technique be translated in such a way that it can be read by a device that only supports the direct access method?
me remaining: 00:09:34 Computer Science Create a MPI version of the program below that uses a striped decomposition. Each process is responsible for some number of columns of the square and also maintains two columns of ghost cells to mirror the columns on the neighboring processes. The ghost cells are needed in order to update the cells along the process boundary. At each time step, a ghost cell exchange takes place, then the update takes place. #include <stdlib.h> #include <assert.h> #include "anim.h" const int n = 200; // number of discrete points including endpoints int nstep = 200000; // number of time steps int wstep = 400; // time between writes to file const double m = 100.0; // initial temperature of rod interior const int h0 = n/2 - 2, h1 = n/2 + 2; // endpoints of heat source const double k = 0.2; // diffusivity constant char * filename = "diff2d.anim"; // name of file to create double ** u, ** u_new; // two copies of the temperature function ANIM_File…
I need the answer as soon as possible
Husin wants to process data inventory by using an array. The operations needed in this system are deleting items, adding new items, and sorting data based on the item code. However, his group member, Marzuki does not agree because using an array is not efficient. (ii) Suggest a suitable data structure which is suitable for handling this case and your reasons.
I need the answer as soon as possible
How can you design and implement an efficient algorithm for sorting a large dataset with limited memory resources? Explain the different types of sorting algorithms, including comparison-based and non-comparison-based algorithms, and their strengths and weaknesses in terms of time and space complexity. Discuss various memory management techniques, such as external sorting and memory-mapped files, that can be used to optimize the performance of the algorithm. Provide a code example in a programming language of your choice to demonstrate the effectiveness of your sorting algorithm. Finally, evaluate the performance of your algorithm using appropriate metrics and discuss potential improvements or further research directions.
Data may be accessed from memory in one of two ways: sequentially or directly. I don't see why direct access is so appealing. What are the alternatives because it is not feasible to replace a device that only permitted sequential access with one that only permitted direct access?