tags:

views:

24

answers:

1
+1  Q: 

Best hash table for insertion and lookup only

Hi, I want to make a hash table that allows insertion and lookup only. Once something is in the table, it is in for good, unless you make a new hash table and refill the contents. Is there any algorithms/data structures that are more suited for this (over say B-tree/RB-tree/LLRB-tree)? Better would be like - faster insertion and lookup times, or can be sharded easier, or smaller overhead. Thanks

related questions

Fundamental Data Structures in C#
What are you currently using for data access?
What are good alternative data formats to XML?
One or Two Primary Keys in Many-to-Many Table?
What are some alternatives to a bit array?
How do you build a ratings implementation?
How do I efficiently keep track of the smallest element in a collection?
What is a good open source B-tree implementation in C?
What are models for storing tree structures and what are their characteristics?
Does PHP have built-in data structures?
How to maintain a recursive invariant in a MySQL database?
Aging Data Structure in C#
Is there a "Set" data structure in .Net?
Removing elements with Array.map in JavaScript
[C#] Best implementation for Key Value Pair Data Structure?
Graph visualization code in javascript?
Best way to abstract season/show/episode data
What is the best way to create a sparse array in C++
What problems can be solved, or tackled more easily, using graphs and trees?
Reading a C/C++ data structure in C# from a byte array
Good STL-like library for C.
Best self-balancing BST for quick insertion of a large number of nodes
Binary file layout reference
Mapping Stream data to data structures in C#
What is the most efficient graph data structure in Python?