Founds

www/dpsearch

Maxime — Wed, 30 Jul 2008 14:42:53 +0000

FreeBSD’s port www/dpsearch has been updated to the latest version of DataparkSearch released, 4.50. Share This

Text Messaging Outrage

Maxime — Sun, 27 Jul 2008 11:18:35 +0000

My solution for the Text Messaging Outrage problem of Round 1C of Google Code Jam 2008 contest: #include <stdio.h> #include <string.h> #include <stdlib.h> typedef struct { int num; long long freq; } FREQ; int cmpF(const void *v1, const void *v2) { FREQ *e1 = (FREQ*)v1, *e2 = (FREQ*)v2; if (e1->freq < e2->freq) return 1; if (e1->freq [...]

DataparkSearch 4.50

Maxime — Sat, 26 Jul 2008 20:28:41 +0000

A new version, 4.50, of DataparkSearch Engine has been released. Changes since version 4.49 are: Default value for PopRankSkipSameSite command has been changed to “yes”. Possible memory leak has been fixed for a sub-document indexed from stored database. The strict option has been added for Section command. A word break has been added for French-style contractions. Big lists of Russian [...]

Numbers

Maxime — Sat, 26 Jul 2008 07:08:45 +0000

My solution for the Numbers problem of Round 1A of Google Code Jam 2008 contest. It works too long for Large input. #!/usr/bin/perl use Math::BigFloat; use POSIX; $N = <STDIN>; for ($iN = 0; $iN < $N; $iN++) { $n = <STDIN>; $sqfive = Math::BigFloat->new(5); $sqfive->bsqrt(); $three = [...]

Minimum Scalar Product

Maxime — Sat, 26 Jul 2008 03:35:51 +0000

My solution for the Minimum Scalar Product problem of Round 1A of Google Code Jam 2008: #include <stdio.h> #include <string.h> #include <stdlib.h> int cmpA(const void *v1, const void *v2) { int *e1 = (int*)v1, *e2 = (int*)v2; if (*e1 < *e2) return 1; if (*e1 > *e2) return -1; return 0; } int cmpB(const void *v1, const [...]

Train Timetable

Maxime — Sun, 20 Jul 2008 09:26:33 +0000

My solution for the Train Timetable task of Google Code Jam 2008 qualification round: #include <stdio.h> #include <string.h> #include <stdlib.h> typedef struct { int d[24*60]; int a[24*60]; } STATION; main () { char str[4096]; STATION A, B; int N, T, NA, NB; int i, iN; int dh, dm, ah, am; int resultA, resultB; [...]

Saving the Universe

Maxime — Sun, 20 Jul 2008 09:08:13 +0000

My solution for the Saving the Universe task of Google Code Jam 2008 qualification round: #include <stdio.h> #include <string.h> #include <stdlib.h> typedef struct { char *name; int num; } ENGINE; int cmpEngines(const void *v1, const void *v2) { ENGINE *e1 = (ENGINE*)v1, *e2 = (ENGINE*)v2; return strcmp(e1->name, e2->name); } int askEngineNum(char *name, ENGINE *base, int numb) { ENGINE [...]

DataparkSearch comparison

Maxime — Mon, 07 Jul 2008 11:21:56 +0000

A comparison between public-domain search engines (PDF, 20 pages) as of March 2006. They compare Nutch, MnoGoSearch, DataparkSearch and ht//Dig. UPDATE: There is an another comparison of DataparkSearch made in October 2007: Yury Vetrov’s blog (in Russian). They compare Sphinx, Tsearch2, DataparkSearch, MnoGoSearch and Yandex.Server (free and commercial versions). Overall weighted rating for these [...]

DataparkSearch performance

Maxime — Sun, 06 Jul 2008 07:41:11 +0000

These graph show the performance of DataparkSearch for 43N 39E search engine. 43N 39E installation consists of a SQL-server (Intel PIII 670 MHz, 512M RAM, IDE SATA) and a search server using searchd (Intel Celeron 2.25GHz, 1G RAM, IDE UDMA100). The search base has around 1.2 mln documents indexed with overall size of 27.2 Gb. NB: [...]

dpsearch-4.50-05072008

Maxime — Sat, 05 Jul 2008 17:15:22 +0000

The “strict” option has been added for the Section command. By specifying this option you can set strict string tokenization for a section, which mean a word break at any non-character symbol despite the context. This is useful, for example, in indexing of URL where hyphen character uses as delimiter between words. Section url [...]