Purchase Solution

Median Finding Algorithm for Joint Databases

Not what you're looking for?

Ask Custom Question

You are interested in analyzing some hard to obtain data from two separate databases. Each database contains n numerical values - so there are 2n values total- and you may assume that no two values are the same. You'd like to determine the median of this set of 2n values, which we will define here to be the nth smallest value.

However, the only way you can access these values is through queries to the databases. In a single query you can specify a value k to one of the two databases and the chose database will return the k-th smallest value that it contains.
Since queries are expensive you would like to compute the median using as few queries as possible. Give an algorithm that fins the median value using at most O(logn) queries.

Purchase this Solution
Solution Summary

The median finding algorithm for joint databases are examined.

Purchase this Solution
Free BrainMass Quizzes
Javscript Basics

Quiz on basics of javascript programming language.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Basic Networking Questions

This quiz consists of some basic networking questions.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

View More Free Quizzes
Related BrainMass Solutions

  • Algorithm to find majority element

    So use the average-time RANDOMIZED-SELECT algorithm (RANDOMIZED-SELECT finds any ith order statistic in linear time, and the median is simply the "middle" order statistic) to find a candidate majority element(i.e. the median) M, the test if it really

  • Merging Customer Databases

    541025 Merging Customer Databases Imagine you are responsible for merging the customer databases of the partners of a joint venture into a single database to be used solely by the joint venture.

  • Sorting Algorithms Comparison

    Selection sort also requires only n swaps, and hence just Θ(n) memory writes, which is optimal for any sorting algorithm.

  • Algorithm analysis for N elements

    For i=0; i<5; i++ Do // Find the median of 5 groups and set to median array median[i] = select(subarray[i]); 9. EndFor 10. return select(median); // Return median of medians.

  • Algorithm: Divide a group of people into two disjoint subgroups.

    Use an efficient sorting algorithm to sort the group of people on the base of their ages for instance in ascending order. Qsort algorithm requires Θ(n log n) comparisons.

  • Explanation of how to make an algorithm more efficient

    This solution takes an n-squared algorithm for finding the two closest elements in an array and shows how that algorithm can be converted to a much faster algorithm.

  • Numerical Representation & Errors - Write Effective Algorithm

    This double series converges slowly, and it contains many small terms whose joint effect may be big. Your task is to write an effective algorithm to calculate the values of w(p,s) for any given {see attachment} Thanks for your help!

  • Design an algorithm

    Design an algorithm for finding two closest numbers in the input list. What is the time complexity? Is it possible to improve the algorithm if the input is a sorted list?

  • Euclidean Algorithm : Finding the Greatest Common Divisor

    11579 Euclidean Algorithm : Finding the Greatest Common Divisor Use the euclidean algorithm to find the greatest common divisor of 981 and 1234. Please see the attached file for the complete solution. Thanks for using BrainMass.

View More Related Solutions