splatlab

Pinned Repositories

cqf
A General-Purpose Counting Filter: Counting Quotient Filter
Language:C125 21 934
debgr
deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
Language:C++30 9 01
iceberghashtable
Language:C53 10 16
mantis
Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
Language:C++80 16 1720
morton_filter
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
Language:C++0 2 00
rankselect
Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
Language:C++15 5 03
sdsl-lite
Succinct Data Structure Library 2.0
Language:C++2 4 00
squeakr
Squeakr: An Exact and Approximate k -mer Counting System
Language:C++85 8 4023
Sux
Implementing Succinct Data Structures from Sebastiano Vigna(http://sux.di.unimi.it)
Language:C++2 4 00
vqf
A fast approximate membership query data structure
Language:C10 5 04

splatlab's Repositories

splatlab/cqf
A General-Purpose Counting Filter: Counting Quotient Filter
Language:C125 21 934
splatlab/squeakr
Squeakr: An Exact and Approximate k -mer Counting System
Language:C++85 8 4023
splatlab/mantis
Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
Language:C++80 16 1720
splatlab/iceberghashtable
Language:C53 10 16
splatlab/debgr
deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
Language:C++30 9 01
splatlab/rankselect
Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
Language:C++15 5 03
splatlab/vqf
A fast approximate membership query data structure
Language:C10 5 04
splatlab/sdsl-lite
Succinct Data Structure Library 2.0
Language:C++2 4 00
splatlab/Sux
Implementing Succinct Data Structures from Sebastiano Vigna(http://sux.di.unimi.it)
Language:C++2 4 00
splatlab/morton_filter
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
Language:C++0 2 00
splatlab/dafny
Dafny is a verification-aware programming language
Language:C#
splatlab/firehose
The main purpose of the FireHose Streaming Benchmarks is to enable comparison of streaming software and hardware, both quantitatively vis-a-vis the rate at which they can process data, and qualitatively by judging the effort involved to implement and run the benchmarks.
Language:Python4 0
splatlab/KMC
Fast and frugal disk based k-mer counter
Language:C++4 0
splatlab/kyoto
Kyoto Tycoon key-value store (and the underlying Kyoto Cabinet library)
splatlab/lerts
Language:C++7 01
splatlab/partitionedcounter
Language:C1
splatlab/rocksdb
A library that provides an embeddable, persistent key-value store for fast storage.
Language:C++2 0