Graph shortest path search problem optimized for millions of queries
-
Updated
Feb 25, 2017 - C++
Graph shortest path search problem optimized for millions of queries
Distributed Laplace Perturbation Algorithm
Reproducing the SIGMOD paper "Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs"
"Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
Software Development university project. Task from Sigmod Contest of 2016.
🖥️ ACM Sigmod 2015 Programming Contest. This repository handles concurrent reads and writes carefully in order to achieve the isolation principle of ACID.
SVQ Streaming Video Queries
Radix-hash-join, a project based on ACM SIGMOD 2018 coding contest
A Hybrid Radix Sorting Kernel with vectorization, NUMA & page cache awareness
Implementation of Relational Matrix Algebra in MonetDB
Python implementation of algorithm defined in "Winnowing: Local Algorithms for Document Fingerprinting"
BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
Blockchain and Database Related Paper/Researcher List
BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
"Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
Postgres fork with experimental GPU query optimizer
Add a description, image, and links to the sigmod topic page so that developers can more easily learn about it.
To associate your repository with the sigmod topic, visit your repo's landing page and select "manage topics."