Bigdata
Now Reading
FlockDB
0
Review

FlockDB

Overview
Synopsis

FlockDB is a distributed graph database for storing adjancency lists, with goals of supporting: a high rate of add/update/remove operations; potientially complex set arithmetic queries; paging through query result sets containing millions of entries; ability to "archive" and later restore archived edges; horizontal scaling including replication; and online data migration.

Category

Graph Database

Features

• a high rate of add/update/remove operations
• potientially complex set arithmetic queries
• paging through query result sets containing millions of entries
• ability to "archive" and later restore archived edges
• horizontal scaling including replication
• online data migration

License

Open Source

Price

Contact for Pricing

Pricing

Subscription

Free Trial

Available

Users Size

Small (<50 employees), Medium (50 to 1000 employees), Enterprise (>1001 employees)

Company

FlockDB

PAT Rating™ ( Beta)
Editor Rating
Aggregated User Rating
Rate Here
Ease of use
7.6
7.1
Features & Functionality
7.6
8.3
Advanced Features
7.6
8.7
Integration
7.6
Performance
7.6
Training
Customer Support
7.6
Implementation
4.9
Renew & Recommend
10
Bottom Line

FlockDB is much simpler than other graph databases such as neo4j because it tries to solve fewer problems. It scales horizontally and is designed for on-line, low-latency, high throughput environments such as web-sites.

7.6
Editor Rating
7.8
Aggregated User Rating
1 rating
You have rated this

FlockDB is a distributed graph database for storing adjancency lists, with goals of supporting: a high rate of add/update/remove operations; potientially complex set arithmetic queries; paging through query result sets containing millions of entries; ability to "archive" and later restore archived edges; horizontal scaling including replication; and online data migration. FlockDB is much simpler than other graph databases such as neo4j because it tries to solve fewer problems. It scales horizontally and is designed for on-line, low-latency, high throughput environments such as web-sites. Twitter uses FlockDB to store social graphs (who follows whom, who blocks whom) and secondary indices. As of April 2010, the Twitter FlockDB cluster stores 13+ billion edges and sustains peak traffic of 20k writes/second and 100k reads/second.

If, for example, users are storing a social graph (user A follows user B), and it's not necessarily symmetrical (A can follow B without B following A), then FlockDB can store that relationship as an edge: node A points to node B. It stores this edge with a sort position, and in both directions, so that it can answer the question "Who follows A?" as well as "Whom is A following?" This is called a directed graph. (Technically, FlockDB stores the adjacency lists of a directed graph.) Each edge has a 64-bit source ID, a 64-bit destination ID, a state (normal, removed, archived), and a 32-bit position used for sorting. The edges are stored in both a forward and backward direction, meaning that an edge can be queried based on either the source or destination ID.

Filter reviews
User Ratings





User Company size



User role





User industry





Ease of use
Features & Functionality
Advanced Features
Integration
Performance
Training
Customer Support
Implementation
Renew & Recommend

What's your reaction?
Love It
0%
Very Good
0%
INTERESTED
0%
COOL
0%
NOT BAD
0%
WHAT !
0%
HATE IT
0%