Define properties to ensure good search performance, Operating System

Define Properties to Ensure Good Search Performance

A hashing function h should possess the subsequent properties to make sure good search performance:

a. The hashing function should not be sensitive to the symbols employed in some source program. That is it should carry out equally well for different source programs.

b. The hashing function h should execute sensibly fast.

Posted Date: 5/13/2013 2:33:31 AM | Location : United States

Related Discussions:- Define properties to ensure good search performance, Assignment Help, Ask Question on Define properties to ensure good search performance, Get Answer, Expert's Help, Define properties to ensure good search performance Discussions

Write discussion on Define properties to ensure good search performance
Your posts are moderated
Related Questions
how copy on write on pages when many process works at a same time?

Performance of Job Scheduling  Strategies In this project you will investigate the performance of Job Scheduling strategies, Memory Allocation strategies and a CPU Scheduling s

GUI - Short for Graphical User Interface a GUI Operating System contains icons and graphics and is commonly navigated by using a computer mouse. Below are some instances of GUI Op

Describe the technique of packing. The physical record size will not accurately match the length of the desired logical record and the Logical records may even differ in length

what is a batch system give me answer in simple words so that i can understand

What is long-term, medium-term, short-term? In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage

To evade race condition, the maximum number of processes that may be at the same time inside the critical section is The maximum number of processes which may be at the same t

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block