EDBT 2011 Uppsala

This talk gives an overview of the state of Graph Databases and the efforts that lead to the expression and processing of queries that are easy to construct and don't touch the whole connected graph dataset.

Get Started. It's Free
or sign up with your email address
Rocket clouds
EDBT 2011 Uppsala by Mind Map: EDBT 2011 Uppsala

1. NoSQL

1.1. History

1.1.1. 2009

1.1.2. OSS

1.2. Trends

1.2.1. Data Size

1.2.1.1. Exponential growth

1.2.1.2. Polarization mobile/cloud

1.2.2. Data Complexity

1.2.2.1. User generated content

1.2.2.2. Frequent schema migrations

1.2.2.3. Sparse data

1.2.2.4. Targeted analytics

1.2.2.5. Social graphs

1.2.2.6. Reasoning and automatic enhancing of information

1.2.2.7. Dynamic languages

1.3. Data Models

1.3.1. KV stores

1.3.2. Bigtable (Column)

1.3.3. DocDB

1.3.4. GraphDB

1.3.4.1. Graphs

1.3.4.1.1. Data Locality

1.3.4.1.2. Graph Models

1.3.4.2. Persistence Models

1.3.4.2.1. K/V Store

1.3.4.2.2. Memory based

1.3.4.2.3. Object Databases

1.3.4.2.4. RDBMS Wrappers

1.3.4.2.5. Multilinked storage format

1.3.4.2.6. Others

2. Thanks to

2.1. Emil Eifrem, http://neo4j.org

2.2. Marko Rodriguez, http://markorodriguez.com- graphy friend

2.3. Alex Averbuch, SICS

2.4. Pierre Senellart - Invited me

2.5. Tore Risch - EDBT 2011 Chairman

3. Who am I?

3.1. Peter Neubauer

3.1.1. [email protected]

3.1.2. @peterneubauer

3.2. OSS projects

3.2.1. Neo4j.org- Graph Database

3.2.2. Tinkerpop.com- Graph Processing Stack

3.2.3. OPS4J.org- OSGi Java

3.2.4. Qi4j.org- Domain Driven Design

3.3. Company

3.3.1. Untitled

3.4. papers on graphs

3.4.1. "The Graph Traversal Pattern" with Marko Rodriguez, http://arxiv.org/abs/1004.1001

3.4.2. "A Path Algebra for Multi-Relatoinal Graphs" with Marko Rodriguez, http://arxiv.org/abs/1011.0390