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

Define binary search technique, Binary search technique:-  This techniq...

Binary search technique:-  This technique is applied to an ordered list where elements are arranged either in ascending order or descending order. The array is separated into t

Programme in c to create a single linked list, Q. Write  down a   p...

Q. Write  down a   programme  in  C  to  create  a  single  linked  list also  write the functions to do the following operations (i)  To insert a new node at the end (ii

Tower of hanoi, how do we use 4-discs stack to solve tower of hanoi problem...

how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

Find longest repeat prefix of string - linear time algorithm, 1. A string s...

1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand

Problem logicall, Given a list containing Province, CustomerName and SalesV...

Given a list containing Province, CustomerName and SalesValue (sorted by Province and CustomerName), describe an algorithm you could use that would output each CustomerName and Sal

Define ordinary variable, Ordinary variable An ordinary variable of a e...

Ordinary variable An ordinary variable of a easy data type can store a one element only

Program of insertion of an element in list, Program will demonstrate the in...

Program will demonstrate the insertion of an element at desired position /* Inserting an element into contiguous list (Linear Array) at particular position */ /* contiguous_

Define tree ?, A tree is a non-empty set one component of which is designat...

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ...

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

State algorithm to insert node p at the end of a linked list, Algo rithm t...

Algo rithm to Insert a Node p at the End of a Linked List is explained below Step1:   [check for space] If new1= NULL output "OVERFLOW" And exit Step2:   [Allocate fr

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