Release β-4.19 – April 2012 built
This system derives the best join order among all possible n-way joins for the collection of relations R1 through Rn (n ≥ 2). Each of the relations is assumed to be placed at a distinct node of a certain network. |
This release does not support features to store your created test cases and retrieve and update them later for your additional experiments. The upcoming release will support repeated accesses of your saved cases. |
Release History:
|
This development is supported by funds from International Technology Alliance and in collaboration with Abbe Mowshowitz (CUNY), Andrew Nagel (CUNY), Andi Toce (CUNY), Paul D. Stone (IBM UK), Patrick Dantressangle (IBM UK), and Graham Bent (IBM UK). |
© 2011-2012, Akira Kawaguchi, City College of New York