Location: Java trackTime: 2007-11-13 16.20Level: Intermediate
|
|
Emil Eifrém, NEO Persistence & Björn Granvik, Jayway ,SwedenAfter some unsuccessful attempts at demo programming in the 80s, Emil Eifrem found a hacker's home in the world of text role-playing games in the early days of the internet. 100 000 lines of spaghetti C, almost as many segfaults and several sleepless years later, he escaped into the warm embrace of Java 1.0a2 and has stayed there ever since. (He has no regrets but is secretly proud that the text game he founded is still played almost 15 years later.) After a decade as a developer, mentor and architect at a consulting- and product company in southern Sweden, Emil's current focus is on evangelizing the Neo netbase and preaching the demise of tabular solutions everywhere. Björn Granvik has 17 years of experience as a programmer and system architect. Born in Pascal, fostered in C/C++ and reborn in Java, he still believes that “code matters" - second only to people.
He has worked with everything from gaming to enterprise systems and has a passion for sharing knowledge. The latter is evident from his record of lectures and articles - mostly on various technical subjects in Java. A recurring speaker and expert panel facilitator, he can be found in everything from java user groups to conferences such as JAOO, Öredev and JavaOne.
|
|
Neo - a netbase for the new new programmerNeo is a so-called "netbase" -- an embedded, network-oriented database for nested and semi-structured information. Maybe that was a bit obfuscated? Let's try again. Neo handles data in a network - nodes, relationships and properties - instead of tables. This means completely new solutions for data that sometimes is tricky to handle in static tables. It also means that developers who like agile methods finally have a persistence engine that works with them instead of against them! This seminar introduces the "netbase" concept and where to put it to use. We will show you how using networks, rather than tables, as a data model solves difficult problems. And, moreover, how substantially this improves your everyday persistence programming. This will all be done using straightforward code examples. Having attended this session, we guarantee that you will not view persistence in the same way anymore...
|
