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.
Here we have implemented B-Plus Tree for data block indexing as a data system project
Online Maximum Independent Set of Hyperrectangles
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.
cses problem set solution for competitive programming.
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
Add a description, image, and links to the range-queries topic page so that developers can more easily learn about it.
To associate your repository with the range-queries topic, visit your repo's landing page and select "manage topics."