Alternatives and similar repositories for libk2tree:

Users that are interested in libk2tree are comparing it to the libraries listed below

• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• gh-rdf3x / gh-rdf3x
  Extension of the rdf3x engine and the translatesparql tool.
  ☆46Updated 11 years ago
• sslab-gatech / mosaic
  ☆81Updated 7 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆82Updated 3 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆42Updated 6 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 5 months ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• ciaranm / cp2015-subgraph-isomorphism
  CP 2015 subgraph isomorphism experiments, data and paper
  ☆13Updated 9 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆101Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 3 months ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• bindscha / chaos
  Chaos: Scale-out Graph Processing from Secondary Storage
  ☆51Updated 9 years ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆19Updated 11 years ago