Brainmaker

Nanos gigantium humeris insidentes!
You are currently browsing the Graph Database category

Reasoning with Graph

  • January 11, 2013 12:07 pm

Key Value Store options

  • January 9, 2013 2:58 pm
  • http://google-opensource.blogspot.com/2011/07/leveldb-fast-persistent-key-value-store.html
  • http://stackoverflow.com/questions/6639080/key-value-store-suggestion
  • BabuDB

    BabuDB is an embedded non-relational database system. Its lean and simple design allows it to persistently store large amounts of key-value pairs without the overhead and complexity of similar approaches such as BerkeleyDB.

    License: New BSD license, Language: Java

    JDBM2

    JDBM2 provides HashMap and TreeMap which are backed by disk storage.

    License: Apache License 2.0, Language: Java

    Banana DB

    Banana DB is a self-contained key/value pair database implemented in Java.

    License: Apache License 2.0, Language: Java


    I’ve tried BabuDB and JDBM2 and they work fine. BabuDB is a little bit more difficult to set up, but potentially delivers higher performance than JDBM2.

Papers

  • January 5, 2013 7:40 pm

Survey of Graph Database Models

  • January 5, 2013 5:54 pm

RENZO ANGLES and CLAUDIO GUTIERREZ

Computer Science Department, Universidad de Chile

 

2. GRAPH DATA MODELING

a graph db-model is characterized by:

The data and/or the schema are represented by graphs, or by data structures generalizing the notion of graph (hypergraphs or hypernodes).

  •  The approach is to model the database directly and entirely as a graph [G¨uting 1994].
  • A graph db-model is one whose single underlying data structure is a labeled directed graph; the database consists of a single digraph [Levene and Loizou 1995].
  • A database schema in this model is a directed graph, where leaves represent data and internal nodes represent connections between the data [Kuper and Vardi 1984].
  • Directed labeled graphs are used as the formalism to specify and represent database schemas, instances, and rules [Paredaens et al. 1995].
  • In this model, a database is described in terms of a labeled directed graph called schema graph [Kunii 1987].
  • A graph db-model formalizes the representation of the data structures stored in the databases as a graph [Graves et al. 1995a].
  • The schema as well as the instance of an object database is represented by a graph. The nodes of the instance represent the objects of the database [Gyssens et al. 1990].
  • Database instances and database schemas are described by certain types of labeled graphs [Hidders 2002].
  • The model for data is organized as graphs [Amann and Scholl 1992]. Labeled graphs are used to represent schemas and instances [Hidders and Paredaens 1993].

Data manipulation is expressed by graph transformations [Gyssens et al. 1990], or by operations whose main primitives address directly typical features of graphs, like paths, neighborhoods, subgraphs, graph patterns, connectivity, and statistics about graphs (diameter, centrality, etc.)

 

A.12 Related Data Models