ot / semi_indexLinks
Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
☆57Updated 12 years ago
Alternatives and similar repositories for semi_index
Users that are interested in semi_index are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- An implementation of Ngo et al's GenericJoin in timely dataflow.☆89Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A collection of succinct data structures☆204Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Parses and executes Runway models of distributed systems☆50Updated 3 years ago
- Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…☆73Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Infrastructure for explaining the outputs of differential dataflow computations☆22Updated 8 years ago
- bit & sketches data structures☆60Updated 6 years ago
- a 64-bit histogram / quantile sketch☆59Updated 6 months ago
- ☆27Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Backtrace.io's resilient log record framing format☆38Updated 3 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Low-latency Overlog runtime☆18Updated 10 years ago
- RRB-tree implemented as a library in C.☆170Updated 10 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- Incremental regular expression matching☆53Updated 12 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago