Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.programming.threads > #1204

Re: Now where can you use my ParallelSort library ?

From "aminer" <aminer@toto.com>
Newsgroups comp.programming.threads, comp.programming
Subject Re: Now where can you use my ParallelSort library ?
Date 2012-10-31 18:16 -0500
Organization A noiseless patient Spider
Message-ID <k6s7sb$k14$2@dont-email.me> (permalink)
References <k6s3v0$q15$1@dont-email.me>

Cross-posted to 2 groups.

Show all headers | View raw


Hello,

If you don't want to use a binary search in my previous exemple e, don't use 
it.

But in the following SQL select:

select name
from titles
where (type = 'business' or type = 'psychology')


It is better to use a binary search after you have sorted the array
with parallel sort library.

Here you can construct the titles table with Parallel hashlist(of course you 
can add
more than one table to parallel hashlist)  by copying, for exemple, the data 
from a database to the parallel hashlist's table, and after that copy this 
table to an array and after that sort the array in parallel on the type key 
with my parallel sort library ,
and after that use a binary search function to find the type that
equal 'business' or equal 'psychology' etc.

This is how you can use Parallel Sort library and Parallel Hashlist as 
in-memory database,
and of course you have to use TCP/IP to be able to use Parallel Hahslist as 
an in-memory database
server.


Amine Moulay Ramdane.



"aminer" <aminer@toto.com> wrote in message 
news:k6s3v0$q15$1@dont-email.me...
>
> Hello,
>
> Now  where can you use my ParallelSort library ?
>
> You can use it for exemple if you want to implement an in-memory database
> with my Parallel Hahslist(parallel hashtable), so if you want to do for 
> exemple
> an SQL  Select like this (or another SQL select):
>
> select  name
> from titles
> where  price  < 50
>
> You can construct the titles table withParallel hashlist(of course you can 
> add
> more than one table to parallel hashlist), and copy this table in an array 
> and
> after that sort the array in parallel on the price key with my parallel 
> sort library ,
> and after that use a binary search function to find the prices in the 
> array that are
> lower than 50.
>
> This is how you can use Parallel Sort library and Parallel Hashlist as 
> in-memory database,
> and of course you have to use TCP/IP to be able to use Parallel Hahslist 
> as an in-memory database
> server.
>
> I have exported the two functions binsearch() and binsearch1() from 
> Parallel Sort library.
>
> You can download ParallelSort library and parallel hashlist from:
>
> http://pages.videotron.com/aminer/
>
>
>
> Amine Moulay Ramdane.
>
>
>
>
>
>
>
> 

Back to comp.programming.threads | Previous | NextPrevious in thread | Next in thread | Find similar


Thread

Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:08 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:23 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:31 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:41 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 18:16 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 18:33 -0500

csiph-web