Differentially private spatial decomposition of 2D data for range queries

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

Bounded Range Query

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.

Optimizing Range Queries with 2D Location Data using Google S2

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

Research publications in Algorithms Optimization and Machine Learning

A hybrid search system combining B+ Trees for range filtering and HNSW for approximate nearest neighbor (ANN) search. Features bulkloading for efficient tree construction, HNSWLib integration, and dynamic switching between brute-force and ANN search for optimal performance. Supports binary data processing and visualization with Graphviz.