Search on a heap file, Data Structure & Algorithms

Assignment Help:

Consider the file "search_2013". This is a text file containingsearch key values; each entry is a particular ID (in the schema given above). You are tosimulate searching over a heap file, with different assumptions for the size of file pages.Write a program to perform equality search operations. The executable name of this program must be sHeap and it mustbe able to be executed using the command:

> ./sHeap search_2013 heap pagesize

where search_2013 is the name of the file containing the keys to be searched for; heap is theoutput file of your wHeap program; and pagesize is an integer value that specifies the size ofthe disk page that you are simulating.

Your program should read in the file, one "page" at a time. For example, if the pagesize

parameter is 100, your program should read in the first 100 records from disk. These can thenbe scanned, in-memory, for a match. If a match is found, print the matching record to stdout.You should assume that ID is a primary key. If no match is found, read in the next pagesizerecords of the file. The process should continue until either a matching record is found, or thereare no more records in the file to process.

If a match is found, the program must print the matching record to stdout. If no match is

found, a suitable message should be printed. In addition, the program must always output thetotal time taken to do all the search operations in milliseconds to stdout. For example, if thetime taken to do the reading is 123:45 ms, the output would be:Time: 123.45 ms


Related Discussions:- Search on a heap file

Branch and Bound method, give some examples of least cost branch and bound ...

give some examples of least cost branch and bound method..

Types of triangular matrices, Triangular Matrices Tiangular Matrices is...

Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

What is gouraud shading, Gouraud Shading The faceted appearance of a La...

Gouraud Shading The faceted appearance of a Lambert shaded model is due to each polygon having only a single colour. To avoid this effect, it is necessary to vary the colour ac

Deletion of any element from the circular queue, Algorithm for deletion of ...

Algorithm for deletion of any element from the circular queue: Step-1: If queue is empty then say "queue is empty" & quit; else continue Step-2: Delete the "front" element

Explain th term input and output- pseudocode, Explain th term input and ou...

Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

Generic doubly linked list, Your objective is to write a generic doubly lin...

Your objective is to write a generic doubly linked list class called CS228LinkedList that implements the List interface and uses a type variable T. All methods except for subList a

Circularly linked lists implementation, CIRCULARLY LINKED LISTS IMPLEMENTAT...

CIRCULARLY LINKED LISTS IMPLEMENTATION A linked list wherein the last element points to the first element is called as CIRCULAR linked list. The chains do not specified first o

Difference between prism''s and kruskal''s algorithm, Difference among Pris...

Difference among Prism's and Kruskal's Algorithm In Kruskal's algorithm, the set A is a forest. The safe edge added to A is always a least-weight edge in the paragraph that lin

Design the system for seller, Your program should include three components ...

Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each comp

Algorithms, Data array A has data series from 1,000,000 to 1 with step size...

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd