Graph Store
Get flash to fully experience Pearltrees
Building a Graph-Based Movie Recommender Engine | Architects Zone
A recommender engine helps a user find novel and interesting items within a pool of resources. There are numerous types of recommendation algorithms and a graph can serve as a general-purpose substrate for evaluating such algorithms.
Parliament™ is a high-performance triple store designed for the Semantic Web . Parliament was originally developed under the name DAML DB and was extended by BBN Technologies for internal use in its R&D programs. Parliament was released as an open source project under the BSD license here on SemWebCentral in June, 2009. ( See here also for more information about the BSD license.) Parliament™ is a trademark of BBN Technologies, Inc., and is so-named because a group of owls is properly called a "parliament" of owls. In the interests of disambiguation, please note that a separate development group at BBN has created another triple store called SHARD . SHARD is a proof-of-concept implementation of a distributed triple-store, while Parliament is an operational, fully featured triple store that runs on a single machine.
Parliament High-Performance Triple Store
Apache Hama is a pure BSP(Bulk Synchronous Parallel) computing framework on top of HDFS (Hadoop Distributed File System) for massive scientific computations such as matrix, graph and network algorithms. Currently, it has the following features: Today, many practical data processing applications require a more flexible programming abstraction model that is compatible to run on highly scalable and massive data systems (e.g., HDFS, HBase, etc). A message passing paradigm beyond Map-Reduce framework would increase its flexibility in its communication capability. Bulk Synchronous Parallel (BSP) model fills the bill appropriately. Some of its significant advantages over MapReduce and MPI are:
Hama -
How to Build an SQL Storage Adapter for RDF Data with Ruby - The Datagraph Blog
RDF.rb is approaching two thousand downloads on RubyGems , and while it has good documentation it could still use some more tutorials.
Stig Database
Our goal is to make it easy for programmers to store and access large amounts of connected data in a way that keeps consistency, while still being fast and scalable. Designed for planetary-scale, with real-time social applications and web developers in mind, Stig is the ideal database for large social networks, real-time services, and cloud applications.
