Search Results for "hash table"

...It offers many other features such as pluggable serialization support, data item versioning and an SSD Optimized Read Write storage engine. Voldemort is not a relational database or an object database. It is essentially a big, distributed, persistent, fault-tolerant hash table. This doesn’t make it ideal for all applications but does offer unique advantages, such as the ability to read and write scale horizontally, and the ability to combine in memory caching with the storage system so that a separate caching tier is not required.

This program can be used to count or remove adapter dimers in fastq files. Using a provided adapter sequence, it generates variations of this sequence and stores them in a hash table. The reads can then be directly matched against the hash. It is far more time efficient than doing alignment.

next version is 2.4.6

A general purpose distributed hash table adapted for sequence analysis. This program searches for all maximal, exact unique n-mers from a given set of genomes. Originally, this program's primary use was to design resequencing microarrays.

A SIP-based Distributed Hash Table

OpenChord is an open source implementation of the Chord distributed hash table as described in the paper by Ion Stoica et al. "Chord: A scalable peer-to-peer lookup service for internet applications". It is available under GNU GPL.

The Asunder Project aims to provide an API for a distributed hash table (DHT), along with a library implementing this API for building applications.

Dermi (Decentralized Event Remote Method Invocation) is a peer-to-peer (P2P), decentralized event-based object middleware framework built on top of a structured Distributed Hash Table based overlay network.

Jupp is a Distributed Hash Table focusing on high throughput. It's main characteristics are: 1. Mechanisms for congestion control 2. O(log n) routing for arbitrary peer distributions in the ID space.