Search Results for "hash table"
Sort By:
Showing 7 open source projects for "hash table"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Save Up to 91% on Cloud Compute With Spot VMsRun batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
-
1
FastDHT is high performance DHT ( distributed hash table ) which based key value pairs. Storage use Berkeley DB, and network IO use libevent. It can store mass key value pairs such as filename mapping, session data and user related data.
-
2
BitDHT is a LGPL'd general purpose C++ Distributed Hash Table library. It is designed to take hassle out over creating your own DHT. BitDHT is compatible with bitttorrent's DHT and can leverage this network to bootstrap your own personal DHT.
-
3
NChord is a C# implementation of the Chord distributed hash table. The project provides a library containing the routing, lookup, and maintenance routines specified in the MIT Chord paper, and is quite stable including under heavy load and churn.
-
4
Ermdia is a yet another implementation of Kademlia, which is one of the algorithm of ditributed hash table (DHT), in Erlang. This software is lightweight, fast and easy to understand since an amount of source code is quite small.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
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.
-
6
-
7
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.
- Previous
- You're on page 1
- Next
