bmuratshin / zcurveLinks
Spatial index based on Z&Hilbert curves realized as pgsql extension.
☆18Updated 7 years ago
Alternatives and similar repositories for zcurve
Users that are interested in zcurve are comparing it to the libraries listed below
Sorting:
- PostgreSQL with extensibility and performance patches☆29Updated last week
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- PostgreSQL extension which visualizes a plan tree using Graphviz☆12Updated 4 years ago
- Experiments with Postgres Table Access Methods☆23Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Save and restore query plans in PostgreSQL☆62Updated 2 years ago
- LSM tree implementation based on standard B-Tree☆32Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Show backtrace for errors and signals☆19Updated 2 years ago
- Stand-alone implementation of the progressive indexing algorithms.☆16Updated 5 years ago
- Protobuf support for PostgreSQL☆63Updated 2 years ago
- JSONB compression method for PostgreSQL☆10Updated 7 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- C++11 port of the PostgreSQL DBMS☆68Updated 8 years ago
- TPC-C for YDB☆11Updated last week
- Append-only key-value database on a distributed shared-log☆49Updated 9 months ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- mpool UAPI and CLI for HSE 1.x☆36Updated 3 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Compressed append-only pluggable storage for PostgreSQL 12+☆30Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- ViyaDB in-memory columnar analytical data store☆114Updated 5 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ☆12Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago