- developers-list - monetdb.org

[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

[Monetdb-developers] Announcement: New Apr2012 Feature release of MonetDB suite
by Sjoerd Mullender 27 Apr '12

27 Apr '12

The MonetDB team at CWI/MonetDB BV is pleased to announce the Apr2012 feature 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 feature release Build Environment * Fixed some of the package names for Debian/Ubuntu. Packages for libraries should contain the major number of the library version number. This was not always the case. * On Debian and Ubuntu, install Python modules in dist-packages instead of site-packages. This fixed bug 2997. SQL * Fixed a crash that happened at the end of a database upgrade to the Dec2011 database scheme. The crash happened during cleanup after the database was upgraded, so it was merely inconvenient. * Stripped off implementation-specific parts from error messages before they get presented to the user. Java Module * Password reading by JdbcClient no longer results in strange artifacts * JdbcClient now returns exit code 1 in case of failures * Implemented missing Number types support in PreparedStatement.setObject() * Fixed bug in DatabaseMetaData.getSchemas() method that caused an SQL error when called with catalog and schema argument. * Resolved a bug where JDBC and Control connections could terminate abruptly with 'Connection closed' messages Client Package * ODBC: Implemented the SQL_ATTR_CONNECTION_TIMEOUT attribute. * mclient now has a -a (--autocommit) option to turn off autocommit mode. MonetDB5 Server * The type "chr" has been removed. chr has long been superseded by bte for 1 byte arithmetic plus it is pretty useless to hold single characters since we use Unicode and thus only a tiny subset of the supported character set would fit. * Fixed potential crash by dealing better with non-standard types. * A couple of memory leaks have been plugged. Merovingian * The logfile and pidfile monetdbd properties are now displayed with dbfarm path when relative * Fixed a bug in the multiplex-funnel where certain clients would abort on responses for update queries. * Fixed problem where version and mserver properties for monetdbd were not always successfully retrieved. Bug #2982. * Fixed problem where shutdown of monetdbd would lead to shutting down database 'control' which does not exist. Bug #2983. * Fixed issue causing (harmless) 'error reading from control channel' messages. Bug #2984. * Resolved problem where remote start/stop/etc. commands with monetdb would report error 'OK'. Bug #2984. MonetDB Common * The type "chr" has been removed. chr has long been superseded by bte for 1 byte arithmetic plus it is pretty useless to hold single characters since we use Unicode and thus only a tiny subset of the supported character set would fit. Bug Fixes

1 0

Re: [Monetdb-developers] MonetDB: holindex - Initial step for holistic indexing.
by Stefan Manegold 24 Apr '12

24 Apr '12

Eleni, you might also want to checkin your new files that are required to compile your code ;-) Thanks, Stefan On Tue, Apr 24, 2012 at 10:06:06AM +0200, Eleni Petraki wrote: > Changeset: 71b71ebda4e6 for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=71b71ebda4e6 > Modified Files: > monetdb5/extras/crackers/60_crackers.mal > monetdb5/extras/crackers/Makefile.ag > monetdb5/extras/crackers/crackers.mx > monetdb5/optimizer/opt_pipes.c > monetdb5/optimizer/opt_support.c > monetdb5/optimizer/opt_support.h > Branch: holindex > Log Message: > > Initial step for holistic indexing. > I implemented an operator that initializes with zero the weights in a list. > > > diffs (175 lines): > > diff --git a/monetdb5/extras/crackers/60_crackers.mal b/monetdb5/extras/crackers/60_crackers.mal > --- a/monetdb5/extras/crackers/60_crackers.mal > +++ b/monetdb5/extras/crackers/60_crackers.mal > @@ -19,5 +19,6 @@ > library crackers; > include opt_selcrack; > include opt_selcrackst; > +include opt_selcrackhol; > include crackers; > > diff --git a/monetdb5/extras/crackers/Makefile.ag b/monetdb5/extras/crackers/Makefile.ag > --- a/monetdb5/extras/crackers/Makefile.ag > +++ b/monetdb5/extras/crackers/Makefile.ag > @@ -35,9 +35,13 @@ lib_crackers = { > crackers_index.mx \ > crackers_core_unordered.mx \ > crackers_select_ops.mx \ > + crackers_holistic.c \ > + crackers_holistic.h \ > crackers_selectst_ops.mx \ > + crackers_selecthol_ops.mx \ > opt_selcrack.mx \ > - opt_selcrackst.mx > + opt_selcrackst.mx \ > + opt_selcrackhol.mx > LIBS = ../../tools/libmonetdb5 \ > ../../../gdk/libbat \ > ../../../common/stream/libstream \ > @@ -49,7 +53,8 @@ headers_mal = { > DIR = libdir/monetdb5 > SOURCES = crackers.mx \ > opt_selcrack.mx \ > - opt_selcrackst.mx > + opt_selcrackst.mx \ > + opt_selcrackhol.mx > } > > headers_crackersautoload = { > diff --git a/monetdb5/extras/crackers/crackers.mx b/monetdb5/extras/crackers/crackers.mx > --- a/monetdb5/extras/crackers/crackers.mx > +++ b/monetdb5/extras/crackers/crackers.mx > @@ -239,6 +239,55 @@ address CRKthetaselectst_@2 > comment "Retrieve the subset using a cracker > index producing preferably a BATview."; > > + > +command selecthol(b:bat[:oid,:@2],l:@2,h:@2):bat[:oid,:@2] > +address CRKselecthol_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command selecthol(b:bat[:oid,:@2],l:@2):bat[:oid,:@2] > +address CRKselectholValue_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command selecthol(b:bat[:oid,:@2],l:@2,h:@2,li:bit,hi:bit):bat[:oid,:@2] > +address CRKselectholBounds_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command uselecthol(b:bat[:any_1,:@2],l:@2,h:@2):bat[:any_1,:void] > +address CRKuselecthol_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command uselecthol(b:bat[:any_1,:@2],l:@2):bat[:any_1,:void] > +address CRKuselectholValue_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command uselecthol(b:bat[:any_1,:@2],l:@2,h:@2,li:bit,hi:bit):bat[:any_1,:void] > +address CRKuselectholBounds_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command thetauselecthol(b:bat[:any_1,:@2],v:@2,op:str):bat[:any_1,:void] > +address CRKthetauselecthol_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command thetaselecthol(b:bat[:any_1,:@2],v:@2,op:str):bat[:any_1,:@2] > +address CRKthetaselecthol_@2 > +comment "Retrieve the subset using a cracker > + index producing preferably a BATview."; > + > +command initFrequencyStruct(b:bat[:any_1,:@2]):void > +address CRKinitFrequencyStruct_@2 > +comment "Initialize the struct(lifo) with zero values."; > + > +command selectNode(l:int,h:int):void > +address CRKselectNode > +comment "Select node/BAT to crack (randomly)."; > + > @ > @= Index > command printCrackerIndexBATpart(b:bat[:any_1,:@2]):void > @@ -296,12 +345,15 @@ comment "Break a BAT into three pieces w > #include "crackers_index.h" > #include "crackers_select_ops.h" > #include "crackers_selectst_ops.h" > +#include "crackers_selecthol_ops.h" > +#include "crackers_holistic.h" > #include "crackers_core_unordered.h" > #include "crackers_AVL_tree.h" > > #ifdef LIBCRACKERS > extern int maxCrackMap; > extern CrackerIndexNode *CrackerIndex; > +extern FrequencyNode *FrequencyStruct; > extern int IndexEntries; > extern int IndexSize; > extern int IndexStop; > @@ -323,6 +375,7 @@ extern struct storageManagement *Storage > int maxCrackMap = 0; > > CrackerIndexNode *CrackerIndex; > +FrequencyNode *FrequencyStruct; > > struct storageManagement *StorageInfo = NULL; > > diff --git a/monetdb5/optimizer/opt_pipes.c b/monetdb5/optimizer/opt_pipes.c > --- a/monetdb5/optimizer/opt_pipes.c > +++ b/monetdb5/optimizer/opt_pipes.c > @@ -296,6 +296,28 @@ struct PIPELINES { > "optimizer.multiplex();" > "optimizer.garbageCollector();", > "experimental", "OPTselcrackst", 0}, > +/*The HOLISTIC indexing pipeline*/ > + {"crackerhol_pipe", > + "optimizer.inline();" > + "optimizer.remap();" > + "optimizer.evaluate();" > + "optimizer.costModel();" > + "optimizer.coercions();" > + "optimizer.emptySet();" > + "optimizer.aliases();" > + "optimizer.selcrackhol();" > + "optimizer.deadcode();" > + "optimizer.commonTerms();" > + "optimizer.groups();" > + "optimizer.joinPath();" > + "optimizer.reorder();" > + "optimizer.deadcode();" > + "optimizer.reduce();" > + "optimizer.dataflow();" > + "optimizer.history();" > + "optimizer.multiplex();" > + "optimizer.garbageCollector();", > + "experimental", "OPTselcrackhol", 0}, > > > {"sidcrack_pipe", > diff --git a/monetdb5/optimizer/opt_support.c b/monetdb5/optimizer/opt_support.c > --- a/monetdb5/optimizer/opt_support.c > +++ b/monetdb5/optimizer/opt_support.c > @@ -603,6 +603,7 @@ struct OPTcatalog { > {"replication", 0, 0, 0, DEBUG_OPT_REPLICATION}, > {"selcrack", 0, 0, 0, DEBUG_OPT_SELCRACK}, > {"selcrackst", 0, 0, 0, DEBUG_OPT_SELCRACKST}, > +{"selcrackhol", 0, 0, 0, DEBUG_OPT_SELCRACKHOL}, > {"sidcrack", 0, 0, 0, DEBUG_OPT_SIDCRACK}, > {"singleton", 0, 0, 0, DEBUG_OPT_SINGLETON}, > {"strengthreduction", 0, 0, 0, DEBUG_OPT_STRENGTHREDUCTION}, > diff --git a/monetdb5/optimizer/opt_support.h b/monetdb5/optimizer/opt_support.h > --- a/monetdb5/optimizer/opt_support.h > +++ b/monetdb5/optimizer/opt_support.h > @@ -93,6 +93,7 @@ > #define DEBUG_OPT_HEURISTIC 49 > #define DEBUG_OPT_CENTIPEDE 50 > #define DEBUG_OPT_SELCRACKST 51 > +#define DEBUG_OPT_SELCRACKHOL 52 > > #define DEBUG_OPT(X) ((lng) 1 << (X)) > opt_export lng optDebug; > _______________________________________________ > 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

[Monetdb-developers] help ! Why can't i analyze schema ?
by hunglmk 20 Apr '12

20 Apr '12

* * * * * * * * * * * * * * * * * * * * Sio Lâm Minh Khánh Hùng * * * * * * * * * * * * * * * * * * * * * ----- Original Message ----- From: hunglmk To: monetdb-developers(a)lists.sourceforge.net Sent: Wednesday, April 04, 2012 8:07 chieu Subject: Why can't i analyze schema ? Good morning . I'm using monetdb with proximity and when i was trying to [analyze schema] the database but nothing happened thought i did exactly like the tutorial . here what i got from the command promt ================================================================== 0 [main] WARN kdl.prox3.util.Util - * log config file not found (using defaults ): D:\prx\proximity\prox.lcf' Exception in thread "AWT-EventQueue-0" java.lang.IllegalAccessError: class javax .swing.$Proxy1 cannot access its superinterface javax.swing.TransferHandler$HasG etTransferHandler at java.lang.reflect.Proxy.defineClass0(Native Method) at java.lang.reflect.Proxy.getProxyClass(Unknown Source) at java.lang.reflect.Proxy.newProxyInstance(Unknown Source) at spin.Spin.getProxy(Spin.java:190) at spin.Spin.over(Spin.java:223) at spin.off.ListenerSpinOver.spinOver(ListenerSpinOver.java:104) at spin.off.ListenerSpinOver.intercept(ListenerSpinOver.java:64) at spin.Spin$AbstractInvocationHandler.invoke(Spin.java:411) at $Proxy0.addPropertyChangeListener(Unknown Source) at kdl.prox3.gui2.SchemaAnalysisJFrame.analyze(SchemaAnalysisJFrame.java :98) at kdl.prox3.gui2.SchemaAnalysisJFrame.access$000(SchemaAnalysisJFrame.java:57) at kdl.prox3.gui2.SchemaAnalysisJFrame$1.actionPerformed(SchemaAnalysisJFrame.java:121) at javax.swing.AbstractButton.fireActionPerformed(Unknown Source) at javax.swing.AbstractButton$Handler.actionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.fireActionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.setPressed(Unknown Source) at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(Unknown Source) at java.awt.Component.processMouseEvent(Unknown Source) at javax.swing.JComponent.processMouseEvent(Unknown Source) at java.awt.Component.processEvent(Unknown Source) at java.awt.Container.processEvent(Unknown Source) at java.awt.Component.dispatchEventImpl(Unknown Source) at java.awt.Container.dispatchEventImpl(Unknown Source) at java.awt.Component.dispatchEvent(Unknown Source) at java.awt.LightweightDispatcher.retargetMouseEvent(Unknown Source) at java.awt.LightweightDispatcher.processMouseEvent(Unknown Source) at java.awt.LightweightDispatcher.dispatchEvent(Unknown Source) at java.awt.Container.dispatchEventImpl(Unknown Source) at java.awt.Window.dispatchEventImpl(Unknown Source) at java.awt.Component.dispatchEvent(Unknown Source) at java.awt.EventQueue.dispatchEventImpl(Unknown Source) at java.awt.EventQueue.access$000(Unknown Source) at java.awt.EventQueue$1.run(Unknown Source) at java.awt.EventQueue$1.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.awt.EventQueue$2.run(Unknown Source) at java.awt.EventQueue$2.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.awt.EventQueue.dispatchEvent(Unknown Source) at java.awt.EventDispatchThread.pumpOneEventForFilters(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForFilter(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.run(Unknown Source) ================================================================== I'm using window XP SP2 and JDK 1.6 , JRE 1.6 , monetdb 4.6.2 for windows . Do i need to install any software or library . Any advices will be great help . Thanks for your time Have a nice day * * * * * * * * * * * * * * * * * * * * Sio Lâm Minh Khánh Hùng * * * * * * * * * * * * * * * * * * * * *

1 0

[Monetdb-developers] Why can't i analyze schema ?
by hunglmk 04 Apr '12

04 Apr '12

Good morning . I'm using monetdb with proximity and when i was trying to [analyze schema] the database but nothing happened thought i did exactly like the tutorial . here what i got from the command promt ================================================================== 0 [main] WARN kdl.prox3.util.Util - * log config file not found (using defaults ): D:\prx\proximity\prox.lcf' Exception in thread "AWT-EventQueue-0" java.lang.IllegalAccessError: class javax .swing.$Proxy1 cannot access its superinterface javax.swing.TransferHandler$HasG etTransferHandler at java.lang.reflect.Proxy.defineClass0(Native Method) at java.lang.reflect.Proxy.getProxyClass(Unknown Source) at java.lang.reflect.Proxy.newProxyInstance(Unknown Source) at spin.Spin.getProxy(Spin.java:190) at spin.Spin.over(Spin.java:223) at spin.off.ListenerSpinOver.spinOver(ListenerSpinOver.java:104) at spin.off.ListenerSpinOver.intercept(ListenerSpinOver.java:64) at spin.Spin$AbstractInvocationHandler.invoke(Spin.java:411) at $Proxy0.addPropertyChangeListener(Unknown Source) at kdl.prox3.gui2.SchemaAnalysisJFrame.analyze(SchemaAnalysisJFrame.java :98) at kdl.prox3.gui2.SchemaAnalysisJFrame.access$000(SchemaAnalysisJFrame.java:57) at kdl.prox3.gui2.SchemaAnalysisJFrame$1.actionPerformed(SchemaAnalysisJFrame.java:121) at javax.swing.AbstractButton.fireActionPerformed(Unknown Source) at javax.swing.AbstractButton$Handler.actionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.fireActionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.setPressed(Unknown Source) at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(Unknown Source) at java.awt.Component.processMouseEvent(Unknown Source) at javax.swing.JComponent.processMouseEvent(Unknown Source) at java.awt.Component.processEvent(Unknown Source) at java.awt.Container.processEvent(Unknown Source) at java.awt.Component.dispatchEventImpl(Unknown Source) at java.awt.Container.dispatchEventImpl(Unknown Source) at java.awt.Component.dispatchEvent(Unknown Source) at java.awt.LightweightDispatcher.retargetMouseEvent(Unknown Source) at java.awt.LightweightDispatcher.processMouseEvent(Unknown Source) at java.awt.LightweightDispatcher.dispatchEvent(Unknown Source) at java.awt.Container.dispatchEventImpl(Unknown Source) at java.awt.Window.dispatchEventImpl(Unknown Source) at java.awt.Component.dispatchEvent(Unknown Source) at java.awt.EventQueue.dispatchEventImpl(Unknown Source) at java.awt.EventQueue.access$000(Unknown Source) at java.awt.EventQueue$1.run(Unknown Source) at java.awt.EventQueue$1.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.awt.EventQueue$2.run(Unknown Source) at java.awt.EventQueue$2.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.security.AccessControlContext$1.doIntersectionPrivilege(Unknown Source) at java.awt.EventQueue.dispatchEvent(Unknown Source) at java.awt.EventDispatchThread.pumpOneEventForFilters(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForFilter(Unknown Source) at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.pumpEvents(Unknown Source) at java.awt.EventDispatchThread.run(Unknown Source) ================================================================== I'm using window XP SP2 and JDK 1.6 , JRE 1.6 , monetdb 4.6.2 for windows . Do i need to install any software or library . Any advices will be great help . Thanks for your time Have a nice day * * * * * * * * * * * * * * * * * * * * Sio Lâm Minh Khánh Hùng * * * * * * * * * * * * * * * * * * * * *

2 1

[Monetdb-developers] (no subject)
by sylver_b 02 Apr '12

02 Apr '12

<a href="http://babyproduct.co.in/wp-content/plugins/extended-comment-options/02efpk…"> http://babyproduct.co.in/wp-content/plugins/extended-comment-options/02efpk…</a>

1 0

[Monetdb-developers] (no subject)
by sylver_b 02 Apr '12

02 Apr '12

<a href="http://netbooksindia.com/wp-content/plugins/extended-comment-options/02efpk…"> http://netbooksindia.com/wp-content/plugins/extended-comment-options/02efpk…</a>

1 0

Re: [Monetdb-developers] MonetDB: default - Merge with default branch.
by Stefan Manegold 17 Mar '12

17 Mar '12

oop, sorry, message should have been "Merge with Apr2012 branch." Stefan On Sat, Mar 17, 2012 at 03:20:38PM +0100, Stefan Manegold wrote: > Changeset: 498e01451664 for MonetDB > URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=498e01451664 > Modified Files: > clients/mapiclient/mclient.c > monetdb5/mal/mal_resolve.c > sql/backends/monet5/UDF/udf.c > sql/backends/monet5/UDF/udf.h > sql/test/bugs/Tests/crash_order_by.stable.out > tools/merovingian/daemon/controlrunner.c > tools/merovingian/daemon/merovingian.c > Branch: default > Log Message: > > Merge with default branch. > > > diffs (truncated from 413 to 300 lines): > > diff --git a/clients/mapiclient/mclient.c b/clients/mapiclient/mclient.c > --- a/clients/mapiclient/mclient.c > +++ b/clients/mapiclient/mclient.c > @@ -654,7 +654,9 @@ CSVrenderer(MapiHdl hdl) > s = mapi_fetch_field(hdl, i); > if (s == NULL) > s = nullstring == default_nullstring ? "" : nullstring; > - if (strchr(s, *sep) != NULL || strchr(s, '\n') != NULL || strchr(s, '"') != NULL) { > + if (strchr(s, *sep) != NULL || > + strchr(s, '\n') != NULL || > + strchr(s, '"') != NULL) { > mnstr_printf(toConsole, "%s\"", > i == 0 ? "" : sep); > while (*s) { > @@ -675,8 +677,6 @@ CSVrenderer(MapiHdl hdl) > mnstr_write(toConsole, "\"\"", 1, 2); > break; > default: > - if (*s == *sep) > - mnstr_write(toConsole, "\\", 1, 1); > mnstr_write(toConsole, s, 1, 1); > break; > } > diff --git a/monetdb5/mal/mal_resolve.c b/monetdb5/mal/mal_resolve.c > --- a/monetdb5/mal/mal_resolve.c > +++ b/monetdb5/mal/mal_resolve.c > @@ -68,7 +68,7 @@ > * These examples give little room to achieve our prime objective, i.e. > * a fast and early type resolution scheme. Any non-polymorphic function > * can be type checked and marked type-safe upon completion. > - * Type checking polymorphic functions are post-poned until a concrete > + * Type checking polymorphic functions are postponed until a concrete > * type instance is known. It leads to a clone, which can be type checked > * and is entered into the symbol table. > * The type resolution status is marked in each instruction. > diff --git a/sql/backends/monet5/UDF/udf.c b/sql/backends/monet5/UDF/udf.c > --- a/sql/backends/monet5/UDF/udf.c > +++ b/sql/backends/monet5/UDF/udf.c > @@ -3,26 +3,26 @@ > * 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. > -*/ > - > + */ > > #include "monetdb_config.h" > #include "udf.h" > > /* Reverse a string */ > -str UDFreverse ( str *ret , str *arg ) > +str > +UDFreverse(str *ret, str *arg) > { > size_t len = 0; > str src = NULL, dst = NULL; > @@ -37,7 +37,8 @@ str UDFreverse ( str *ret , str *arg ) > if (src == NULL || strcmp(src, str_nil) == 0) { > *ret = GDKstrdup(str_nil); > if (*ret == NULL) > - throw(MAL, "udf.reverse", "failed to create copy of str_nil"); > + throw(MAL, "udf.reverse", > + "failed to create copy of str_nil"); > > return MAL_SUCCEED; > } > @@ -46,7 +47,8 @@ str UDFreverse ( str *ret , str *arg ) > len = strlen(src); > *ret = dst = GDKmalloc(len + 1); > if (dst == NULL) > - throw(MAL, "udf.reverse", "failed to allocate string of length " SZFMT, len+1); > + throw(MAL, "udf.reverse", > + "failed to allocate string of length " SZFMT, len + 1); > > /* copy characters from src to dst in reverse order */ > dst[len] = 0; > @@ -62,7 +64,8 @@ str UDFreverse ( str *ret , str *arg ) > * Generic "type-oblivious" version, > * using generic "type-oblivious" BAT access interface. > */ > -str UDFBATreverse ( bat *ret , bat *bid ) > +str > +UDFBATreverse(bat *ret, bat *bid) > { > BATiter li; > BAT *bn = NULL, *left = NULL; > @@ -78,7 +81,8 @@ str UDFBATreverse ( bat *ret , bat *bid > /* check tail type */ > if (left->ttype != TYPE_str) { > BBPreleaseref(left->batCacheid); > - throw(MAL, "batudf.reverse", "tail-type of input BAT must be TYPE_str"); > + throw(MAL, "batudf.reverse", > + "tail-type of input BAT must be TYPE_str"); > } > > /* allocate result BAT */ > @@ -98,6 +102,7 @@ str UDFBATreverse ( bat *ret , bat *bid > /* the core of the algorithm, expensive due to malloc/frees */ > BATloop(left, p, q) { > str tr = NULL, err = NULL; > + > /* get original head & tail value */ > ptr h = BUNhead(li, p); > str t = (str) BUNtail(li, p); > @@ -106,7 +111,8 @@ str UDFBATreverse ( bat *ret , bat *bid > err = UDFreverse(&tr, &t); > if (err != MAL_SUCCEED) { > /* error -> bail out */ > - BATaccessEnd(left, USE_HEAD | USE_TAIL, MMAP_SEQUENTIAL); > + BATaccessEnd(left, USE_HEAD | USE_TAIL, > + MMAP_SEQUENTIAL); > BBPreleaseref(left->batCacheid); > BBPreleaseref(*ret); > return err; > @@ -116,7 +122,7 @@ str UDFBATreverse ( bat *ret , bat *bid > assert(tr != NULL); > > /* insert original head and reversed tail in result BAT */ > - /* BUNins() takes care of all necessary admininstration */ > + /* BUNins() takes care of all necessary administration */ > BUNins(bn, h, tr, FALSE); > > /* free memory allocated in UDFreverse() */ > @@ -155,9 +161,9 @@ str UDFfuse_##in##_##out ( out *ret , in > return MAL_SUCCEED; \ > } > > -UDFfuse_scalar_impl(bte,unsigned char ,sht, 8) > -UDFfuse_scalar_impl(sht,unsigned short,int,16) > -UDFfuse_scalar_impl(int,unsigned int ,lng,32) > +UDFfuse_scalar_impl(bte, unsigned char, sht, 8) > +UDFfuse_scalar_impl(sht, unsigned short, int, 16) > +UDFfuse_scalar_impl(int, unsigned int, lng, 32) > > > /* BAT fuse */ > @@ -165,8 +171,8 @@ UDFfuse_scalar_impl(int,unsigned int ,l > * Type-expanded optimized version, > * accessing value arrays directly. > */ > -str > -UDFBATfuse ( bat *ires , bat *ione , bat *itwo) > + str > +UDFBATfuse(bat *ires, bat *ione, bat *itwo) > { > BAT *bres = NULL, *bone = NULL, *btwo = NULL; > bit two_tail_sorted_unsigned = FALSE; > @@ -185,89 +191,102 @@ UDFBATfuse ( bat *ires , bat *ione , bat > } > > /* check for dense & aligned heads */ > - if (!BAThdense(bone) || !BAThdense(btwo) || BATcount(bone) != BATcount(btwo) || bone->hseqbase != btwo->hseqbase) { > + if (!BAThdense(bone) || > + !BAThdense(btwo) || > + BATcount(bone) != BATcount(btwo) || > + bone->hseqbase != btwo->hseqbase) { > BBPreleaseref(bone->batCacheid); > BBPreleaseref(btwo->batCacheid); > - throw(MAL, "batudf.fuse", "heads of input BATs must be aligned"); > + throw(MAL, "batudf.fuse", > + "heads of input BATs must be aligned"); > } > > /* check tail types */ > if (bone->ttype != btwo->ttype) { > BBPreleaseref(bone->batCacheid); > BBPreleaseref(btwo->batCacheid); > - throw(MAL, "batudf.fuse", "tails of input BATs must be identical"); > + throw(MAL, "batudf.fuse", > + "tails of input BATs must be identical"); > } > > /* advice on sequential scan */ > BATaccessBegin(bone, USE_TAIL, MMAP_SEQUENTIAL); > BATaccessBegin(btwo, USE_TAIL, MMAP_SEQUENTIAL); > > -#define UDFBATfuse_TYPE(in,uin,out,shift) \ > -{ /* type-specific core algorithm */ \ > - in *one = NULL, *two = NULL; \ > - out *res = NULL; \ > - BUN i, n = BATcount(bone); \ > - \ > - /* allocate result BAT */ \ > - bres = BATnew(TYPE_void, TYPE_##out, n); \ > - if (bres == NULL) { \ > - BBPreleaseref(bone->batCacheid); \ > - BBPreleaseref(btwo->batCacheid); \ > - throw(MAL, "batudf.fuse", MAL_MALLOC_FAIL); \ > - } \ > - \ > - /* get direct access to the tail arrays */ \ > - one = (in *) Tloc(bone, BUNfirst(bone)); \ > - two = (in *) Tloc(btwo, BUNfirst(btwo)); \ > - res = (out*) Tloc(bres, BUNfirst(bres)); \ > - \ > - /* is tail of right/second BAT sorted, also when cast to unsigned type, */ \ > - /* i.e., are the values either all >= 0 or all < 0? */ \ > - two_tail_sorted_unsigned = BATtordered(btwo)&1 && ( two[0] >= 0 || two[n-1] < 0 ); \ > - \ > - /* iterate over all values/tuples and do the work */ \ > - for (i = 0; i < n; i++) \ > - if (one[i] == in##_nil || two[i] == in##_nil) \ > - /* NULL/nil in => NULL/nil out */ \ > - res[i] = out##_nil; \ > - else \ > - /* do the work; watch out for sign bits */ \ > - res[i] = ( ((out)((uin)one[i])) << shift ) | ((uin)two[i]); \ > - \ > - /* set number of tuples in result BAT */ \ > - BATsetcount(bres, n); \ > -} > +#define UDFBATfuse_TYPE(in,uin,out,shift) \ > +do { /* type-specific core algorithm */ \ > + in *one = NULL, *two = NULL; \ > + out *res = NULL; \ > + BUN i, n = BATcount(bone); \ > + \ > + /* allocate result BAT */ \ > + bres = BATnew(TYPE_void, TYPE_##out, n); \ > + if (bres == NULL) { \ > + BBPreleaseref(bone->batCacheid); \ > + BBPreleaseref(btwo->batCacheid); \ > + throw(MAL, "batudf.fuse", MAL_MALLOC_FAIL); \ > + } \ > + \ > + /* get direct access to the tail arrays */ \ > + one = (in *) Tloc(bone, BUNfirst(bone)); \ > + two = (in *) Tloc(btwo, BUNfirst(btwo)); \ > + res = (out*) Tloc(bres, BUNfirst(bres)); \ > + \ > + /* is tail of right/second BAT sorted, also when cast to \ > + * unsigned type, */ \ > + /* i.e., are the values either all >= 0 or all < 0? */ \ > + two_tail_sorted_unsigned = BATtordered(btwo) & 1 && \ > + (two[0] >= 0 || two[n - 1] < 0); \ > + \ > + /* iterate over all values/tuples and do the work */ \ > + for (i = 0; i < n; i++) \ > + if (one[i] == in##_nil || two[i] == in##_nil) \ > + /* NULL/nil in => NULL/nil out */ \ > + res[i] = out##_nil; \ > + else \ > + /* do the work; watch out for sign bits */ \ > + res[i] = ((out) (uin) one[i] << shift) | (uin) two[i]; \ > + \ > + /* set number of tuples in result BAT */ \ > + BATsetcount(bres, n); \ > +} while (0) > > /* type expansion for core algorithm */ > switch (bone->ttype) { > case TYPE_bte: > - UDFBATfuse_TYPE(bte,unsigned char ,sht, 8) > + UDFBATfuse_TYPE(bte, unsigned char, sht, 8); > break; > + > case TYPE_sht: > - UDFBATfuse_TYPE(sht,unsigned short,int,16) > + UDFBATfuse_TYPE(sht, unsigned short, int, 16); > break; > + > case TYPE_int: > - UDFBATfuse_TYPE(int,unsigned int ,lng,32) > + UDFBATfuse_TYPE(int, unsigned int, lng, 32); > break; > + > default: > - throw(MAL, "batudf.fuse", "tails of input BATs must be one of {bte, sht, int}"); > + throw(MAL, "batudf.fuse", > + "tails of input BATs must be one of {bte, sht, int}"); > } > > BATaccessEnd(bone, USE_TAIL, MMAP_SEQUENTIAL); > BATaccessEnd(btwo, USE_TAIL, MMAP_SEQUENTIAL); > > /* set result properties */ > - bres->hdense = TRUE; /* result head is dense */ > + bres->hdense = TRUE; /* result head is dense */ > BATseqbase(bres, bone->hseqbase); /* result head has same seqbase as input */ > - bres->hsorted = GDK_SORTED; /* result head is sorted */ > - BATkey(bone, TRUE); /* result head is key (unique) */ > + bres->hsorted = GDK_SORTED; /* result head is sorted */ > + BATkey(bres, TRUE); /* result head is key (unique) */ > > - /* Result tail is sorted, if the left/first input tail is sorted and key (unique), > _______________________________________________ > 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