Differentially private spatial decomposition of 2D data for range queries

Bounded Range Query

Implementing indexing and searching techniques for spatial data by creating an R-tree using Python.

This repository contains simple implementations of Segment Trees and Interval Trees, which were developed as part of a university project at the Computer Engineering and Informatics Department of the University of Patras. They include functions for range and stabbing queries.

Online Maximum Independent Set of Hyperrectangles

Here we have implemented B-Plus Tree for data block indexing as a data system project

Python implementation of Mo's Algorithm - a method for answering a series of range queries on the same array. The repository provides a general interface for Mos operations

cses problem set solution for competitive programming.