Terzultima riga del quote :) 2018-06-13 21:16 GMT+02:00 Ivan Martoccia [email protected] [it-torino-java-jug] <[email protected]>:
> > > Curiosità , ma il talk sarà in inglese giusto? > > Il giorno mar 12 giu 2018 alle 22:22 Roberto Franchini > [email protected] [it-torino-java-jug] <it-torino-java-jug@ > yahoogroups.com> ha scritto: > >> >> >> Ciao a tutti, >> come pre-annunciato a voce, avremo un secondo meeting il 27, sempre >> presso toolbox. >> >> Neil Stevenson, direttamente da Hazelcast, ci parlera' di "In-Memory >> Data Grids, e-commerce and analytics" >> >> I dettagli e l'iscrizione su meetup: >> >> https://www.meetup.com/JUGTorino/events/251691512/ >> >> e sul sito >> http://jugtorino.it/2018/06/12/meeting-giugno-2-2018.html >> >> ----- >> >> Neil Stevenson: In-Memory Data Grids, e-commerce and analytics >> >> In this talk, we'll take a three-part look at Hazelcast's In-Memory Data >> Grid, a popular IMDG choice and the fastest one available. >> >> To begin with, simple stuff. What is an IMDG, why would you use one, what >> can it do, where would you not use it? >> >> Next, we'll go to a demo, with an online shop. This will show how IMDG >> fits into the big picture, providing real-world benefits of resilience, >> scalability and security, for very little coding. >> >> And finally, we'll take the demo a stage further with added analytics, >> examining how shopping trends can be tracked to provide insights into >> customer habits. >> >> The talk will be in English, with a Java & Spring demo that you can >> download after. >> >> Bio: Neil Stevenson >> >> Neil is a solution architect for Hazelcast, the world's leading open >> source in-memory data grid. In more than 25 years of work in IT, Neil has >> designed, developed and debugged a number of software systems for companies >> large and small. >> >> >> -- >> Roberto Franchini >> "The impossible is inevitable" >> https://github.com/robfrank/ >> https://twitter.com/robfrankie >> https://www.linkedin.com/in/robfrank >> >> -- > Response to : [email protected] > > >
