Rich Hickey introduces Datomic, including architectural and implementation details.
Rich Hickey discusses the complexity introduced by a database into a system, and a way to deal with it by using Datomic. He also discusses immutability, epochal time, and persistent data structures.
Robert Winch explains how to secure a multi-tenant application with Spring Security and how to enable OAuth 2.
Rich Hickey discusses the design decisions made for Datomic, a database for JVM languages: what problems they were trying to solve with it, the solutions chosen, and their implementations.
Pramod Sadalage discuses several patterns in database changes related to Architecture, Structure, Data Quality, Referential Integrity, Database Code, along with associated practices.
Justin Dearing presents a brief introduction to MongoDB, and focuses on interacting with it in Mono via the official 10gen driver. Techniques for handling business logic in application code, such as LINQ are discussed. This is a very code centric talk.
Rick Bullotta and Emil Eifrem discuss how to use graph databases to model the real world, people, systems and things, talking advantage of the relationships between various data elements.
CouchDB is a schema-free document database. But now that the NoSQL movement is in full swing, there are several document databases to choose from, so why choose Couch? Two things really set CouchDB apart from the rest: its map/reduce views and its RESTful API. Since the API is RESTful, you can easily use Couch from any platform that can talk HTTP. The benefits go way beyond that, though.
Roger Bodamer provides advice on scaling out MongoDB using replica sets and auto-sharding, plus tips for database deployment and scaling use cases.
Billy Newport explains the fundamental differences between SQL and NoSQL, creating awareness that NoSQL is not suited for many cases, and people should make informed decisions before buying into it.
Borislav Iordanov presents the architecture of HyperGraphDB, a special type of store based on hypergraphs – graphs with edges pointing to an arbitrary number of nodes and to other edges, comparing it with other graphs databases and its relationship to other NoSQL stores.
In this FutureRuby talk, Ilya Grigorik explores Tokyo Cabinet's features such as the key-value store, ordered traversal, attribute search, schemaless data structures,indexing, and scripting with Lua.