developers-list August 2012

developers-list@monetdb.org

9 participants
11 discussions

[Monetdb-developers] error: not protecting function: no buffer at least 8 bytes long

by Tapomay Dey

Hi, I have checked out the july branch. I do bootstrap - > configure -> make make throws following error: cc1: warnings being treated as errors inet.c: In function ‘INET_comp_CW’: inet.c:323: error: not protecting function: no buffer at least 8 bytes long inet.c: In function ‘INETbroadcast’: inet.c:423: error: not protecting function: no buffer at least 8 bytes long inet.c: In function ‘INETnetmask’: inet.c:523: error: not protecting function: no buffer at least 8 bytes long inet.c: In function ‘INETnetwork’: inet.c:593: error: not protecting function: no buffer at least 8 bytes long inet.c: In function ‘INETabbrev’: inet.c:660: error: not protecting function: no buffer at least 8 bytes long make[7]: * [libatoms_la-inet.lo] Error 1 HELP!!! I am using the following hack as of now: Is it a good idea to go to the given locations and change the 4 -size arrays to 8-size.? Regards, Tapomay

9 years, 11 months

[Monetdb-developers] Migration DW to MonetDB

by R＠quel

Hi, I have a question, i need comparison the execution query times between MonetDB and SQL 2008 in Data Warehouse (applying a different orientations database systems). But i have a problem, i used the AdventureWorkR2 2008 but i don't know how i can migrate the information to MonetDB. To compare the same data. Someone help me? Please. It's very important. Thanks, Raquel -- View this message in context: http://old.nabble.com/Migration-DW-to-MonetDB-tp34348185p34348185.html Sent from the monetdb-developers mailing list archive at Nabble.com.

9 years, 11 months

Re: [Monetdb-developers] MonetDB: Jul2012 - Only print runtimeTiming information when in ...

by Stefan Manegold

THANKS!!! ;-) S. -- | Stefan.Manegold @ CWI.nl | DB Architectures (INS1) | | http://CWI.nl/~manegold/ | Science Park 123 (L321) | | Tel.: +31 (0)20 592-4212 | 1098 XG Amsterdam (NL) | ----- Reply message ----- From: "Sjoerd Mullender" <sjoerd(a)acm.org> To: <checkin-list(a)monetdb.org> Subject: MonetDB: Jul2012 - Only print runtimeTiming information when in ... Date: Fri, Aug 24, 2012 17:09 Changeset: 0901d759538f for MonetDB URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=0901d759538f Modified Files: monetdb5/mal/mal_runtime.c Branch: Jul2012 Log Message: Only print runtimeTiming information when in the (mdb) debugger. This fixes bugs 3117 and 3145. diffs (12 lines): diff --git a/monetdb5/mal/mal_runtime.c b/monetdb5/mal/mal_runtime.c --- a/monetdb5/mal/mal_runtime.c +++ b/monetdb5/mal/mal_runtime.c @@ -102,7 +102,7 @@ void runtimeTiming(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci, int tid , MT_Lock *lock, RuntimeProfile prof) { str line; - if( cntxt->flags && stk->cmd != 't' && stk->cmd != 'C'){ + if( cntxt->flags && stk->cmd != '\0' && stk->cmd != 't' && stk->cmd != 'C'){ if (lock) MT_lock_set(&*lock, "timing"); mnstr_printf(cntxt->fdout,"= "); /* single column rendering */ _______________________________________________ Checkin-list mailing list Checkin-list(a)monetdb.org http://mail.monetdb.org/mailman/listinfo/checkin-list

9 years, 11 months

[Monetdb-developers] MonetDB manager for Python

by Gijs Molenaar

Hi MonetDB People, We currently want to manage (create, start, release, etc) MonetDB databases from Python. What do you people think if I make a (thin) wrapper around the 'monetdb' command as a python module (monetdb.manage) and commit this to default? greetings, -- Gijs Molenaar http://www.astro.uva.nl/people/gijs-molenaar/

9 years, 11 months

[Monetdb-developers] Problems compiling MonetDB-11.11.5 on SuSE SLES-11 SP2

by Jukka Santala

SuSE Linux Enterprise Server 11 SP2, release in March. As already covered on the bug-tracker etc. old bison won't work, so I had to install latest version, 2.6.2 to build. After that: make[5]: Entering directory `/opt/MonetDB/MonetDB-11.11.5/sql/server' /bin/sh ../../libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -I../.. -I. -I../include -I./../include -I../common -I./../common -I../storage -I./../storage -I../../clients/mapilib -I./../../clients/mapilib -I../../common/options -I./../../common/options -I../../common/stream -I./../../common/stream -I../../gdk -I./../../gdk -DLIBSQLSERVER -g -O2 -c -o libsqlserver_la-sql_scan.lo `test -f 'sql_scan.c' || echo './'`sql_scan.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -I../.. -I. -I../include -I./../include -I../common -I./../common -I../storage -I./../storage -I../../clients/mapilib -I./../../clients/mapilib -I../../common/options -I./../../common/options -I../../common/stream -I./../../common/stream -I../../gdk -I./../../gdk -DLIBSQLSERVER -g -O2 -c sql_scan.c -fPIC -DPIC -o .libs/libsqlserver_la-sql_scan.o In file included from sql_semantic.h:27, from sql_scan.c:29: sql_parser.h:191: error: conflicting types for 'sqlparse' y.tab.h:678: error: previous declaration of 'sqlparse' was here No idea how to properly fix that, but added "#define YYPARSE_PARAM parm" at the front of sql_scan.c, which forces the prototype to retain the parameter. Next problem, HowToStart.rst states: "Then in any directory (preferably a *new, empty* directory and *not* in the ``MonetDB`` top-level directory) give the command:: .../configure [<options>]", which is indeed recommended practice. Unfortunately, nobody has apparently ever done this. If configure and make are ran in a different directory from the source root, "make check" will fail to find monetdb5/modules/mal/mal_init.mal and who knows what else, giving long time of head-scratching. After re-doing configure and make in the prohibited directory, make check will report: . opt_sql_append : Crashed! * (opt_sql_append.test.out.FILTERED) significantly * (opt_sql_append.test.err.FILTERED) significantly ....................................................................................................................................................................................................................................... * (recycle04.test.out.FILTERED) significantly ........................................................................................................................................................................................................................................................................... !ERROR: Testing FAILED SIGNIFICANTLY (2 out of 499 tests failed) 1 out of 499 tests resulted in a crash extras/mal_optimizer_template/opt_sql_append 1 out of 499 tests produced SIGNIFICANTLY different output mal/recycle04 To be frank, that sounds "significantly" like something translated by Google translator to/from some lesser known language. No idea what it's trying to tell me, or how to proceed from there. Can't find any Google search hits on the problems either. Suggestions? -Jukka Santala

9 years, 11 months

[Monetdb-developers] Announcement: New Jul2012-SP1 Bugfix release of MonetDB suite

by Sjoerd Mullender

The MonetDB team at CWI/MonetDB BV is pleased to announce the Jul2012-SP1 bugfix release of the MonetDB suite of programs. More information about MonetDB can be found on our website at <http://www.monetdb.org/>. For details on this release, please see the release notes at <http://www.monetdb.org/Downloads/ReleaseNotes>. As usual, the download location is <http://dev.monetdb.org/downloads/>. Jul 2012-SP1 bugfix release Java Module * Fixed adaptive cache size used when retrieving results, not to cause divide by zero errors when memory gets short, bug #3119. Client Package * mclient no longer prints the SQLSTATE at the start of each error returned by the SQL-server. MonetDB5 Server * The server now distinguishes between starting and started states, such that monetdbd can wait for it to finish starting. Merovingian * Starting a server now waits for as long as the server needs to possibly recover, bug #3134. In case of a long wait, the monetdbd logfile gives extra information on what the server is doing to recover. * Fixed a crash of monetdbd when local databases were unshared, bug #3135 * Resolved a problem where automatic starting of a database initiated by multiple clients at the same time could cause failed starts. Bug #3107 Bug Fixes * 3075: inconsistent declaration of algebra.markH with 3 input arguments * 3090: crashed if using single identifier for where condition * 3093: sql fail if use scalar subquery with alias * 3107: concurrent connections to the same stopped database yield in multiple mserver5 starts by monetdbd * 3119: MonetConnection$ResultSetResponse throws java.lang.ArithmeticException: divide by zero * 3132: test/BugTracker-2011/func_iter_vs_bulk.Bug-2826 fails * 3134: Database gets killed by timeout during startup * 3135: monetdbd crash while creating & loading database

9 years, 11 months

Re: [Monetdb-developers] MonetDB: default - Implemented another trivial case for grouping...

by Stefan Manegold

;-) Dank je wel! --- Niet alleen voor deze, maar met naam ook voor de hele nieuwe group-by code en al die andere nieuwe schone code!!! Stefan On Tue, Aug 21, 2012 at 12:43:42PM +0200, Sjoerd Mullender wrote: > Changeset: 6f001c03cd8d for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=6f001c03cd8d > Modified Files: > gdk/gdk_group.c > Branch: default > Log Message: > > Implemented another trivial case for grouping: all equal values. > > > diffs (122 lines): > > diff --git a/gdk/gdk_group.c b/gdk/gdk_group.c > --- a/gdk/gdk_group.c > +++ b/gdk/gdk_group.c > @@ -44,11 +44,14 @@ > * is always created. In other words, the groups argument may not be > * NULL, but the extents and histo arguments may be NULL. > * > - * There are five different implementations of the grouping code. > + * There are six different implementations of the grouping code. > * > * If it can be trivially determined that all groups are singletons, > * we can produce the outputs trivially. > * > + * If all values in b are known to be equal (both sorted and reverse > + * sorted), we produce a single group or copy the input group. > + * > * If the input bats b and g are sorted, or if the subsorted flag is > * set (only used by BATsubsort), we only need to compare consecutive > * values. > @@ -102,6 +105,7 @@ BATgroup_internal(BAT **groups, BAT **ex > > if (b->tkey || BATcount(b) <= 1 || (g && (g->tkey || BATtdense(g)))) { > /* grouping is trivial: 1 element per group */ > + ALGODEBUG fprintf(stderr, "#BATgroup: trivial case: 1 element per group\n"); > if (BATcount(b) == 1 && b->htype == TYPE_oid) > ngrp = * (oid *) Hloc(b, BUNfirst(b)); > else > @@ -132,6 +136,62 @@ BATgroup_internal(BAT **groups, BAT **ex > } > return GDK_SUCCEED; > } > + if (b->tsorted && b->trevsorted) { > + /* all values are equal */ > + if (g == NULL) { > + /* there's only a single group: 0 */ > + ALGODEBUG fprintf(stderr, "#BATgroup: trivial case: single output group\n"); > + ngrp = 0; > + gn = BATconstant(TYPE_oid, &ngrp, BATcount(b)); > + if (gn == NULL) > + goto error; > + BATseqbase(gn, b->hseqbase); > + *groups = gn; > + if (extents) { > + ngrp = gn->hseqbase; > + en = BATconstant(TYPE_void, &ngrp, 1); > + if (en == NULL) > + goto error; > + BATseqbase(BATmirror(en), ngrp); > + *extents = en; > + } > + if (histo) { > + wrd cnt = (wrd) BATcount(b); > + > + hn = BATconstant(TYPE_wrd, &cnt, 1); > + if (hn == NULL) > + goto error; > + *histo = hn; > + } > + return GDK_SUCCEED; > + } > + if ((extents == NULL) == (e == NULL) && > + (histo == NULL) == (h == NULL)) { > + /* inherit given grouping; note that if > + * extents/histo is to be returned, we need > + * e/h available in order to copy them, > + * otherwise we will need to calculate them > + * which we will do using the "normal" case */ > + ALGODEBUG fprintf(stderr, "#BATgroup: trivial case: copy input groups\n"); > + gn = BATcopy(g, g->htype, g->ttype, 0); > + if (gn == NULL) > + goto error; > + *groups = gn; > + if (extents) { > + en = BATcopy(e, e->htype, e->ttype, 0); > + if (en == NULL) > + goto error; > + *extents = en; > + } > + if (histo) { > + hn = BATcopy(h, h->htype, h->ttype, 0); > + if (hn == NULL) > + goto error; > + *histo = hn; > + } > + return GDK_SUCCEED; > + } > + } > assert(g == NULL || !BATtdense(g)); /* i.e. g->ttype == TYPE_oid */ > bi = bat_iterator(b); > cmp = BATatoms[b->ttype].atomCmp; > @@ -167,6 +227,7 @@ BATgroup_internal(BAT **groups, BAT **ex > (g == NULL || g->tsorted || g->trevsorted)) || > subsorted) { > /* we only need to compare each entry with the previous */ > + ALGODEBUG fprintf(stderr, "#BATgroup: compare consecutive values\n"); > if (grps) > prev = *grps++; > pv = BUNtail(bi, BUNfirst(b)); > @@ -220,6 +281,7 @@ BATgroup_internal(BAT **groups, BAT **ex > /* for each value, we need to scan all previous equal > * values (a consecutive, possibly empty, range) to > * see if we can find one in the same old group */ > + ALGODEBUG fprintf(stderr, "#BATgroup: subscan old groups\n"); > pv = BUNtail(bi, BUNfirst(b)); > ngrps[0] = ngrp; > if (extents) > @@ -284,6 +346,7 @@ BATgroup_internal(BAT **groups, BAT **ex > } > } else if (b->T->hash) { > /* we already have a hash table on b */ > + ALGODEBUG fprintf(stderr, "#BATgroup: use existing hash table\n"); > hs = b->T->hash; > for (r = BUNfirst(b), p = r, q = r + BATcount(b); p < q; p++) { > v = BUNtail(bi, p); > @@ -343,6 +406,7 @@ BATgroup_internal(BAT **groups, BAT **ex > * build an incomplete hash table on the fly--also see > * BATassertHeadProps and BATderiveHeadProps for > * similar code */ > + ALGODEBUG fprintf(stderr, "#BATgroup: create partial hash table\n"); > nme = BBP_physical(b->batCacheid); > nmelen = strlen(nme); > if ((hp = GDKzalloc(sizeof(Heap))) == NULL || > _______________________________________________ > Checkin-list mailing list > Checkin-list(a)monetdb.org > http://mail.monetdb.org/mailman/listinfo/checkin-list > -- | Stefan.Manegold @ CWI.nl | DB Architectures (INS1) | | http://CWI.nl/~manegold/ | Science Park 123 (L321) | | Tel.: +31 (0)20 592-4212 | 1098 XG Amsterdam (NL) |

9 years, 11 months

Re: [Monetdb-developers] MonetDB: default - Hack to circumvent SQL implementation issue

by Stefan Manegold

If you consider this a bug, please report ;-) Thanks! Stefan On Thu, Aug 16, 2012 at 10:46:53AM +0200, Martin Kersten wrote: > Changeset: 9e78eccb3fb3 for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=9e78eccb3fb3 > Modified Files: > sql/backends/monet5/datacell/Tests/dctemper00.sql > sql/backends/monet5/datacell/emitter.c > sql/backends/monet5/datacell/receptor.c > Branch: default > Log Message: > > Hack to circumvent SQL implementation issue > The SQL procedural code can not properly handle the > case where an attribute of a select is also part of > the target table. > > > diffs (52 lines): > > diff --git a/sql/backends/monet5/datacell/Tests/dctemper00.sql b/sql/backends/monet5/datacell/Tests/dctemper00.sql > --- a/sql/backends/monet5/datacell/Tests/dctemper00.sql > +++ b/sql/backends/monet5/datacell/Tests/dctemper00.sql > @@ -12,7 +12,7 @@ create table datacell.temperature( > tmp decimal(4,2) > ); > > -create table datacell.warnings (msg string, ts time with time zone, location string); > +create table datacell.warnings (msg string, ts time with time zone, loc string); > create table datacell.templog( ts timestamp with time zone, cnt integer); > > call datacell.receptor('datacell.temperature','localhost',50550); > diff --git a/sql/backends/monet5/datacell/emitter.c b/sql/backends/monet5/datacell/emitter.c > --- a/sql/backends/monet5/datacell/emitter.c > +++ b/sql/backends/monet5/datacell/emitter.c > @@ -35,7 +35,7 @@ > #include "dcsocket.h" > #include "stream_socket.h" > > -#define _DEBUG_EMITTER_ > +/* #define _DEBUG_EMITTER_ */ > > static Emitter emAnchor = NULL; > > @@ -105,7 +105,6 @@ EMemitterStartInternal(int *ret, str *tb > em->delay = delay; > em->lastseen = *timestamp_nil; > /* > - * @- > * All tables are prepended with a default tick bat. > * It becomes the synchronization handle. > */ > diff --git a/sql/backends/monet5/datacell/receptor.c b/sql/backends/monet5/datacell/receptor.c > --- a/sql/backends/monet5/datacell/receptor.c > +++ b/sql/backends/monet5/datacell/receptor.c > @@ -41,7 +41,7 @@ > #include "stream_socket.h" > #include "mal_builder.h" > > -#define _DEBUG_RECEPTOR_ > +/* #define _DEBUG_RECEPTOR_ */ > > /* default settings */ > #define RCHOST "localhost" > @@ -495,7 +495,6 @@ parse: > #endif > } > /* > - * @- > * A short cut is to generate the events based upon the interpretation > * of a scenario file. Much like the one used in the sensor. > * It is processed multiple times. The header is the delay imposed. > _______________________________________________ > Checkin-list mailing list > Checkin-list(a)monetdb.org > http://mail.monetdb.org/mailman/listinfo/checkin-list > > -- | Stefan.Manegold @ CWI.nl | DB Architectures (INS1) | | http://CWI.nl/~manegold/ | Science Park 123 (L321) | | Tel.: +31 (0)20 592-4212 | 1098 XG Amsterdam (NL) |

9 years, 11 months

[Monetdb-developers] New Oct2012 stable branch created

by Sjoerd Mullender

I have created a new stable branch for the next feature release. This branch was created in order to stabilize the code before the feature release. From now on *only* bug fixes may go to this new stable branch. I reserve the right to undo any changes that do not comply with this rule. I also reserve the right to admit changes that are not strictly bug fixes. The name for the branch is Oct2012. So in each of your stable checkout directories you can do hg pull hg update -rOct2012 to update to this new branch. -- Sjoerd Mullender

9 years, 11 months

Re: [Monetdb-developers] MonetDB: default - Removed histogram module: it's not even compi...

by Martin Kersten

Correct. It was an utility for the sample based bulk-loader, which never materialized. On 8/9/12 2:56 PM, Sjoerd Mullender wrote: > Changeset: 22072dd26a9c for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=22072dd26a9c > Removed Files: > monetdb5/modules/mal/histogram.c > monetdb5/modules/mal/histogram.h > monetdb5/modules/mal/histogram.mal > Modified Files: > monetdb5/modules/mal/Makefile.ag > Branch: default > Log Message: > > Removed histogram module: it's not even compiled, let alone used. > > > diffs (truncated from 606 to 300 lines): > > diff --git a/monetdb5/modules/mal/Makefile.ag b/monetdb5/modules/mal/Makefile.ag > --- a/monetdb5/modules/mal/Makefile.ag > +++ b/monetdb5/modules/mal/Makefile.ag > @@ -39,7 +39,6 @@ lib_mal = { > factories.c factories.h \ > groupby.c groupby.h \ > groups.c groups.h \ > - histogram.h \ > inspect.c inspect.h \ > iterator.c iterator.h \ > joinpath.c joinpath.h \ > @@ -83,6 +82,6 @@ headers_mal = { > calc.mal batcalc.mal > } > > -EXTRA_DIST = attach.mal batExtensions.mal iterator.mal constraints.mal groupby.mal histogram.mal mal_init.mal manual.mal mkey.mal pcre.mal profiler.mal recycle.mal remote.mal sabaoth.mal trader.mal transaction.mal txtsim.mal tablet.mal tablet.h sample.mal mal_mapi.mal mat.mal tokenizer.mal pqueue.mal calc.mal batcalc.mal > +EXTRA_DIST = attach.mal batExtensions.mal iterator.mal constraints.mal groupby.mal mal_init.mal manual.mal mkey.mal pcre.mal profiler.mal recycle.mal remote.mal sabaoth.mal trader.mal transaction.mal txtsim.mal tablet.mal tablet.h sample.mal mal_mapi.mal mat.mal tokenizer.mal pqueue.mal calc.mal batcalc.mal > > EXTRA_DIST_DIR = Tests > diff --git a/monetdb5/modules/mal/histogram.c b/monetdb5/modules/mal/histogram.c > deleted file mode 100644 > --- a/monetdb5/modules/mal/histogram.c > +++ /dev/null > @@ -1,470 +0,0 @@ > -/* > - * The contents of this file are subject to the MonetDB Public License > - * Version 1.1 (the "License"); you may not use this file except in > - * compliance with the License. You may obtain a copy of the License at > - * http://www.monetdb.org/Legal/MonetDBLicense > - * > - * Software distributed under the License is distributed on an "AS IS" > - * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the > - * License for the specific language governing rights and limitations > - * under the License. > - * > - * The Original Code is the MonetDB Database System. > - * > - * The Initial Developer of the Original Code is CWI. > - * Portions created by CWI are Copyright (C) 1997-July 2008 CWI. > - * Copyright August 2008-2012 MonetDB B.V. > - * All Rights Reserved. > - */ > - > -/* > - * @f histogram > - * @a Martin Kersten, Stratos Idreos > - * @v 1 > - * @+ Histogram > - * This support module is geared at handling small equi-bin histograms. > - */ > -/* > - * @- > - */ > -#include "monetdb_config.h" > -#include "histogram.h" > - > -Histogram > -HSTnew(int bins, ValPtr minval, ValPtr maxval) > -{ > - Histogram h; > - int i=0; > - > - assert( minval && maxval); > - assert( minval->vtype == maxval->vtype); > - assert( bins > 0); > - > - h = (Histogram) GDKzalloc(sizeof(*h) + sizeof(dbl) * 2 * bins); > - h->low = *minval; > - h->hgh = h->inc = *maxval; > - h->bins = bins; > - h->total = 0; > - for ( i = 0; i < 2*h->bins; i++) > - h->cnt[i]=0; > - > - switch( minval->vtype){ > - case TYPE_bte: > - h->inc.val.btval = (maxval->val.btval - minval->val.btval)/ bins + 1; > - assert(h->inc.val.btval); > - break; > - case TYPE_sht: > - h->inc.val.shval = (maxval->val.shval - minval->val.shval)/ bins + 1; > - assert(h->inc.val.shval); > - break; > - case TYPE_int: > - h->inc.val.ival = (maxval->val.ival - minval->val.ival)/ bins + 1; > - assert(h->inc.val.ival); > - break; > - case TYPE_lng: > - h->inc.val.lval = (maxval->val.lval - minval->val.lval)/ bins + 1; > - assert(h->inc.val.lval); > - break; > - case TYPE_dbl: > - h->inc.val.dval = (maxval->val.dval - minval->val.dval)/ bins + 1; > - assert(h->inc.val.dval); > - break; > - case TYPE_flt: > - h->inc.val.fval = (maxval->val.fval - minval->val.fval)/ bins + 1; > - assert(h->inc.val.fval); > - } > - return h; > -} > - > -/*get the bin we would increment if we would add this value*/ > -int > -HSTgetIndex(Histogram h, ValPtr val){ > - int index =0; > - switch( val->vtype){ > - case TYPE_bte: > - if (val->val.btval > h->hgh.val.btval) > - index= (h->hgh.val.btval - h->low.val.btval) / h->inc.val.btval; > - else > - index= (val->val.btval - h->low.val.btval) / h->inc.val.btval; > - break; > - case TYPE_sht: > - if (val->val.shval > h->hgh.val.shval) > - index= (h->hgh.val.shval - h->low.val.shval) / h->inc.val.shval; > - else > - index= (val->val.shval - h->low.val.shval) / h->inc.val.shval; > - break; > - case TYPE_int: > - if (val->val.ival > h->hgh.val.ival) > - index= (h->hgh.val.ival - h->low.val.ival) / h->inc.val.ival; > - else > - index= (val->val.ival - h->low.val.ival) / h->inc.val.ival; > - break; > - case TYPE_lng: > - if (val->val.lval > h->hgh.val.lval) > - index= (int) ((h->hgh.val.lval - h->low.val.lval) / h->inc.val.lval); > - else > - index= (int) ((val->val.lval - h->low.val.lval) / h->inc.val.lval); > - break; > - case TYPE_dbl: > - if (val->val.dval > h->hgh.val.dval) > - index= (int) ((h->hgh.val.dval - h->low.val.dval) / h->inc.val.dval); > - else > - index= (int) ((val->val.dval - h->low.val.dval) / h->inc.val.dval); > - break; > - case TYPE_flt: > - if (val->val.fval > h->hgh.val.fval) > - index= (int) ((h->hgh.val.fval - h->low.val.fval) / h->inc.val.fval); > - else > - index= (int) ((val->val.fval - h->low.val.fval) / h->inc.val.fval); > - break; > - } > - return index; > -} > - > -int > -HSTincrement(Histogram h, ValPtr val){ > - int index = HSTgetIndex(h,val); > - h->cnt[index]++; > - h->total++; > - h->cnt[h->bins+index]=h->cnt[index]/h->total; > - return index; > -} > - > -void > -HSTdecrement(Histogram h, ValPtr val){ > - int index = HSTgetIndex(h,val); > - h->cnt[index]--; > - h->total--; > - h->cnt[h->bins+index]=h->cnt[index]/h->total; > -} > - > -dbl > -HSTeuclidian(Histogram h1, Histogram h2){ > - dbl sum= 0; > - int i; > - assert(h1->bins == h2->bins); > - for ( i = 0; i < h1->bins; i++) > - sum += (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - return sqrt((double) sum); > -} > - > - > -/* if 1 then adding this value to h2 increases the distance between h1-h2*/ > -int > -HSTeuclidianWhatIf(Histogram h1, Histogram h2, ValPtr val){ > - dbl sum= 0, sumWhatIf=0, cur; > - dbl distance, distanceWhatIf; > - int i, affectedBin; > - assert(h1->bins == h2->bins); > - > - affectedBin = HSTgetIndex(h2,val); > - > - for ( i = 0; i < h1->bins; i++){ > - cur = (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - sum += cur; > - if (i==affectedBin) > - sumWhatIf += (h1->cnt[i] - (h2->cnt[i]+1)) * (h1->cnt[i] - (h2->cnt[i]+1)); > - else > - sumWhatIf += cur; > - } > - > - distance = sqrt((double) sum); > - distanceWhatIf = sqrt((double) sumWhatIf); > - if (distanceWhatIf > distance) return 1; > - return 0; > -} > - > -/* if 1 then moving this value to h2 increases the distance between h1-h2*/ > -int > -HSTeuclidianWhatIfMove(Histogram h1, Histogram h2, ValPtr val){ > - dbl sum= 0, sumWhatIf=0, cur; > - dbl distance, distanceWhatIf; > - int i, affectedBin; > - assert(h1->bins == h2->bins); > - > - affectedBin = HSTgetIndex(h1,val); > - > - for ( i = 0; i < h1->bins; i++){ > - cur = (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - sum += cur; > - if (i==affectedBin) > - sumWhatIf += ((h1->cnt[i]-1) - (h2->cnt[i]+1)) * ((h1->cnt[i]-1) - (h2->cnt[i]+1)); > - else > - sumWhatIf += cur; > - } > - > - distance = sqrt((double) sum); > - distanceWhatIf = sqrt((double) sumWhatIf); > - if (distanceWhatIf > distance) return 1; > - return 0; > -} > - > -dbl > -HSTeuclidianNorm(Histogram h1, Histogram h2){ > - dbl sum= 0; > - int i; > - assert(h1->bins == h2->bins); > - for ( i = h1->bins; i < 2*h1->bins; i++) > - sum += (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - return sqrt((double) sum); > -} > - > -dbl > -HSTeuclidianNormWhatIf(Histogram h1, Histogram h2, ValPtr val, dbl *whatIfDistance){ > - dbl sum= 0, sumWhatIf=0, cur; > - dbl distance, distanceWhatIf; > - int i, affectedBin; > - assert(h1->bins == h2->bins); > - > - affectedBin = HSTgetIndex(h2,val)+h2->bins; > - > - for ( i = h1->bins; i < 2*h1->bins; i++){ > - cur = (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - sum += cur; > - if (i==affectedBin) > - sumWhatIf += (h1->cnt[i] - (((h2->cnt[i-h1->bins]+1))/(h2->total+1))) * (h1->cnt[i] - (((h2->cnt[i-h1->bins]+1))/(h2->total+1))); > - else > - sumWhatIf += cur; > - } > - > - distance = sqrt((double) sum); > - distanceWhatIf = sqrt((double) sumWhatIf); > - *whatIfDistance = distanceWhatIf; > - if (distanceWhatIf > distance) return (distanceWhatIf - distance); > - return 0; > -} > - > -/* if 1 then moving this value to h2 increases the distance between h1-h2*/ > -int > -HSTeuclidianNormWhatIfMove(Histogram h1, Histogram h2, ValPtr val, dbl *whatIfDistance){ > - dbl sum= 0, sumWhatIf=0, cur; > - dbl distance, distanceWhatIf; > - int i, affectedBin; > - assert(h1->bins == h2->bins); > - > - affectedBin = HSTgetIndex(h1,val)+h2->bins; > - > - for ( i = h1->bins; i < 2*h1->bins; i++){ > - cur = (h1->cnt[i] - h2->cnt[i]) * (h1->cnt[i] - h2->cnt[i]); > - sum += cur; > - if (i==affectedBin) > - sumWhatIf += ((((h1->cnt[i-h1->bins]-1))/(h1->total-1)) - (((h2->cnt[i-h1->bins]+1))/(h2->total+1))) * ((((h1->cnt[i-h1->bins]-1))/(h1->total-1)) - (((h2->cnt[i-h1->bins]+1))/(h2->total+1))); > - else > - sumWhatIf += cur; > - } > - > - distance = sqrt((double) sum); > - distanceWhatIf = sqrt((double) sumWhatIf); > - *whatIfDistance = distanceWhatIf; > - if (distanceWhatIf > distance) return 1; > - return 0; > -} > - > - > -dbl > -HSTcityblock(Histogram h1, Histogram h2){ > - dbl sum=0; > - int i; > - assert(h1->bins == h2->bins); > - for ( i = 0; i < h1->bins; i++) > - sum += ABS(h1->cnt[i] - h2->cnt[i]); > - return (dbl) sum; > -} > - > -dbl > -HSTchebyshev(Histogram h1, Histogram h2){ > - dbl max; > _______________________________________________ > Checkin-list mailing list > Checkin-list(a)monetdb.org > http://mail.monetdb.org/mailman/listinfo/checkin-list >

9 years, 11 months

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

developers-list August 2012