In this solutions track talk, sponsored by Cloudera, Eva Andreasson discusses how search and Hadoop can help with some of the industry's biggest challenges. She introduces the data hub concept.
In this solutions track talk, sponsored by Solace Systems, Aaron Lee discusses the value and challenges of efficiently moving information along with techniques and tools that can increase the rate and efficiency of data flows within big data architectures.
In this solutions track talk, sponsored by Neo Technology, Ian Robinson takes a look at how size, structure and connectivity have converged to transform the data landscape.
Nathan Marz discusses building NoSQL-based data systems that are scalable and easy to reason about.
Chris Mattmann envisions data science by integrating science software into rapid data production systems using cloud computing and open source software.
Igor Terzic presents several cases where Ember Data is used in production, and outlines some of the features that are intended to be included in the future.
Paul Chavard discusses advanced techniques for building large EmberJS applications with Ember Data.
Nick Kolegraff discusses common problems and architecture to support all the phases of data science and how to start a data science initiative, sharing lessons from Accenture, Best Buy, and Rackspace.
Sebastian Kanthak overviews Spanner, covering details of how Spanner relies on GPS and atomic clocks to provide two of its most innovative features: Lock-free strong (current) reads and global snapshots that are consistent with external events.
Dan Frank discusses stream data processing and introduces NSQ – Bitly’s open source queuing system – and other new technologies used for communication between streaming programs.
Alex Miller discusses Clojure’s approach to data, comparing it with OOP’s approach, and covering various related topics such as mutation, state vs. value, primitive and composite data.
Andrew Clegg overviews methods and provides use cases for performing data sets operations like membership testing, distinct counts, and nearest-neighbour finding more efficiently.