JoeLeavitt / SkipTrie

Related projects: ⓘ

• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 4 years ago
• flippingbits / cssl
  Cache-Sensitive Skip List.
  ☆22Updated 6 years ago
• lemire / BitSliceIndex
  Experiments on bit-slice indexing
  ☆13Updated 9 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆19Updated 5 years ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 6 years ago
• burmanm / compression-int
  64-bit integer compression algorithms in Java
  ☆15Updated 5 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆55Updated 7 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆102Updated 7 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 9 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 7 years ago
• emaxerrno / smf
  Fastest RPC in the west
  ☆20Updated 4 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• NonVolatileComputing / pmalloc
  A Portable Persistent Memory Allocation Library
  ☆12Updated 4 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆79Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆38Updated 4 years ago
• dibyendumajumdar / simpledbm
  SimpleDBM is an Open Source Multi-Threaded Embeddable Transactional Database Engine in Java.
  ☆54Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• zrlio / jaio
  Java API for libaio
  ☆14Updated 2 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆55Updated 5 years ago
• boilerbay / airconcurrentmap
  AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation
  ☆31Updated 7 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 8 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆31Updated 11 years ago
• lemire / sparsebitmap
  A simple sparse bitmap implementation in java
  ☆21Updated 8 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 13 years ago
• richardstartin / simdbenchmarks
  ☆23Updated this week
• zrlio / jNVMf
  A NVMf library for Java
  ☆28Updated 5 years ago
• richardstartin / perfasm-visualiser
  ☆14Updated 5 years ago