4 ms·
Less known data structures come to mind: - Topological sort. Great for dependency traversal. - KD-Tree. Great for geo-spatial search. - Consistent Hashing.
by ww520 15y ago
Less known data structures come to mind:
- Topological sort. Great for dependency traversal.
- KD-Tree. Great for geo-spatial search.
- Consistent Hashing. Great for scaling and clustering.
- Fuzzy Hashing. Great for document digest and mining. Sadly there might be a patent conflict somewhere.
- Extendible Hashtable. Amazing space-efficient and extendible lookup table.
- Bloom Filter. Space-efficient check.