T
Theodore H. Smith
OK, so I've invented a new data structure, used for look up tables
(AKA "map" or "dictionary"), which is much faster, and uses less RAM,
than the popular hashing algorithms.
I've written a demonstration library, correctness test framework and
speed testing framework. I've written a comparison using the STL
ext/hash_map, and mine performs 1.57x as fast as that one, and uses
less RAM.
So, assuming someone did invent a new high performance data structure,
which could replace some existing well known data structures, what's
the process for going about letting people know of it?
How do I let the world know? Any answers from people in the know about
data structures for lookup tables, will be very much appreciated!
In case anyone is interested, the information and code is at
www.elfdata.com/dictionary/
(AKA "map" or "dictionary"), which is much faster, and uses less RAM,
than the popular hashing algorithms.
I've written a demonstration library, correctness test framework and
speed testing framework. I've written a comparison using the STL
ext/hash_map, and mine performs 1.57x as fast as that one, and uses
less RAM.
So, assuming someone did invent a new high performance data structure,
which could replace some existing well known data structures, what's
the process for going about letting people know of it?
How do I let the world know? Any answers from people in the know about
data structures for lookup tables, will be very much appreciated!
In case anyone is interested, the information and code is at
www.elfdata.com/dictionary/