Hi Wes,
I think Greg or Amy are the ones that put the videos together. I am not
sure about the status...
-Jason
On Wed, Jan 13, 2016 at 10:35 AM, Wes Williams wrote:
> Hi Jason,
>
> do you have the replay of your presentation yet?
>
> Thanks
>
> *Wes Williams | Pivotal Sr. **Data Engineer*
>
Hi Jason,
do you have the replay of your presentation yet?
Thanks
*Wes Williams | Pivotal Sr. **Data Engineer*
781.606.0325
http://pivotal.io/big-data/pivotal-gemfire
On Sun, Nov 8, 2015 at 6:22 PM, Greg Chase wrote:
> Will post when it's available
>
> This email encrypted by tiny buttons & f
Great work Jason!
Side note: OQL syntax can also be used to query a heap dump:
https://visualvm.java.net/oqlhelp.html
Anthony
> On Nov 3, 2015, at 11:38 AM, Gregory Chase wrote:
>
> Thank you Jason for an excellent presentation. We'll post the replay soon as
> well!
>
> -Greg
>
> On Tue
Thank you Jason for an excellent presentation. We'll post the replay soon
as well!
-Greg
On Tue, Nov 3, 2015 at 11:36 AM, Jason Huynh wrote:
> Here are the slides on slideshare
>
> http://www.slideshare.net/huynhja/oql-querying-and-indexes
>
> On Tue, Nov 3, 2015 at 11:24 AM, Gregory Chase wro
Here are the slides on slideshare
http://www.slideshare.net/huynhja/oql-querying-and-indexes
On Tue, Nov 3, 2015 at 11:24 AM, Gregory Chase wrote:
> Attachment didn't come through. Please post on Slideshare.
>
> Alternatively feel free to post editable form of the PPT to here:
> https://github
Attachment didn't come through. Please post on Slideshare.
Alternatively feel free to post editable form of the PPT to here:
https://github.com/Pivotal-Open-Source-Hub/POSH-Talks
-Greg
On Tue, Nov 3, 2015 at 11:21 AM, Jason Huynh wrote:
> Attached are the slides from todays talk.
>
> Please f
Attached are the slides from todays talk.
Please feel free to continue to post questions on the user or dev list and
we will answer them as best as we can.
As a follow up to one of the questions about cluster sizing and indexes
that came up during todays talk:
Although each case will depend on th
