May 2012 - developers-list

[Monetdb-developers] Announcement: New Apr2012-SP1 Bugfix release of MonetDB suite
by Fabian Groffen 25 May '12

25 May '12

The MonetDB team at CWI/MonetDB BV is pleased to announce the Apr2012-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/>. Apr 2012-SP1 bugfix release Build Environment * Windows: we now use OpenSSL 1.0.1b. SQL * Databases that were upgraded from the Aug2011 release have an error in the catalog for SQL procedures. This is now fixed. Merovingian * Fixed a bug where connecting to a stopped multiplex-funnel would result in a 'there are no available connections' error. MonetDB Common * Implemented MT_getrss for Mac OS X systems, this allows the server to know about how much memory is currently in use. Bug Fixes * 2454: SQL: add various statistical functions * 2916: non admin user cannot create temporary tables * 2949: SQL exception during execution of a correct user defined function that just returns a relation table constructed by a simple SQL select query * 2958: Grant does't work with schema syntax * 2960: mclient terminates connection during insertion of a large number of records from a file * 2972: SQL URL functionality contains errors * 2987: Broken type inference when using sql round * 2992: SQL module truncates DECIMALS when passing integers to MAL module * 3000: Inconsistency between read-only and read-write modes after dropping a schema * 3028: Segmentation fault in seqscan_eq_bte_bte_tloc_void_void * 3046: mserver5 terminates with segmentation fault * 3063: datacell functions no longer work after restart of database * 3072: Database upgrade from Dec2011 to Apr2012 broken for storage() * 3073: VERY slow foreign key check (due to missing batcalc.isnil() ?) * 3074: Name resolution in procedures * 3077: No errors on UDF returning table with too many columns * 3079: Converting an Oracle schema DDL for MonetDB fails to create a column named "no".

1 0

[Monetdb-developers] MonetDB on SUSE
by Hualin Wang 22 May '12

22 May '12

Dear All, I have trouble to install the right PCRE lib on my SUSE box. The server has an old PCRE 7.8 installed. I compiled my own PCRE 8.3 version with UTF-8 enabled. Then set up the env variables pcre_LIBS, pcre_CFLAGS, PKG_CONFIG_PATH, but the ./configure sitll complain utf-8 supported no. Which version I should install on the SUSE box? Thanks for any hint/help Best Regards, Hualin

2 2

[Monetdb-developers] New Jun2012 stable branch created
by Sjoerd Mullender 21 May '12

21 May '12

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 Jun2012. So in each of your stable checkout directories you can do hg pull hg update -rJun2012 to update to this new branch. -- Sjoerd Mullender

1 1

Re: [Monetdb-developers] MonetDB: Apr2012 - approve output after null-any type changes
by Fabian Groffen 17 May '12

17 May '12

Niels, On 16-05-2012 22:49:30 +0200, Niels Nes wrote: > Changeset: f450300984b8 for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=f450300984b8 > @@ -20,12 +20,12 @@ Ready. > > % . # table_name > % single_value # name > -% char # type > +% any # type > % 0 # length > [ NULL ] If the "any" type now boils up to the clients, we need to fix/change the APIs too, to understand this type and in some cases do something sensical with it. JDBC will barf on it currently, IIRC. Would it be possible to use an existing type for NULL when it has no type at the stage where it is sent back to the client (like exportResult)? Fabian

2 1

Re: [Monetdb-developers] MonetDB: default - Fix compilation.
by Stefan Manegold 09 May '12

09 May '12

FYI, if I recall correctly, on my Fedora 16 desktop, a delta build worked fine, but a build from scratch (both optimized) failed as nightly testing did. Stefan On Wed, May 09, 2012 at 09:36:04AM +0200, Sjoerd Mullender wrote: > Changeset: 5aa6c5cc9702 for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=5aa6c5cc9702 > Modified Files: > gdk/gdk_ssort_impl.h > Branch: default > Log Message: > > Fix compilation. > Why didn't gcc on Fedora 16 find these? > > > diffs (161 lines): > > diff --git a/gdk/gdk_ssort_impl.h b/gdk/gdk_ssort_impl.h > --- a/gdk/gdk_ssort_impl.h > +++ b/gdk/gdk_ssort_impl.h > @@ -21,14 +21,28 @@ > * to be defined by the including file, and we expect that the > * combination (T,O) is unique to each inclusion. */ > > -#define binarysort(a,b) binarysort_##a##b > -#define COPY(a) COPY_##a > -#define ISLT(a,b) ISLT_##a##b > -#define gallop_left(a,b) gallop_left_##a##b > -#define gallop_right(a,b) gallop_right_##a##b > -#define merge_at(a,b) merge_at_##a##b > -#define do_ssort(a,b) do_ssort_##a##b > -#define GDKssortimpl(b) GDKssort##b > +/* concatenate two or three tokens */ > +#define CONCAT2(a,b) a##b > +#define CONCAT3(a,b,c) a##b##c > + > +/* these tokens get redefined in each inclusion */ > +#undef binarysort > +#undef ISLT > +#undef COPY > +#undef gallop_left > +#undef gallop_right > +#undef merge_at > +#undef do_ssort > +#undef GDKssortimpl > + > +#define binarysort(a,b) CONCAT3(binarysort_,a,b) > +#define COPY(a) CONCAT2(COPY_,a) > +#define ISLT(a,b) CONCAT3(ISLT_,a,b) > +#define gallop_left(a,b) CONCAT3(gallop_left_,a,b) > +#define gallop_right(a,b) CONCAT3(gallop_right_,a,b) > +#define merge_at(a,b) CONCAT3(merge_at_,a,b) > +#define do_ssort(a,b) CONCAT3(do_ssort_,a,b) > +#define GDKssortimpl(b) CONCAT2(GDKssort,b) > > /* binarysort is the best method for sorting small arrays: it does few > * compares, but can do data movement quadratic in the number of > @@ -709,19 +723,20 @@ do_ssort(T,O)(MergeState *ms, ssize_t nr > n = 1; > } else { > n = 2; > - if (ISLT(T,O)(PTRADD(ms.bh, nlo, ms.hs), > - PTRADD(ms.bh, olo, ms.hs), &ms)) { > + if (ISLT(T,O)(PTRADD(ms->bh, nlo, ms->hs), > + PTRADD(ms->bh, olo, ms->hs), > + ms)) { > descending = 1; > for (olo = nlo++; > nlo < hi; > olo = nlo++, ++n) { > - if (!ISLT(T,O)(PTRADD(ms.bh, > + if (!ISLT(T,O)(PTRADD(ms->bh, > nlo, > - ms.hs), > - PTRADD(ms.bh, > + ms->hs), > + PTRADD(ms->bh, > olo, > - ms.hs), > - &ms)) > + ms->hs), > + ms)) > break; > } > } > @@ -729,32 +744,32 @@ do_ssort(T,O)(MergeState *ms, ssize_t nr > for (olo = nlo++; > nlo < hi; > olo = nlo++, ++n) { > - if (ISLT(T,O)(PTRADD(ms.bh, > + if (ISLT(T,O)(PTRADD(ms->bh, > nlo, > - ms.hs), > - PTRADD(ms.bh, > + ms->hs), > + PTRADD(ms->bh, > olo, > - ms.hs), > - &ms)) > + ms->hs), > + ms)) > break; > } > } > } > } > if (descending) > - reverse_slice(lo, lo + n, &ms); > + reverse_slice(lo, lo + n, ms); > /* If short, extend to min(minrun, nremaining). */ > if (n < minrun) { > ssize_t force = nremaining <= minrun ? nremaining : minrun; > > - binarysort(T,O)(lo, lo + force, lo + n, &ms); > + binarysort(T,O)(lo, lo + force, lo + n, ms); > n = force; > } > /* Push run onto pending-runs stack, and maybe merge. */ > - assert(ms.n < MAX_MERGE_PENDING); > - ms.pending[ms.n].base = lo; > - ms.pending[ms.n].len = n; > - ms.n++; > + assert(ms->n < MAX_MERGE_PENDING); > + ms->pending[ms->n].base = lo; > + ms->pending[ms->n].len = n; > + ms->n++; > { > /* Examine the stack of runs waiting to be merged, merging adjacent > * runs until the stack invariants are re-established: > @@ -765,19 +780,19 @@ do_ssort(T,O)(MergeState *ms, ssize_t nr > * See listsort.txt for more info. > * > * Returns 0 on success, -1 on error. */ > - struct slice *p = ms.pending; > + struct slice *p = ms->pending; > > - while (ms.n > 1) { > - ssize_t i = ms.n - 2; > + while (ms->n > 1) { > + ssize_t i = ms->n - 2; > > if (i > 0 && > p[i - 1].len <= p[i].len + p[i + 1].len) { > if (p[i - 1].len < p[i + 1].len) > --i; > - if (merge_at(T,O)(&ms, i) < 0) > + if (merge_at(T,O)(ms, i) < 0) > return -1; > } else if (p[i].len <= p[i + 1].len) { > - if (merge_at(T,O)(&ms, i) < 0) > + if (merge_at(T,O)(ms, i) < 0) > return -1; > } else > break; > @@ -794,14 +809,14 @@ do_ssort(T,O)(MergeState *ms, ssize_t nr > * one remains. This is used at the end of the mergesort. > * > * Returns 0 on success, -1 on error. */ > - struct slice *p = ms.pending; > + struct slice *p = ms->pending; > > - while (ms.n > 1) { > - ssize_t n = ms.n - 2; > + while (ms->n > 1) { > + ssize_t n = ms->n - 2; > > if (n > 0 && p[n - 1].len < p[n + 1].len) > --n; > - if (merge_at(T,O)(&ms, n) < 0) > + if (merge_at(T,O)(ms, n) < 0) > return -1; > } > } > @@ -916,3 +931,4 @@ GDKssortimpl(O)(void *h, void *t, void * > merge_freemem(&ms); > return result; > } > +#endif /* DEFINE_MAIN_FUNC */ > _______________________________________________ > 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) |

1 0