Alternatives and similar repositories for libk2tree

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

• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• gh-rdf3x / gh-rdf3x
  Extension of the rdf3x engine and the translatesparql tool.
  ☆45Updated 11 years ago
• sslab-gatech / mosaic
  ☆82Updated 7 years ago
• LLNL / havoqgt
  ☆28Updated last month
• 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
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆19Updated 11 years ago
• ciaranm / cp2015-subgraph-isomorphism
  CP 2015 subgraph isomorphism experiments, data and paper
  ☆13Updated 9 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆22Updated 4 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆44Updated 6 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆47Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• razen-alharbi / AdPart
  Accelerating SPARQL Queries by Exploiting Hash-based Locality and Adaptive Partitioning
  ☆10Updated 9 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…
  ☆110Updated 5 months ago